Home | History | Annotate | Download | only in bits

Lines Matching defs:__h

486       __hashtable* __h = static_cast<__hashtable*>(this);
487 __hash_code __code = __h->_M_hash_code(__k);
488 std::size_t __n = __h->_M_bucket_index(__k, __code);
489 __node_type* __p = __h->_M_find_node(__n, __k, __code);
493 __p = __h->_M_allocate_node(std::piecewise_construct,
496 return __h->_M_insert_unique_node(__n, __code, __p)->second;
512 __hashtable* __h = static_cast<__hashtable*>(this);
513 __hash_code __code = __h->_M_hash_code(__k);
514 std::size_t __n = __h->_M_bucket_index(__k, __code);
515 __node_type* __p = __h->_M_find_node(__n, __k, __code);
519 __p = __h->_M_allocate_node(std::piecewise_construct,
522 return __h->_M_insert_unique_node(__n, __code, __p)->second;
538 __hashtable* __h = static_cast<__hashtable*>(this);
539 __hash_code __code = __h->_M_hash_code(__k);
540 std::size_t __n = __h->_M_bucket_index(__k, __code);
541 __node_type* __p = __h->_M_find_node(__n, __k, __code);
558 const __hashtable* __h = static_cast<const __hashtable*>(this);
559 __hash_code __code = __h->_M_hash_code(__k);
560 std::size_t __n = __h->_M_bucket_index(__k, __code);
561 __node_type* __p = __h->_M_find_node(__n, __k, __code);
603 __hashtable& __h = _M_conjure_hashtable();
604 return __h._M_insert(__v, __unique_keys());
636 __hashtable& __h = _M_conjure_hashtable();
637 __rehash_type& __rehash = __h._M_rehash_policy;
639 pair_type __do_rehash = __rehash._M_need_rehash(__h._M_bucket_count,
640 __h._M_element_count,
644 __h._M_rehash(__do_rehash.second, __saved_state);
647 __h._M_insert(*__first, __unique_keys());
688 __hashtable& __h = this->_M_conjure_hashtable();
689 return __h._M_insert(std::move(__v), __unique_keys());
722 __hashtable& __h = this->_M_conjure_hashtable();
723 return __h._M_insert(std::move(__v), __unique_keys());
768 __hashtable& __h = this->_M_conjure_hashtable();
769 return __h._M_emplace(__unique_keys(), std::forward<_Pair>(__v));
929 const _Hash& __h)
930 : __ebo_extract_key(__ex), __ebo_hash(__h) { }