size_t _STLP_CALL
_Stl_prime<_Dummy>::_S_next_size(size_t __n) {
size_t __size;
const size_t* __first = _S_primes(__size);
const size_t* __last = __first + __size;
const size_t* pos = __lower_bound(__first, __last, __n,
__less((size_t*)0), __less((size_t*)0), (ptrdiff_t*)0);
return (pos == __last ? *(__last - 1) : *pos);
}
size_t _STLP_CALL
_Stl_prime<_Dummy>::_S_next_size(size_t __n) {
static const size_t _list[] = __PRIME_LIST_BODY;
const size_t* __first = _list;
# ifndef __MWERKS__
const size_t* __last = _list + (sizeof(_list)/sizeof(_list[0]));
# else
const size_t* __last = _list + (30/sizeof(size_t)); // stupid MWERKS
# endif
const size_t* pos = __lower_bound(__first, __last, __n,
__less((size_t*)0), __less((size_t*)0), (ptrdiff_t*)0);
return (pos == __last ? *(__last - 1) : *pos);
}
void _STLP_CALL
_Stl_prime<_Dummy>::_S_prev_sizes(size_t __n, size_t const*&__begin, size_t const*&__pos) {
size_t __size;
__begin = _S_primes(__size);
const size_t* __last = __begin + __size;
__pos = __lower_bound(__begin, __last, __n,
__less((size_t*)0), __less((size_t*)0), (ptrdiff_t*)0);
if (__pos== __last)
--__pos;
else if (*__pos == __n) {
if (__pos != __begin)
--__pos;
}
}
__size_type__
hashtable<_Val,_Key,_HF,_ExK,_EqK,_All>::_M_next_size(size_type __n) const {
const size_type* __first = (const size_type*)_Stl_prime_type::_M_list;
const size_type* __last = (const size_type*)_Stl_prime_type::_M_list + (int)__stl_num_primes;
const size_type* pos = __lower_bound(__first, __last, __n, __less((size_type*)0), (ptrdiff_t*)0);
return (pos == __last ? *(__last - 1) : *pos);
}
