headers/cpp/stl_hashtable.h

88   _Node* _M_cur;  member
92     : _M_cur(__n), _M_ht(__tab) {}  in _Hashtable_iterator()
94   reference operator*() const { return _M_cur->_M_val; }
101     { return _M_cur == __it._M_cur; }
103     { return _M_cur != __it._M_cur; }
127   const _Node* _M_cur;  member
131     : _M_cur(__n), _M_ht(__tab) {}  in _Hashtable_const_iterator()
134     : _M_cur(__it._M_cur), _M_ht(__it._M_ht) {}  in _Hashtable_const_iterator()
135   reference operator*() const { return _M_cur->_M_val; }
142     { return _M_cur == __it._M_cur; }
144     { return _M_cur != __it._M_cur; }
568   const _Node* __old = _M_cur;
569   _M_cur = _M_cur->_M_next;
570   if (!_M_cur) {
572     while (!_M_cur && ++__bucket < _M_ht->_M_buckets.size())
573       _M_cur = _M_ht->_M_buckets[__bucket];
593   const _Node* __old = _M_cur;
594   _M_cur = _M_cur->_M_next;
595   if (!_M_cur) {
597     while (!_M_cur && ++__bucket < _M_ht->_M_buckets.size())
598       _M_cur = _M_ht->_M_buckets[__bucket];
848   if (_Node* const __p = __it._M_cur) {
879   size_type __f_bucket = __first._M_cur ?
880     _M_bkt_num(__first._M_cur->_M_val) : _M_buckets.size();
881   size_type __l_bucket = __last._M_cur ?
882     _M_bkt_num(__last._M_cur->_M_val) : _M_buckets.size();
884   if (__first._M_cur == __last._M_cur)
887     _M_erase_bucket(__f_bucket, __first._M_cur, __last._M_cur);
889     _M_erase_bucket(__f_bucket, __first._M_cur, 0);
893       _M_erase_bucket(__l_bucket, __last._M_cur);
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),