source file of the Flower Library
- (c) 1997--2000 Han-Wen Nienhuys <hanwen@cs.uu.nl>
+ (c) 1997--2005 Han-Wen Nienhuys <hanwen@cs.uu.nl>
*/
Array<void*>::size;
Array<void*>::clear;
Array<void*>::set_size;
- Array<void*>::empty;
+ Array<void*>::is_empty;
Array<void*>::reverse;
Array<void*>::tighten_maxsize;
*/
template<class T>
int
-binsearchs (Array<T> const &arr, T t, int (*compare) (T const&,T const&))
+binsearch (Array<T> const &arr, T t, int (*compare) (T const&,T const&))
{
int lo;
int hi;
int cmp;
int result;
lo = 0;
- hi = maxkey;
+ hi = Array<T>::maxkey;
/* binary search */
do
{
cmp = (lo + hi) / 2;
- result = compare (t, arr[cmp]);
+ result = (*compare) (t, arr[cmp]);
if (result < 0)
hi = cmp;