Lines Matching refs:_Node
115 typedef _Hashtable_node<_Val> _Node;
123 _Node* _M_cur;
126 _Hashtable_iterator(_Node* __n, _Hashtable* __tab)
167 typedef _Hashtable_node<_Val> _Node;
176 const _Node* _M_cur;
179 _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab)
293 typedef _Hashtable_node<_Val> _Node;
302 typedef typename _Alloc::template rebind<_Node>::other _Node_Alloc;
303 typedef typename _Alloc::template rebind<_Node*>::other _Nodeptr_Alloc;
304 typedef vector<_Node*, _Nodeptr_Alloc> _Vector_type;
308 _Node*
313 _M_put_node(_Node* __p)
445 for (_Node* __n = _M_buckets[__bucket]; __n; __n = __n->_M_next)
527 _Node* __first;
539 const _Node* __first;
553 for (const _Node* __cur = _M_buckets[__n]; __cur;
597 _M_buckets.insert(_M_buckets.end(), __n_buckets, (_Node*) 0);
617 _Node*
620 _Node* __n = _M_get_node();
635 _M_delete_node(_Node* __n)
642 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last);
645 _M_erase_bucket(const size_type __n, _Node* __last);
657 const _Node* __old = _M_cur;
685 const _Node* __old = _M_cur;
712 typedef typename hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>::_Node _Node;
719 _Node* __cur1 = __ht1._M_buckets[__n];
720 _Node* __cur2 = __ht2._M_buckets[__n];
767 _Node* __first = _M_buckets[__n];
769 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
773 _Node* __tmp = _M_new_node(__obj);
786 _Node* __first = _M_buckets[__n];
788 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
791 _Node* __tmp = _M_new_node(__obj);
798 _Node* __tmp = _M_new_node(__obj);
813 _Node* __first = _M_buckets[__n];
815 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
819 _Node* __tmp = _M_new_node(__obj);
835 for (_Node* __first = _M_buckets[__n]; __first;
839 for (_Node* __cur = __first->_M_next; __cur;
861 for (const _Node* __first = _M_buckets[__n]; __first;
866 for (const _Node* __cur = __first->_M_next; __cur;
887 _Node* __first = _M_buckets[__n];
888 _Node* __saved_slot = 0;
893 _Node* __cur = __first;
894 _Node* __next = __cur->_M_next;
943 _Node* __p = __it._M_cur;
947 _Node* __cur = _M_buckets[__n];
957 _Node* __next = __cur->_M_next;
1007 erase(iterator(const_cast<_Node*>(__first._M_cur),
1009 iterator(const_cast<_Node*>(__last._M_cur),
1017 { erase(iterator(const_cast<_Node*>(__it._M_cur),
1031 _Vector_type __tmp(__n, (_Node*)(0), _M_buckets.get_allocator());
1036 _Node* __first = _M_buckets[__bucket];
1056 _Node* __next = __tmp[__bucket]->_M_next;
1070 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last)
1072 _Node* __cur = _M_buckets[__n];
1077 _Node* __next;
1095 _M_erase_bucket(const size_type __n, _Node* __last)
1097 _Node* __cur = _M_buckets[__n];
1100 _Node* __next = __cur->_M_next;
1118 _Node* __cur = _M_buckets[__i];
1121 _Node* __next = __cur->_M_next;
1137 _M_buckets.insert(_M_buckets.end(), __ht._M_buckets.size(), (_Node*) 0);
1141 const _Node* __cur = __ht._M_buckets[__i];
1144 _Node* __local_copy = _M_new_node(__cur->_M_val);
1147 for (_Node* __next = __cur->_M_next;
