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

noexcept

Browse Source
This commit is contained in:
Richard Thier 2021-03-11 22:39:53 +01:00
parent 83ae455c34
commit f30b5056cc
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 countOccurences(uint32_t arr[], size_t size, size_t *radicsOut) { static inline void countOccurences(uint32_t arr[], size_t size, size_t *radicsOut) noexcept {
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);
@ -59,7 +59,7 @@ namespace MagyarSort {
} }
template<int DIGIT_CHOICE> template<int DIGIT_CHOICE>
static inline void prefixSum(size_t *radics) { static inline void prefixSum(size_t *radics) noexcept {
static constexpr int DSTART = DIGIT_CHOICE * DIGIT_RANGE; static constexpr int DSTART = DIGIT_CHOICE * DIGIT_RANGE;
size_t prev = 0; size_t prev = 0;
for(int i = DSTART; i < (DSTART + DIGIT_RANGE); ++i) { for(int i = DSTART; i < (DSTART + DIGIT_RANGE); ++i) {