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

rename

Browse Source
This commit is contained in:
Richard Thier 2021-03-11 22:38:23 +01:00
parent cfc9a050e4
commit 83ae455c34
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
magyarsort.h
View File

@ -51,7 +51,7 @@ namespace MagyarSort {
} }
}; };
static inline void calcOccurences(uint32_t arr[], size_t size, size_t *radicsOut) { static inline void countOccurences(uint32_t arr[], size_t size, size_t *radicsOut) {
for(size_t i = 0; i < size; ++i) { for(size_t i = 0; i < size; ++i) {
// Creates no object, struct is empty // Creates no object, struct is empty
OccurenceMagic<DIGITS - 1>(arr, i, radicsOut); OccurenceMagic<DIGITS - 1>(arr, i, radicsOut);
@ -76,7 +76,7 @@ namespace MagyarSort {
for(int i = 0; i < (DIGITS * DIGIT_RANGE); ++i) { radics[i] = 0; } for(int i = 0; i < (DIGITS * DIGIT_RANGE); ++i) { radics[i] = 0; }
// Calculate occurences of digits // Calculate occurences of digits
calcOccurences(arr, size, radics); countOccurences(arr, size, radics);
// Calculate prefix sums // Calculate prefix sums
// TODO: Maybe should use better ILP here? // TODO: Maybe should use better ILP here?