Home | History | Annotate | Download | only in bits

Lines Matching refs:__node_type

219       using __node_type = typename __hashtable_base::__node_type;
316 typedef typename _Alloc::template rebind<__node_type>::other
346 __node_type*
350 _M_deallocate_node(__node_type* __n);
354 _M_deallocate_nodes(__node_type* __n);
364 __node_type*
367 __node_type*
369 { return static_cast<__node_type*>(_M_before_begin()._M_nxt); }
588 _M_bucket_index(__node_type* __n) const
600 __node_type*
606 return static_cast<__node_type*>(__before_n->_M_nxt);
612 _M_insert_bucket_begin(size_type, __node_type*);
616 _M_remove_bucket_begin(size_type __bkt, __node_type* __next_n,
628 __node_type* __n);
633 _M_insert_multi_node(__hash_code __code, __node_type* __n);
658 _M_erase(size_type __bkt, __node_base* __prev_n, __node_type* __n);
719 _H1, _H2, _Hash, _RehashPolicy, _Traits>::__node_type*
724 __node_type* __n = _M_node_allocator().allocate(1);
744 _M_deallocate_node(__node_type* __n)
757 _M_deallocate_nodes(__node_type* __n)
761 __node_type* __tmp = __n;
803 _Traits>::__node_type*
809 return __n ? static_cast<__node_type*>(__n->_M_nxt) : nullptr;
897 const __node_type* __ht_n = __ht._M_begin();
898 __node_type* __this_n = _M_allocate_node(__ht_n->_M_v);
1025 __node_type* __p = _M_find_node(__n, __k, __code);
1042 __node_type* __p = _M_find_node(__n, __k, __code);
1059 __node_type* __p = _M_bucket_begin(__n);
1097 __node_type* __p = _M_find_node(__n, __k, __code);
1101 __node_type* __p1 = __p->_M_next();
1130 __node_type* __p = _M_find_node(__n, __k, __code);
1134 __node_type* __p1 = __p->_M_next();
1162 __node_type* __p = static_cast<__node_type*>(__prev_p->_M_nxt);
1181 _M_insert_bucket_begin(size_type __bkt, __node_type* __node)
1212 _M_remove_bucket_begin(size_type __bkt, __node_type* __next,
1260 __node_type* __node = _M_allocate_node(std::forward<_Args>(__args)...);
1274 if (__node_type* __p = _M_find_node(__bkt, __k, __code))
1299 __node_type* __node = _M_allocate_node(std::forward<_Args>(__args)...);
1325 __node_type* __node)
1364 _M_insert_multi_node(__hash_code __code, __node_type* __node)
1421 __node_type* __n = _M_find_node(__bkt, __k, __code);
1447 __node_type* __node = _M_allocate_node(std::forward<_Arg>(__v));
1463 __node_type* __n = __it._M_cur;
1482 _M_erase(size_type __bkt, __node_base* __prev_n, __node_type* __n)
1522 __node_type* __n = static_cast<__node_type*>(__prev_n->_M_nxt);
1552 __node_type* __n = static_cast<__node_type*>(__prev_n->_M_nxt);
1553 __node_type* __n_last = __n;
1568 __node_type* __p = __n->_M_next();
1595 __node_type* __n = __first._M_cur;
1596 __node_type* __last_n = __last._M_cur;
1609 __node_type* __tmp = __n;
1702 __node_type* __p = _M_begin();
1707 __node_type* __next = __p->_M_next();
1743 __node_type* __p = _M_begin();
1747 __node_type* __prev_p = nullptr;
1752 __node_type* __next = __p->_M_next();