Lines Matching refs:_Node
113 typedef _Hashtable_node<_Val> _Node;
121 _Node* _M_cur;
124 _Hashtable_iterator(_Node* __n, _Hashtable* __tab)
165 typedef _Hashtable_node<_Val> _Node;
174 const _Node* _M_cur;
177 _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab)
275 typedef _Hashtable_node<_Val> _Node;
284 typedef typename _Alloc::template rebind<_Node>::other _Node_Alloc;
285 typedef typename _Alloc::template rebind<_Node*>::other _Nodeptr_Alloc;
286 typedef vector<_Node*, _Nodeptr_Alloc> _Vector_type;
290 _Node*
295 _M_put_node(_Node* __p)
425 for (_Node* __n = _M_buckets[__bucket]; __n; __n = __n->_M_next)
507 _Node* __first;
519 const _Node* __first;
533 for (const _Node* __cur = _M_buckets[__n]; __cur;
577 _M_buckets.insert(_M_buckets.end(), __n_buckets, (_Node*) 0);
597 _Node*
600 _Node* __n = _M_get_node();
615 _M_delete_node(_Node* __n)
622 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last);
625 _M_erase_bucket(const size_type __n, _Node* __last);
637 const _Node* __old = _M_cur;
665 const _Node* __old = _M_cur;
692 typedef typename hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>::_Node _Node;
699 _Node* __cur1 = __ht1._M_buckets[__n];
700 _Node* __cur2 = __ht2._M_buckets[__n];
747 _Node* __first = _M_buckets[__n];
749 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
753 _Node* __tmp = _M_new_node(__obj);
766 _Node* __first = _M_buckets[__n];
768 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
771 _Node* __tmp = _M_new_node(__obj);
778 _Node* __tmp = _M_new_node(__obj);
793 _Node* __first = _M_buckets[__n];
795 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
799 _Node* __tmp = _M_new_node(__obj);
815 for (_Node* __first = _M_buckets[__n]; __first;
819 for (_Node* __cur = __first->_M_next; __cur;
841 for (const _Node* __first = _M_buckets[__n]; __first;
846 for (const _Node* __cur = __first->_M_next; __cur;
867 _Node* __first = _M_buckets[__n];
868 _Node* __saved_slot = 0;
873 _Node* __cur = __first;
874 _Node* __next = __cur->_M_next;
923 _Node* __p = __it._M_cur;
927 _Node* __cur = _M_buckets[__n];
937 _Node* __next = __cur->_M_next;
987 erase(iterator(const_cast<_Node*>(__first._M_cur),
989 iterator(const_cast<_Node*>(__last._M_cur),
997 { erase(iterator(const_cast<_Node*>(__it._M_cur),
1011 _Vector_type __tmp(__n, (_Node*)(0), _M_buckets.get_allocator());
1016 _Node* __first = _M_buckets[__bucket];
1036 _Node* __next = __tmp[__bucket]->_M_next;
1050 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last)
1052 _Node* __cur = _M_buckets[__n];
1057 _Node* __next;
1075 _M_erase_bucket(const size_type __n, _Node* __last)
1077 _Node* __cur = _M_buckets[__n];
1080 _Node* __next = __cur->_M_next;
1098 _Node* __cur = _M_buckets[__i];
1101 _Node* __next = __cur->_M_next;
1117 _M_buckets.insert(_M_buckets.end(), __ht._M_buckets.size(), (_Node*) 0);
1121 const _Node* __cur = __ht._M_buckets[__i];
1124 _Node* __local_copy = _M_new_node(__cur->_M_val);
1127 for (_Node* __next = __cur->_M_next;
