mirror of
https://github.com/pocketpy/pocketpy
synced 2025-12-11 12:40:18 +00:00
41 lines
2.5 KiB
C
41 lines
2.5 KiB
C
#pragma once
|
|
|
|
#include <stdbool.h>
|
|
|
|
#define c11__less(a, b) ((a) < (b))
|
|
|
|
#define c11__lower_bound(T, ptr, count, key, less, out_index) \
|
|
do { \
|
|
T* __first = ptr; \
|
|
int __len = count; \
|
|
while(__len > 8) { \
|
|
int __l2 = __len >> 1; \
|
|
T* __m = __first + __l2; \
|
|
if(less((*__m), (key))) { \
|
|
__first = ++__m; \
|
|
__len -= __l2 + 1; \
|
|
} else { \
|
|
__len = __l2; \
|
|
} \
|
|
} \
|
|
while(__len && less(*__first, (key))) { \
|
|
++__first; \
|
|
--__len; \
|
|
} \
|
|
*(out_index) = __first - (T*)(ptr); \
|
|
} while(0)
|
|
|
|
/**
|
|
* @brief Sorts an array of elements of the same type, using the given comparison function.
|
|
* @param ptr Pointer to the first element of the array.
|
|
* @param count Number of elements in the array.
|
|
* @param elem_size Size of each element in the array.
|
|
* @param cmp Comparison function that takes two elements and returns an integer similar to
|
|
* `strcmp`.
|
|
*/
|
|
bool c11__stable_sort(void* ptr,
|
|
int length,
|
|
int elem_size,
|
|
int (*f_lt)(const void* a, const void* b, void* extra),
|
|
void* extra);
|