15requires (std::is_unsigned_v<std::decay_t<T>> &&
sizeof(T) == 8)
33requires (std::is_unsigned_v<std::decay_t<T>> &&
sizeof(T) == 4)
58template <std::
integral T>
60 return x && (!(x&(x-1)));
92template <
typename RandItr,
typename C>
94 return cmp(*l, *m) ? (cmp(*m, *r) ? m : (cmp(*l, *r) ? r : l ))
95 : (cmp(*r, *m) ? m : (cmp(*r, *l) ? r : l ));
116template <
typename RandItr,
typename C>
118 size_t N = std::distance(beg, end);
119 size_t offset = N >> 3;
141template<
typename Iter,
typename Compare>
142void sort2(Iter a, Iter b, Compare comp) {
143 if (comp(*b, *a)) std::iter_swap(a, b);
161template<
typename Iter,
typename Compare>
162void sort3(Iter a, Iter b, Iter c, Compare comp) {
182template <std::
integral T>
184 static std::atomic<T> counter{0};
185 return counter.fetch_add(1, std::memory_order_relaxed);
204inline void atomic_max(std::atomic<T>& v,
const T& max_v)
noexcept {
205 T prev = v.load(std::memory_order_relaxed);
206 while(prev < max_v &&
207 !v.compare_exchange_weak(prev, max_v, std::memory_order_relaxed,
208 std::memory_order_relaxed)) {
228inline void atomic_min(std::atomic<T>& v,
const T& min_v)
noexcept {
229 T prev = v.load(std::memory_order_relaxed);
230 while(prev > min_v &&
231 !v.compare_exchange_weak(prev, min_v, std::memory_order_relaxed,
232 std::memory_order_relaxed)) {
249 return std::chrono::system_clock::now().time_since_epoch().count();
269 for (
size_t x = N; --x > 0;) {
270 if (std::gcd(x, N) == 1) {
288 static_assert(N>0,
"N must be greater than 0");
289 std::array<size_t, N> coprimes{};
290 for (
size_t n = 0; n < N; ++n) {
321 static_assert(std::is_unsigned<T>::value,
"Xorshift requires an unsigned integral type.");
368 if constexpr (
sizeof(T) == 8) {
370 _state ^= _state << 13;
371 _state ^= _state >> 7;
372 _state ^= _state << 17;
373 return _state * 0x2545F4914F6CDD1DULL;
375 else if constexpr (
sizeof(T) == 4) {
377 _state ^= _state << 13;
378 _state ^= _state >> 17;
379 _state ^= _state << 5;
383 static_assert(
sizeof(T) == 0,
"Unsupported bit-width for Xorshift. Use uint32_t or uint64_t.");
void seed(T value)
seeds the generator with a new value
Definition math.hpp:350
T operator()()
generates the next pseudo-random value
Definition math.hpp:367
Xorshift(T value)
constructs a xor-shift generator with the given seed
Definition math.hpp:340
Xorshift()=default
constructs an uninitialized xor-shift generator
taskflow namespace
Definition small_vector.hpp:20
RandItr median_of_three(RandItr l, RandItr m, RandItr r, C cmp)
finds the median of three numbers pointed to by iterators using the given comparator
Definition math.hpp:93
T unique_id()
generates a program-wide unique ID of the given type in a thread-safe manner
Definition math.hpp:183
constexpr size_t coprime(size_t N)
computes a coprime of a given number
Definition math.hpp:265
T seed() noexcept
generates a random seed based on the current system clock
Definition math.hpp:248
constexpr T next_pow2(T x)
rounds the given 64-bit unsigned integer to the nearest power of 2
Definition math.hpp:16
void atomic_max(std::atomic< T > &v, const T &max_v) noexcept
updates an atomic variable with the maximum value
Definition math.hpp:204
void atomic_min(std::atomic< T > &v, const T &min_v) noexcept
updates an atomic variable with the minimum value
Definition math.hpp:228
constexpr std::array< size_t, N > make_coprime_lut()
generates a compile-time array of coprimes for numbers from 0 to N-1
Definition math.hpp:287
RandItr pseudo_median_of_nine(RandItr beg, RandItr end, C cmp)
finds the pseudo median of a range of items using a spread of nine numbers
Definition math.hpp:117
void sort3(Iter a, Iter b, Iter c, Compare comp)
Sorts three elements of dereferenced iterators using the given comparison function.
Definition math.hpp:162
void sort2(Iter a, Iter b, Compare comp)
sorts two elements of dereferenced iterators using the given comparison function
Definition math.hpp:142
constexpr size_t static_floor_log2()
returns the floor of log2(N) at compile time
Definition math.hpp:67
constexpr bool is_pow2(const T &x)
checks if the given number is a power of 2
Definition math.hpp:59