65 lines
2.3 KiB
C
65 lines
2.3 KiB
C
/**
|
|
* \file
|
|
* bsearch () implementation. Needed because some broken platforms
|
|
* have implementations that have unreasonable, non-standard
|
|
* requirements (e.g. "key must not be null"). Taken from NetBSD
|
|
* with some minor modifications.
|
|
*
|
|
* Copyright (c) 1990, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#include "mono/utils/bsearch.h"
|
|
|
|
void *
|
|
mono_binary_search (
|
|
const void *key,
|
|
const void *array,
|
|
size_t array_length,
|
|
size_t member_size,
|
|
BinarySearchComparer comparer)
|
|
{
|
|
const char *base = (const char *)array;
|
|
size_t lim;
|
|
int cmp;
|
|
const void *p;
|
|
|
|
for (lim = array_length; lim; lim >>= 1) {
|
|
p = base + (lim >> 1) * member_size;
|
|
cmp = (* comparer) (key, p);
|
|
|
|
if (!cmp)
|
|
return (void *) p;
|
|
else if (cmp > 0) {
|
|
base = (const char *) p + member_size;
|
|
lim--;
|
|
}
|
|
}
|
|
|
|
return NULL;
|
|
}
|