1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
/**
* slibc — Yet another C library
* Copyright © 2015, 2016 Mattias Andrée (m@maandree.se)
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdlib.h>
# pragma GCC diagnostic ignored "-Wdiscarded-qualifiers"
/**
* Search for an item in a sorted list of comparable
* elements. The list must be sorted in ascending order.
* The function usually implements binary search,
* as is done in this implementation.
*
* @etymology (B)inary (search).
*
* @param sought The sought item.
* @param list The beginning of the list to search.
* @param n The number of elements in the list.
* @param width The width, in bytes, of each element in the list.
* @param compar A function that shall compare two items, and return
* a value less than, equal to, or greater than zero
* if the first argument is less than, equal to, or
* greater than the second argument, respectively.
* @return The address of an arbritrart element in `list` that
* is equal to `sought`, or `NULL` if no such element
* can be found (does not exist, or because `list`
* is not properly sorted.)
*
* @since Always.
*/
void* (bsearch)(const void* sought, const void* list, size_t n, size_t width,
int (*compar)(const void*, const void*))
{
int cmp;
size_t i;
char* test;
if (n == 0)
return NULL;
for (;;)
{
i = n >> 1;
test = (char*)list + i * width;
cmp = compar(sought, test);
if (!i)
return cmp ? NULL : test;
else if (cmp < 0)
n = i;
else if (cmp > 0)
n -= i, list = test;
else
return test;
}
}
|
