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
|
/* Simplest cases.
$Id: bsearch-1.c,v 1.1 2007/02/06 12:36:58 dmix Exp $
*/
#include <stdlib.h>
int cmp (const void *p1, const void *p2)
{
return *(unsigned char *)p1 - *(unsigned char *)p2;
}
int main ()
{
static unsigned char arr[100];
unsigned char key;
if (bsearch (arr, arr, 0, 1, cmp) != 0)
exit (__LINE__);
/* If element size equal to 0, Glibc and original bsearch
return comparison result of first element.
New bsearch do the same. */
if (bsearch (arr, arr, sizeof(arr), 0, cmp) != arr)
exit (__LINE__);
key = 1;
if (bsearch (& key, arr, sizeof(arr), 0, cmp) != 0)
exit (__LINE__);
/* key has address from arr */
if (bsearch (arr, arr, 1, 1, cmp) != arr)
exit (__LINE__);
/* key has another address */
key = arr[0];
if (bsearch (& key, arr, 1, 1, cmp) != arr)
exit (__LINE__);
/* key > arr[0] */
key = 1;
if (bsearch (& key, arr, 1, 1, cmp) != 0)
exit (__LINE__);
/* key < arr[0] */
arr[0] = 2;
if (bsearch (& key, arr, 1, 1, cmp) != 0)
exit (__LINE__);
return 0;
}
|
