Home | History | Annotate | Download | only in backward

Lines Matching refs:_M_cur

121       _Node* _M_cur;
125 : _M_cur(__n), _M_ht(__tab) { }
128 : _M_cur(0), _M_ht(0) { }
132 { return _M_cur->_M_val; }
146 { return _M_cur == __it._M_cur; }
150 { return _M_cur != __it._M_cur; }
174 const _Node* _M_cur;
178 : _M_cur(__n), _M_ht(__tab) { }
183 : _M_cur(__it._M_cur), _M_ht(__it._M_ht) { }
187 { return _M_cur->_M_val; }
201 { return _M_cur == __it._M_cur; }
205 { return _M_cur != __it._M_cur; }
637 const _Node* __old = _M_cur;
638 _M_cur = _M_cur->_M_next;
639 if (!_M_cur)
642 while (!_M_cur && ++__bucket < _M_ht->_M_buckets.size())
643 _M_cur = _M_ht->_M_buckets[__bucket];
665 const _Node* __old = _M_cur;
666 _M_cur = _M_cur->_M_next;
667 if (!_M_cur)
670 while (!_M_cur && ++__bucket < _M_ht->_M_buckets.size())
671 _M_cur = _M_ht->_M_buckets[__bucket];
923 _Node* __p = __it._M_cur;
962 size_type __f_bucket = __first._M_cur ? _M_bkt_num(__first._M_cur->_M_val)
965 size_type __l_bucket = __last._M_cur ? _M_bkt_num(__last._M_cur->_M_val)
968 if (__first._M_cur == __last._M_cur)
971 _M_erase_bucket(__f_bucket, __first._M_cur, __last._M_cur);
974 _M_erase_bucket(__f_bucket, __first._M_cur, 0);
978 _M_erase_bucket(__l_bucket, __last._M_cur);
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),