1#if !defined(ae2f_ds_Arr_h)
22#define ae2f_ds_Arr_EQUAL ae2f_static_cast(ae2f_ds_Arr_CmpRet_t, 0)
25#define ae2f_ds_Arr_RIGHT_UNIT ae2f_static_cast(ae2f_ds_Arr_CmpRet_t, 1)
28#define ae2f_ds_Arr_LEFT_UNIT ae2f_static_cast(ae2f_ds_Arr_CmpRet_t, -1)
91#define ae2f_ds_Arr_BSearch(arr, wanted, fpElCmp, retidx, elw) ae2f_ds_Arr_BSearch_imp(arr, wanted, ae2f_reinterpret_cast(ae2f_ds_Arr_fpElCmp_t, fpElCmp), retidx, elw)
138#define ae2f_ds_Arr_QSort(arr, fpElCmp, elw) ae2f_ds_Arr_QSort_imp(arr, ae2f_reinterpret_cast(ae2f_ds_Arr_fpElCmp_t, fpElCmp), elw)
ae2f_ds_Arr_CmpRet_t(* ae2f_ds_Arr_fpElCmp_t)(const void *l, const void *r)
It is an api for following approximate pseudo code.
Definition Arr.h:19
ae2f_SHAREDCALL ae2f_extern ae2f_errint_t ae2f_ds_Arr_QSort_imp(ae2f_struct ae2f_ds_cAlloc *arr, const ae2f_ds_Arr_fpElCmp_t fpElCmp, size_t elsize)
Order the arr via quick sort.
int ae2f_ds_Arr_CmpRet_t
A predefined returning data type for ae2f_ds_Arr_fpElCmp_t.
Definition Arr.h:11
ae2f_SHAREDCALL ae2f_extern ae2f_errint_t ae2f_ds_Arr_BSearch_imp(const ae2f_struct ae2f_ds_cAlloc *arr, const void *wanted, const ae2f_ds_Arr_fpElCmp_t fpElCmp, size_t *out, size_t elsize)
Finds the element [wanted] via binary search.
#define ae2f_SHAREDCALL
Definition Call.h:58
#define ae2f_struct
In C, keyword 'struct' must be written in front of the structure's name in order to use as a type nam...
Definition Cast.h:81
#define ae2f_extern
Suggests the existence of external variable or function, in naming of C. [non-mangling].
Definition Cast.h:85
uint8_t ae2f_errint_t
Informs that this number represents the error.
Definition errGlob.h:10
The data holder for [cRef] and [cOwn].
Definition Alloc.h:39