prenex/magyarsort
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

interestingly the code I marked "rotten" might actually work lol

Browse Source
This commit is contained in:
Richard Thier 2023-07-01 04:53:42 +02:00
parent 4ad1c8b820
commit c05e484ea0
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
thiersort.h
View File

@ -630,7 +630,7 @@ static inline void ts_quicksort_fromto(
const TSU32 bi, const TSU32 bi,
void *reent_data), void *reent_data),
void *reent_data) { void *reent_data) {
// FIXME: Code is rotten here - see above variant pls! // TODO: Check if code around here is good - tests look like OK, but I thought its buggy!?
if(from >= to) return; if(from >= to) return;
TSU32 len = (to - from); TSU32 len = (to - from);