2011-07-24 Paolo Carlini <paolo.carlini@oracle.com>
* include/bits/hashtable_policy.h (_Prime_rehash_policy::_M_next_bkt,
_M_bkt_for_elements, _M_need_rehash): Fix typos in the last commit.
From-SVN: r176718
+2011-07-24 Paolo Carlini <paolo.carlini@oracle.com>
+
+ * include/bits/hashtable_policy.h (_Prime_rehash_policy::_M_next_bkt,
+ _M_bkt_for_elements, _M_need_rehash): Fix typos in the last commit.
+
2011-07-24 François Dumont <francois.cppdevs@free.fr>
* include/bits/hashtable_policy.h (_Prime_rehash_policy): Use
+ _S_n_primes, __n);
_M_next_resize =
static_cast<std::size_t>(__builtin_floor(__p * _M_max_load_factor));
- return *__p;
+ return __p;
}
// Return the smallest prime p such that alpha p >= n, where alpha
+ _S_n_primes, __min_bkts);
_M_next_resize =
static_cast<std::size_t>(__builtin_floor(__p * _M_max_load_factor));
- return *__p;
+ return __p;
}
// Finds the smallest prime p such that alpha p > __n_elt + __n_ins.
__min_bkts);
_M_next_resize = static_cast<std::size_t>
(__builtin_floor(__p * _M_max_load_factor));
- return std::make_pair(true, *__p);
+ return std::make_pair(true, __p);
}
else
{