Lines Matching defs:_Node
118 typedef _Hashtable_node<_Val> _Node;
126 _Node* _M_cur;
129 _Hashtable_iterator(_Node* __n, _Hashtable* __tab)
169 typedef _Hashtable_node<_Val> _Node;
178 const _Node* _M_cur;
181 _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab)
280 typedef _Hashtable_node<_Val> _Node;
289 typedef typename _Alloc::template rebind<_Node>::other _Node_Alloc;
290 typedef typename _Alloc::template rebind<_Node*>::other _Nodeptr_Alloc;
291 typedef vector<_Node*, _Nodeptr_Alloc> _Vector_type;
295 _Node*
300 _M_put_node(_Node* __p)
430 for (_Node* __n = _M_buckets[__bucket]; __n; __n = __n->_M_next)
512 _Node* __first;
524 const _Node* __first;
538 for (const _Node* __cur = _M_buckets[__n]; __cur;
582 _M_buckets.insert(_M_buckets.end(), __n_buckets, (_Node*) 0);
602 _Node*
605 _Node* __n = _M_get_node();
620 _M_delete_node(_Node* __n)
627 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last);
630 _M_erase_bucket(const size_type __n, _Node* __last);
642 const _Node* __old = _M_cur;
670 const _Node* __old = _M_cur;
697 typedef typename hashtable<_Val, _Key, _HF, _Ex, _Eq, _All>::_Node _Node;
704 _Node* __cur1 = __ht1._M_buckets[__n];
705 _Node* __cur2 = __ht2._M_buckets[__n];
752 _Node* __first = _M_buckets[__n];
754 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
758 _Node* __tmp = _M_new_node(__obj);
771 _Node* __first = _M_buckets[__n];
773 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
776 _Node* __tmp = _M_new_node(__obj);
783 _Node* __tmp = _M_new_node(__obj);
798 _Node* __first = _M_buckets[__n];
800 for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
804 _Node* __tmp = _M_new_node(__obj);
820 for (_Node* __first = _M_buckets[__n]; __first;
824 for (_Node* __cur = __first->_M_next; __cur;
846 for (const _Node* __first = _M_buckets[__n]; __first;
851 for (const _Node* __cur = __first->_M_next; __cur;
872 _Node* __first = _M_buckets[__n];
877 _Node* __cur = __first;
878 _Node* __next = __cur->_M_next;
910 _Node* __p = __it._M_cur;
914 _Node* __cur = _M_buckets[__n];
924 _Node* __next = __cur->_M_next;
974 erase(iterator(const_cast<_Node*>(__first._M_cur),
976 iterator(const_cast<_Node*>(__last._M_cur),
984 { erase(iterator(const_cast<_Node*>(__it._M_cur),
998 _Vector_type __tmp(__n, (_Node*)(0), _M_buckets.get_allocator());
1003 _Node* __first = _M_buckets[__bucket];
1023 _Node* __next = __tmp[__bucket]->_M_next;
1037 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last)
1039 _Node* __cur = _M_buckets[__n];
1044 _Node* __next;
1062 _M_erase_bucket(const size_type __n, _Node* __last)
1064 _Node* __cur = _M_buckets[__n];
1067 _Node* __next = __cur->_M_next;
1086 _Node* __cur = _M_buckets[__i];
1089 _Node* __next = __cur->_M_next;
1105 _M_buckets.insert(_M_buckets.end(), __ht._M_buckets.size(), (_Node*) 0);
1109 const _Node* __cur = __ht._M_buckets[__i];
1112 _Node* __local_copy = _M_new_node(__cur->_M_val);
1115 for (_Node* __next = __cur->_M_next;