eric/Crosspoint
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Mirror upstream PR#1817

Browse Source
This commit is contained in:
jpirnay
2026-05-04 16:52:54 +02:00
parent 7a0dc31c2f
commit 47946def00
1 changed files with 5 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files
lib/GfxRenderer/GfxRenderer.cpp
+5 -10
View File
@@ -7,8 +7,11 @@
#include <Utf8.h> #include <Utf8.h>
#include <esp_heap_caps.h> #include <esp_heap_caps.h>
#include <algorithm>
#include "FontCacheManager.h" #include "FontCacheManager.h"
const uint8_t* GfxRenderer::getGlyphBitmap(const EpdFontData* fontData, const EpdGlyph* glyph) const { const uint8_t* GfxRenderer::getGlyphBitmap(const EpdFontData* fontData, const EpdGlyph* glyph) const {
if (fontData->groups != nullptr) { if (fontData->groups != nullptr) {
auto* fd = fontCacheManager_ ? fontCacheManager_->getDecompressor() : nullptr; auto* fd = fontCacheManager_ ? fontCacheManager_->getDecompressor() : nullptr;
@@ -1696,16 +1699,8 @@ void GfxRenderer::fillPolygon(const int* xPoints, const int* yPoints, int numPoi
j = i; j = i;
} }
// Sort nodes by X (simple bubble sort, numPoints is small) // Sort nodes by X
for (int i = 0; i < nodes - 1; i++) { std::sort(nodeX, nodeX + nodes);
for (int k = i + 1; k < nodes; k++) {
if (nodeX[i] > nodeX[k]) {
int temp = nodeX[i];
nodeX[i] = nodeX[k];
nodeX[k] = temp;
}
}
}
// Fill between pairs of nodes // Fill between pairs of nodes
for (int i = 0; i < nodes - 1; i += 2) { for (int i = 0; i < nodes - 1; i += 2) {