From e78b91ce0e473db3da75800ece2f106bac3f4c1c Mon Sep 17 00:00:00 2001 From: Paolo Carlini Date: Sat, 1 Dec 2007 18:31:17 +0000 Subject: hashtable_policy.h (struct _LessThan): Remove. 2007-12-01 Paolo Carlini * include/tr1_impl/hashtable_policy.h (struct _LessThan): Remove. (_Prime_rehash_policy::_M_bkt_for_elements, _Prime_rehash_policy:: _M_need_rehash): Adjust. From-SVN: r130558 --- libstdc++-v3/ChangeLog | 6 ++++++ libstdc++-v3/include/tr1_impl/hashtable_policy.h | 13 ++----------- 2 files changed, 8 insertions(+), 11 deletions(-) (limited to 'libstdc++-v3') diff --git a/libstdc++-v3/ChangeLog b/libstdc++-v3/ChangeLog index e5dc1f9..2c5ba2e 100644 --- a/libstdc++-v3/ChangeLog +++ b/libstdc++-v3/ChangeLog @@ -1,5 +1,11 @@ 2007-12-01 Paolo Carlini + * include/tr1_impl/hashtable_policy.h (struct _LessThan): Remove. + (_Prime_rehash_policy::_M_bkt_for_elements, _Prime_rehash_policy:: + _M_need_rehash): Adjust. + +2007-12-01 Paolo Carlini + * include/bits/stl_tempbuf.h (__get_temporary_buffer): Fold in get_temporary_buffer. diff --git a/libstdc++-v3/include/tr1_impl/hashtable_policy.h b/libstdc++-v3/include/tr1_impl/hashtable_policy.h index 79740fa..5c48504 100644 --- a/libstdc++-v3/include/tr1_impl/hashtable_policy.h +++ b/libstdc++-v3/include/tr1_impl/hashtable_policy.h @@ -66,14 +66,6 @@ namespace __detail // place to put TR1 .cc files yet. There's no good reason for any of // _Prime_rehash_policy's member functions to be inline, and there's // certainly no good reason for _Primes<> to exist at all. - struct _LessThan - { - template - bool - operator()(_Tp __x, _Up __y) - { return __x < __y; } - }; - template struct _Primes { @@ -545,7 +537,7 @@ namespace __detail + _Primes<>::__n_primes); const float __min_bkts = __n / _M_max_load_factor; const unsigned long* __p = std::lower_bound(_Primes<>::__primes, __last, - __min_bkts, _LessThan()); + __min_bkts); _M_next_resize = static_cast(std::ceil(*__p * _M_max_load_factor)); return *__p; @@ -575,8 +567,7 @@ namespace __detail const unsigned long* const __last = (_Primes<>::__primes + _Primes<>::__n_primes); const unsigned long* __p = std::lower_bound(_Primes<>::__primes, - __last, __min_bkts, - _LessThan()); + __last, __min_bkts); _M_next_resize = static_cast(std::ceil(*__p * _M_max_load_factor)); return std::make_pair(true, *__p); -- cgit v1.1