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
|
/* Copyright (c) 2005 PrimeBase Technologies GmbH
*
* PrimeBase XT
*
* 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 2 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, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* 2004-01-03 Paul McCullagh
*
* H&G2JCtL
*/
#include "xt_config.h"
#include <stdio.h>
#include "bsearch_xt.h"
#include "pthread_xt.h"
#include "thread_xt.h"
/**
* Binary search a array of 'count' items, with byte size 'size'. This
* function returns a pointer to the element and the 'index'
* of the element if found.
*
* If not found the index of the insert point of the item
* is returned (0 <= index <= count).
*
* The comparison routine 'compar' may throw an exception.
* In this case the error details will be stored in 'thread'.
*/
void *xt_bsearch(XTThreadPtr thread, const void *key, register const void *base, size_t count, size_t size, size_t *idx, const void *thunk, XTCompareFunc compar)
{
register size_t i;
register size_t guess;
register int r;
i = 0;
while (i < count) {
guess = (i + count - 1) >> 1;
r = (compar)(thread, thunk, key, ((char *) base) + guess * size);
if (r == 0) {
*idx = guess;
return ((char *) base) + guess * size;
}
if (r < 0)
count = guess;
else
i = guess + 1;
}
*idx = i;
return NULL;
}
|