Lines Matching refs:__p
200 _Node_iterator_base(_Hash_node<_Value, __cache>* __p)
201 : _M_cur(__p) { }
242 _Node_iterator(_Hash_node<_Value, __cache>* __p)
243 : _Node_iterator_base<_Value, __cache>(__p) { }
283 _Node_const_iterator(_Hash_node<_Value, __cache>* __p)
284 : _Node_iterator_base<_Value, __cache>(__p) { }
382 _Hashtable_iterator(_Hash_node<_Value, __cache>* __p,
384 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
427 _Hashtable_const_iterator(_Hash_node<_Value, __cache>* __p,
429 : _Hashtable_iterator_base<_Value, __cache>(__p, __b) { }
536 const unsigned long* __p = std::lower_bound(_Primes<>::__primes, __last,
538 _M_next_resize = static_cast<std::size_t>(std::ceil(*__p
540 return *__p;
552 const unsigned long* __p = std::lower_bound(_Primes<>::__primes, __last,
554 _M_next_resize = static_cast<std::size_t>(std::ceil(*__p
556 return *__p;
582 const unsigned long* __p = std::lower_bound(_Primes<>::__primes,
586 static_cast<std::size_t>(std::ceil(*__p * _M_max_load_factor));
587 return std::make_pair(true, *__p);
645 typename _Hashtable::_Node* __p =
647 if (!__p)
650 return (__p->_M_v).second;
719 _M_bucket_index(const _Hash_node<_Value, false>* __p,
721 { return _M_ranged_hash(_M_extract(__p->_M_v), __n); }
798 _M_bucket_index(const _Hash_node<_Value, false>* __p,
800 { return _M_h2(_M_h1(_M_extract(__p->_M_v)), __n); }
865 _M_bucket_index(const _Hash_node<_Value, true>* __p,
867 { return _M_h2(__p->_M_hash_code, __n); }