Lines Matching refs:__hash

88     size_t __hash() const _NOEXCEPT {
562         if (__node_ != nullptr && __constrain_hash(__node_->__hash(), __bucket_count_) != __bucket_)
695         if (__node_ != nullptr && __constrain_hash(__node_->__hash(), __bucket_count_) != __bucket_)
1303     __node_holder __construct_node_hash(size_t __hash, _First&& __f, _Rest&&... __rest);
1431         __bucket_list_[__constrain_hash(__p1_.first().__next_->__hash(), bucket_count())] =
1455             __bucket_list_[__constrain_hash(__p1_.first().__next_->__hash(), bucket_count())] =
1572         __bucket_list_[__constrain_hash(__p1_.first().__next_->__hash(), bucket_count())] =
1771 // __hash. This does a lookup into the container to see if __value is already
1781     size_t __hash, value_type& __value)
1787         size_t __chash = __constrain_hash(__hash, __bc);
1792                                              __constrain_hash(__ndptr->__hash(), __bc) == __chash;
1809 // and updating size(). Assumes that __nd->__hash is up-to-date, and that
1819     size_t __chash = __constrain_hash(__nd->__hash(), __bc);
1830             __bucket_list_[__constrain_hash(__nd->__next_->__hash(), __bc)] = __nd->__ptr();
1846         __node_insert_unique_prepare(__nd->__hash(), __nd->__value_);
1883                                    __constrain_hash(__pn->__next_->__hash(), __bc) == __chash;
1891             if (__found != (__pn->__next_->__hash() == __cp_hash &&
1907 // all we need to do is update the bucket and size(). Assumes that __cp->__hash
1924             __bucket_list_[__constrain_hash(__cp->__next_->__hash(), __bc)]
1933             size_t __nhash = __constrain_hash(__cp->__next_->__hash(), __bc);
1947     __next_pointer __pn = __node_insert_multi_prepare(__cp->__hash(), __cp->__value_);
1964         __cp->__hash_ = __np->__hash();
1992     size_t __hash = hash_function()(__k);
1999         __chash = __constrain_hash(__hash, __bc);
2004                 (__nd->__hash() == __hash || __constrain_hash(__nd->__hash(), __bc) == __chash);
2013         __node_holder __h = __construct_node_hash(__hash, _VSTD::forward<_Args>(__args)...);
2019             __chash = __constrain_hash(__hash, __bc);
2031                 __bucket_list_[__constrain_hash(__h->__next_->__hash(), __bc)]
2154         size_t __hash = hash_function()(__src_ptr->__value_);
2156             __node_insert_unique_prepare(__hash, __src_ptr->__value_);
2161             __src_ptr->__hash_ = __hash;
2262             size_type __chash = __constrain_hash(__cp->__hash(), __nbc);
2268                 __chash = __constrain_hash(__cp->__hash(), __nbc);
2306     size_t __hash = hash_function()(__k);
2310         size_t __chash = __constrain_hash(__hash, __bc);
2315                 (__nd->__hash() == __hash
2316                   || __constrain_hash(__nd->__hash(), __bc) == __chash);
2319                 if ((__nd->__hash() == __hash)
2333     size_t __hash = hash_function()(__k);
2337         size_t __chash = __constrain_hash(__hash, __bc);
2342                 (__hash == __nd->__hash()
2343                     || __constrain_hash(__nd->__hash(), __bc) == __chash);
2346                 if ((__nd->__hash() == __hash)
2376     size_t __hash, _First&& __f, _Rest&& ...__rest)
2386     __h->__hash_ = __hash;
2465     size_t __chash = __constrain_hash(__cn->__hash(), __bc);
2474             || __constrain_hash(__pn->__hash(), __bc) != __chash)
2477             || __constrain_hash(__cn->__next_->__hash(), __bc) != __chash)
2483         size_t __nhash = __constrain_hash(__cn->__next_->__hash(), __bc);
2637         __bucket_list_[__constrain_hash(__p1_.first().__next_->__hash(), bucket_count())] =
2640 …    __u.__bucket_list_[__constrain_hash(__u.__p1_.first().__next_->__hash(), __u.bucket_count())] =
2657                                    __constrain_hash(__np->__hash(), __bc) == __n;