Lines Matching refs:__h
137 inline _LIBCPP_HIDE_FROM_ABI size_t __constrain_hash(size_t __h, size_t __bc) {
138 return !(__bc & (__bc - 1)) ? __h & (__bc - 1) : (__h < __bc ? __h : __h % __bc);
1209 __node_holder __h = __construct_node(_NodeTypes::__move(__u.remove(__i++)->__get_value()));
1210 __node_insert_multi(__h.get());
1211 __h.release();
1523 __node_holder __h = __construct_node_hash(__hash, std::forward<_Args>(__args)...);
1534 __h->__next_ = __pn->__next_;
1535 __pn->__next_ = __h.get()->__ptr();
1538 if (__h->__next_ != nullptr)
1539 __bucket_list_[std::__constrain_hash(__h->__next_->__hash(), __bc)] = __h.get()->__ptr();
1541 __h->__next_ = __pn->__next_;
1542 __pn->__next_ = static_cast<__next_pointer>(__h.get());
1544 __nd = static_cast<__next_pointer>(__h.release());
1557 __node_holder __h = __construct_node(std::forward<_Args>(__args)...);
1558 pair<iterator, bool> __r = __node_insert_unique(__h.get());
1560 __h.release();
1568 __node_holder __h = __construct_node(std::forward<_Args>(__args)...);
1569 iterator __r = __node_insert_multi(__h.get());
1570 __h.release();
1578 __node_holder __h = __construct_node(std::forward<_Args>(__args)...);
1579 iterator __r = __node_insert_multi(__p, __h.get());
1580 __h.release();
1792 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
1800 std::__construct_at(std::addressof(*__h), /* next = */ nullptr, /* hash = */ 0);
1803 …__node_traits::construct(__na, _NodeTypes::__get_ptr(__h->__get_value()), std::forward<_Args>(__ar…
1804 __h.get_deleter().__value_constructed = true;
1806 __h->__hash_ = hash_function()(__h->__get_value());
1807 return __h;
1816 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
1817 std::__construct_at(std::addressof(*__h), /* next = */ nullptr, /* hash = */ __hash);
1819 …__na, _NodeTypes::__get_ptr(__h->__get_value()), std::forward<_First>(__f), std::forward<_Rest>(__…
1820 __h.get_deleter().__value_constructed = true;
1821 return __h;