79   typedef _Hashtable_node<_Val> _Node;  typedef
88   _Node* _M_cur;
91   _Hashtable_iterator(_Node* __n, _Hashtable* __tab)   in _Hashtable_iterator()
118   typedef _Hashtable_node<_Val> _Node;  typedef
127   const _Node* _M_cur;
130   _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab)  in _Hashtable_const_iterator()
205   typedef _Hashtable_node<_Val> _Node;  typedef
212   typename _Alloc_traits<_Node, _Alloc>::allocator_type _M_node_allocator;
213   _Node* _M_get_node() { return _M_node_allocator.allocate(1); }  in _M_get_node()
214   void _M_put_node(_Node* __p) { _M_node_allocator.deallocate(__p, 1); }  in _M_put_node()
221   typedef simple_alloc<_Node, _Alloc> _M_node_allocator_type;
222   _Node* _M_get_node() { return _M_node_allocator_type::allocate(1); }  in _M_get_node()
223   void _M_put_node(_Node* __p) { _M_node_allocator_type::deallocate(__p, 1); }  in _M_put_node()
231   vector<_Node*,_Alloc> _M_buckets;
349     for (_Node* __cur = _M_buckets[__bucket]; __cur; __cur = __cur->_M_next)
461     _Node* __first;
472     const _Node* __first;
485     for (const _Node* __cur = _M_buckets[__n]; __cur; __cur = __cur->_M_next)
515     _M_buckets.insert(_M_buckets.end(), __n_buckets, (_Node*) 0);
539   _Node* _M_new_node(const value_type& __obj)
541     _Node* __n = _M_get_node();
550   void _M_delete_node(_Node* __n)
556   void _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last);
557   void _M_erase_bucket(const size_type __n, _Node* __last);
568   const _Node* __old = _M_cur;
593   const _Node* __old = _M_cur;
670   typedef typename hashtable<_Val,_Key,_HF,_Ex,_Eq,_All>::_Node _Node;
674     _Node* __cur1 = __ht1._M_buckets[__n];
675     _Node* __cur2 = __ht2._M_buckets[__n];
703   _Node* __first = _M_buckets[__n];
705   for (_Node* __cur = __first; __cur; __cur = __cur->_M_next) 
709   _Node* __tmp = _M_new_node(__obj);
722   _Node* __first = _M_buckets[__n];
724   for (_Node* __cur = __first; __cur; __cur = __cur->_M_next) 
726       _Node* __tmp = _M_new_node(__obj);
733   _Node* __tmp = _M_new_node(__obj);
747   _Node* __first = _M_buckets[__n];
749   for (_Node* __cur = __first; __cur; __cur = __cur->_M_next)
753   _Node* __tmp = _M_new_node(__obj);
768   for (_Node* __first = _M_buckets[__n]; __first; __first = __first->_M_next)
770       for (_Node* __cur = __first->_M_next; __cur; __cur = __cur->_M_next)
791   for (const _Node* __first = _M_buckets[__n] ;
795       for (const _Node* __cur = __first->_M_next;
816   _Node* __first = _M_buckets[__n];
820     _Node* __cur = __first;
821     _Node* __next = __cur->_M_next;
848   if (_Node* const __p = __it._M_cur) {
850     _Node* __cur = _M_buckets[__n];
858       _Node* __next = __cur->_M_next;
902   erase(iterator(const_cast<_Node*>(__first._M_cur),
904         iterator(const_cast<_Node*>(__last._M_cur),
912   erase(iterator(const_cast<_Node*>(__it._M_cur),
924       vector<_Node*, _All> __tmp(__n, (_Node*)(0),
928           _Node* __first = _M_buckets[__bucket];
943             _Node* __next = __tmp[__bucket]->_M_next;
957   ::_M_erase_bucket(const size_type __n, _Node* __first, _Node* __last)
959   _Node* __cur = _M_buckets[__n];
963     _Node* __next;
979   ::_M_erase_bucket(const size_type __n, _Node* __last)
981   _Node* __cur = _M_buckets[__n];
983     _Node* __next = __cur->_M_next;
995     _Node* __cur = _M_buckets[__i];
997       _Node* __next = __cur->_M_next;
1013   _M_buckets.insert(_M_buckets.end(), __ht._M_buckets.size(), (_Node*) 0);
1016       if (const _Node* __cur = __ht._M_buckets[__i]) {
1017         _Node* ___copy = _M_new_node(__cur->_M_val);
1020         for (_Node* __next = __cur->_M_next;