Lines Matching defs:search
19 * search over an array. Binary search is a worst case scenario for branch
244 /* return greatest node <= @search, or -1 if not found */
246 cmp_func_t cmp, const void *search)
255 n = eytzinger0_child(i, cmp(base + i * size, search) <= 0);
260 * @i was greater than @search, return previous node:
272 cmp_func_t cmp, const void *search)
274 ssize_t idx = eytzinger0_find_le(base, nr, size, cmp, search);
277 * if eytitzinger0_find_le() returned -1 - no element was <= search - we
287 #define eytzinger0_find(base, nr, size, _cmp, search) \
290 const void *_search = (search); \