1 /* bsearch( const void *, const void *, size_t, size_t, int(*)( const void *, const void * ) )
3 This file is part of the Public Domain C Library (PDCLib).
4 Permission is granted to use, modify, and / or redistribute at will.
11 void * bsearch( const void * key, const void * base, size_t nmemb, size_t size, int (*compar)( const void *, const void * ) )
18 /* algorithm needs -1 correction if remaining elements are an even number. */
21 pivot = (const char *)base + (nmemb * size);
22 rc = compar( key, pivot );
25 base = (const char *)pivot + size;
26 /* applying correction */
27 nmemb -= ( 1 - corr );
40 #include <_PDCLIB_test.h>
42 static int compare( const void * left, const void * right )
44 return *( (unsigned char *)left ) - *( (unsigned char *)right );
49 TESTCASE( bsearch( "e", abcde, 4, 1, compare ) == NULL );
50 TESTCASE( bsearch( "e", abcde, 5, 1, compare ) == &abcde[4] );
51 TESTCASE( bsearch( "a", abcde + 1, 4, 1, compare ) == NULL );
52 TESTCASE( bsearch( "0", abcde, 1, 1, compare ) == NULL );
53 TESTCASE( bsearch( "a", abcde, 1, 1, compare ) == &abcde[0] );
54 TESTCASE( bsearch( "a", abcde, 0, 1, compare ) == NULL );
55 TESTCASE( bsearch( "e", abcde, 3, 2, compare ) == &abcde[4] );
56 TESTCASE( bsearch( "b", abcde, 3, 2, compare ) == NULL );