cyberpresidentvanellope/vgstation13
1
0
Fork 0
mirror of https://github.com/vgstation-coders/vgstation13.git synced 2025-12-10 18:32:03 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fast macro-based heapsort (#32381)

Browse Source
This commit is contained in:
Exxion
2022-04-12 17:17:57 -04:00
committed by GitHub
parent 7732d4ce14
commit 3df745afcf
2 changed files with 34 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

33
__DEFINES/sort.dm Normal file
View File

@@ -0,0 +1,33 @@
#define SIFT_DOWN(L, comparison, n, i) do { \
var/SIFT_DOWN_largest = i; \
var/SIFT_DOWN_i; \
do { \
SIFT_DOWN_i = SIFT_DOWN_largest; \
var/SIFT_DOWN_l = 2 * SIFT_DOWN_largest; \
var/SIFT_DOWN_r = SIFT_DOWN_l + 1; \
if(SIFT_DOWN_l <= n) { \
if(comparison(L[SIFT_DOWN_l], L[SIFT_DOWN_largest])) { \
SIFT_DOWN_largest = SIFT_DOWN_l; \
} \
if((SIFT_DOWN_r <= n) && comparison(L[SIFT_DOWN_r], L[SIFT_DOWN_largest])) { \
SIFT_DOWN_largest = SIFT_DOWN_r; \
} \
} \
L.Swap(SIFT_DOWN_i, SIFT_DOWN_largest); \
} while(SIFT_DOWN_largest != SIFT_DOWN_i);} while(FALSE)
#define SORT(L, comparison) do { \
var/SORT_N = L.len; \
for(var/SORT_i in round(SORT_N / 2) to 1 step -1) { \
SIFT_DOWN(L, comparison, SORT_N, SORT_i); \
} \
for(var/SORT_i in SORT_N to 2 step -1) { \
L.Swap(1, SORT_i); \
SIFT_DOWN(L, comparison, SORT_i - 1, 1); \
}} while(FALSE)
#define GREATER(a, b) (a > b)
#define LESS(a, b) (a < b)
#define SORT_ASC(L) SORT(L, GREATER)
#define SORT_DSC(L) SORT(L, LESS)

1
vgstation13.dme
View File

@@ -66,6 +66,7 @@
#include "__DEFINES\silicon.dm" #include "__DEFINES\silicon.dm"
#include "__DEFINES\simple_animal_defines.dm" #include "__DEFINES\simple_animal_defines.dm"
#include "__DEFINES\snow.dm" #include "__DEFINES\snow.dm"
#include "__DEFINES\sort.dm"
#include "__DEFINES\spell_defines.dm" #include "__DEFINES\spell_defines.dm"
#include "__DEFINES\striketeam_defines.dm" #include "__DEFINES\striketeam_defines.dm"
#include "__DEFINES\stylesheet.dm" #include "__DEFINES\stylesheet.dm"