|
| 1 | +/*----------------------------------------------------------------------------------------------- |
| 2 | +The MIT License (MIT) |
| 3 | +
|
| 4 | +Copyright (c) 2014-2025 Kim Kulling |
| 5 | +
|
| 6 | +Permission is hereby granted, free of charge, to any person obtaining a copy of |
| 7 | +this software and associated documentation files (the "Software"), to deal in |
| 8 | +the Software without restriction, including without limitation the rights to |
| 9 | +use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of |
| 10 | +the Software, and to permit persons to whom the Software is furnished to do so, |
| 11 | +subject to the following conditions: |
| 12 | +
|
| 13 | +The above copyright notice and this permission notice shall be included in all |
| 14 | +copies or substantial portions of the Software. |
| 15 | +
|
| 16 | +THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
| 17 | +IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS |
| 18 | +FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR |
| 19 | +COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER |
| 20 | +IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN |
| 21 | +CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. |
| 22 | +-----------------------------------------------------------------------------------------------*/ |
| 23 | +#pragma once |
| 24 | + |
| 25 | +#include <cppcore/CPPCoreCommon.h> |
| 26 | + |
| 27 | +namespace cppcore { |
| 28 | + |
| 29 | + typedef int32_t (*ComparisonFn)(const void* _lhs, const void* _rhs); |
| 30 | + |
| 31 | + template<class T> |
| 32 | + inline int32_t compAscending(const void *lhs, const void *rhs) { |
| 33 | + const T _lhs = *static_cast<const T *>(lhs); |
| 34 | + const T _rhs = *static_cast<const T *>(rhs); |
| 35 | + return (_lhs > _rhs) - (_lhs < _rhs); |
| 36 | + } |
| 37 | + |
| 38 | + template <typename Ty> |
| 39 | + inline int32_t compDescending(const void *_lhs, const void *_rhs) { |
| 40 | + return compAscending<Ty>(_rhs, _lhs); |
| 41 | + } |
| 42 | + |
| 43 | + template<class T> |
| 44 | + inline void swap(T& v1, T& v2) { |
| 45 | + T tmp = v1; |
| 46 | + v1 = v2; |
| 47 | + v2 = tmp; |
| 48 | + } |
| 49 | + |
| 50 | + inline void swap(uint8_t &lhs, uint8_t &rhs) { |
| 51 | + uint8_t tmp = lhs; |
| 52 | + lhs = rhs; |
| 53 | + rhs = tmp; |
| 54 | + } |
| 55 | + |
| 56 | + inline void swap(void *v1, void *v2, size_t stride) { |
| 57 | + uint8_t *lhs = (uint8_t*) v1; |
| 58 | + uint8_t *rhs = (uint8_t*) v2; |
| 59 | + const uint8_t *end = rhs + stride; |
| 60 | + while (rhs != end) { |
| 61 | + swap(*lhs++, *rhs++); |
| 62 | + } |
| 63 | + } |
| 64 | + |
| 65 | + inline void quicksortImpl(void *pivot, void *_data, size_t num, size_t stride, ComparisonFn func) { |
| 66 | + if (num < 2) { |
| 67 | + return; |
| 68 | + } |
| 69 | + |
| 70 | + if (_data == nullptr) { |
| 71 | + return; |
| 72 | + } |
| 73 | + |
| 74 | + uint8_t *data = (uint8_t*) _data; |
| 75 | + memcpy(pivot, &data[0], stride); |
| 76 | + |
| 77 | + size_t l = 0; |
| 78 | + size_t g = 1; |
| 79 | + for (size_t i=1; i<num;) { |
| 80 | + int32_t result = func(&data[i*stride], pivot); |
| 81 | + if (result > 0) { |
| 82 | + swap(&data[l*stride], &data[i*stride], stride); |
| 83 | + ++l; |
| 84 | + } else if (result == 0) { |
| 85 | + swap(&data[g*stride], &data[i*stride], stride); |
| 86 | + ++g; |
| 87 | + ++i; |
| 88 | + } else { |
| 89 | + ++i; |
| 90 | + } |
| 91 | + } |
| 92 | + |
| 93 | + quicksortImpl(pivot, &data[0], l, stride, func); |
| 94 | + quicksortImpl(pivot, &data[g*stride], num - g, stride, func); |
| 95 | + } |
| 96 | + |
| 97 | + inline void quicksort(void *_data, size_t num, size_t stride, ComparisonFn func) { |
| 98 | + uint8_t *pivot = (uint8_t*) CPPCORE_STACK_ALLOC(stride); |
| 99 | + quicksortImpl(pivot, _data, num, stride, func); |
| 100 | + } |
| 101 | + |
| 102 | + bool isSorted(const void *data, size_t num, size_t stride, ComparisonFn func) { |
| 103 | + if (num < 2) { |
| 104 | + return true; |
| 105 | + } |
| 106 | + uint8_t *data_ = (uint8_t *)data; |
| 107 | + for (size_t i=1; i<num; ++i) { |
| 108 | + const int32_t result = func(&data_[(i-1)*stride], &data_[i * stride]); |
| 109 | + if (result == -1) { |
| 110 | + return false; |
| 111 | + } |
| 112 | + } |
| 113 | + |
| 114 | + return true; |
| 115 | + } |
| 116 | + |
| 117 | + inline int32_t binSearchImpl(void *key, void *data, size_t num, size_t stride, ComparisonFn func) { |
| 118 | + size_t offset = 0; |
| 119 | + uint8_t *_data = (uint8_t *)data; |
| 120 | + for (size_t i = num; offset < i;) { |
| 121 | + size_t idx = (offset + i) / 2; |
| 122 | + int32_t result = func(key, &_data[i * stride]); |
| 123 | + if (result < 0) { |
| 124 | + i = idx; |
| 125 | + } else if (result > 0) { |
| 126 | + offset = idx + 1; |
| 127 | + } else { |
| 128 | + return idx; |
| 129 | + } |
| 130 | + } |
| 131 | + return ~offset; |
| 132 | + } |
| 133 | + |
| 134 | + int32_t binSearch(int32_t key, int32_t* array, size_t num, ComparisonFn func) { |
| 135 | + return binSearchImpl(&key, &array[0], num, sizeof(int32_t), func); |
| 136 | + } |
| 137 | +} // namespace cppcore |
0 commit comments