Upstream/CloverBootloader
1
0
Fork 0
mirror of https://github.com/CloverHackyColor/CloverBootloader.git synced 2025-01-08 18:57:39 +01:00
Code Issues Packages Projects Releases Wiki Activity

using lambda

Browse Source 
Signed-off-by: SergeySlice <sergey.slice@gmail.com>
This commit is contained in:
SergeySlice 2022-02-18 20:44:36 +03:00
parent b71e22c298
commit b55b199188
1 changed files with 13 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
rEFIt_UEFI/libeg/lodepng.cpp
View File

@ -995,15 +995,17 @@ static BPMNode* bpmnode_create(BPMLists* lists, int weight, unsigned index, BPMN
/*sort the leaves with stable mergesort*/ /*sort the leaves with stable mergesort*/
//qsort(leaves, numpresent, sizeof(BPMNode), bpmnode_compare); //qsort(leaves, numpresent, sizeof(BPMNode), bpmnode_compare);
/*
static int bpmnode_compare(const void* a, const void* b) static int bpmnode_compare(const void* a, const void* b)
{ {
int wa = ((const BPMNode*)a)->weight; int wa = ((const BPMNode*)a)->weight;
int wb = ((const BPMNode*)b)->weight; int wb = ((const BPMNode*)b)->weight;
if (wa < wb) return -1; if (wa < wb) return -1;
if (wa > wb) return 1; if (wa > wb) return 1;
/*make the qsort a stable sort*/ //make the qsort a stable sort
return 0; //(((const BPMNode*)a)->index < ((const BPMNode*)b)->index) ? 1 : -1; return 0; //(((const BPMNode*)a)->index < ((const BPMNode*)b)->index) ? 1 : -1;
} }
*/
#if BPM_SORT #if BPM_SORT
static void bpmnode_sort(BPMNode* leaves, size_t num) { static void bpmnode_sort(BPMNode* leaves, size_t num) {
@ -1094,7 +1096,16 @@ unsigned lodepng_huffman_code_lengths(unsigned* lengths, const unsigned* frequen
BPMNode* node; BPMNode* node;
// bpmnode_sort(leaves, numpresent); // bpmnode_sort(leaves, numpresent);
QuickSort(leaves, numpresent, sizeof(BPMNode), bpmnode_compare); // QuickSort(leaves, numpresent, sizeof(BPMNode), bpmnode_compare);
QuickSort(leaves, numpresent, sizeof(BPMNode), [](const void *a,const void *b)->int {
int wa = ((const BPMNode*)a)->weight;
int wb = ((const BPMNode*)b)->weight;
if (wa < wb) return -1;
if (wa > wb) return 1;
return 0;
});
lists.listsize = maxbitlen; lists.listsize = maxbitlen;
lists.memsize = 2 * maxbitlen * (maxbitlen + 1); lists.memsize = 2 * maxbitlen * (maxbitlen + 1);
lists.nextfree = 0; lists.nextfree = 0;