Home | History | Annotate | Download | only in tr1

Lines Matching defs:__k

284       bucket(const key_type& __k) const
286 return this->_M_bucket_index(__k, this->_M_hash_code(__k),
325 find(const key_type& __k);
328 find(const key_type& __k) const;
331 count(const key_type& __k) const;
334 equal_range(const key_type& __k);
337 equal_range(const key_type& __k) const;
694 find(const key_type& __k)
696 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k);
697 std::size_t __n = this->_M_bucket_index(__k, __code, _M_bucket_count);
698 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code);
711 find(const key_type& __k) const
713 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k);
714 std::size_t __n = this->_M_bucket_index(__k, __code, _M_bucket_count);
715 _Node* __p = _M_find_node(_M_buckets[__n], __k, __code);
728 count(const key_type& __k) const
730 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k);
731 std::size_t __n = this->_M_bucket_index(__k, __code, _M_bucket_count);
734 if (this->_M_compare(__k, __code, __p))
753 equal_range(const key_type& __k)
755 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k);
756 std::size_t __n = this->_M_bucket_index(__k, __code, _M_bucket_count);
758 _Node* __p = _M_find_node(*__head, __k, __code);
764 if (!this->_M_compare(__k, __code, __p1))
791 equal_range(const key_type& __k) const
793 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k);
794 std::size_t __n = this->_M_bucket_index(__k, __code, _M_bucket_count);
796 _Node* __p = _M_find_node(*__head, __k, __code);
802 if (!this->_M_compare(__k, __code, __p1))
826 _M_find_node(_Node* __p, const key_type& __k,
830 if (this->_M_compare(__k, __code, __p))
860 const key_type& __k = this->_M_extract(__v);
861 __n = this->_M_bucket_index(__k, __code, __do_rehash.second);
891 const key_type& __k = this->_M_extract(__v);
892 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k);
893 size_type __n = this->_M_bucket_index(__k, __code, _M_bucket_count);
895 if (_Node* __p = _M_find_node(_M_buckets[__n], __k, __code))
918 const key_type& __k = this->_M_extract(__v);
919 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k);
920 size_type __n = this->_M_bucket_index(__k, __code, _M_bucket_count);
923 _Node* __prev = _M_find_node(_M_buckets[__n], __k, __code);
1034 erase(const key_type& __k)
1036 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k);
1037 std::size_t __n = this->_M_bucket_index(__k, __code, _M_bucket_count);
1041 while (*__slot && !this->_M_compare(__k, __code, *__slot))
1045 while (*__slot && this->_M_compare(__k, __code, *__slot))
1050 if (&this->_M_extract((*__slot)->_M_v) != &__k)