Home | History | Annotate | Download | only in backward

Lines Matching refs:_M_cur

123       _Node* _M_cur;
127 : _M_cur(__n), _M_ht(__tab) { }
130 : _M_cur(0), _M_ht(0) { }
134 { return _M_cur->_M_val; }
148 { return _M_cur == __it._M_cur; }
152 { return _M_cur != __it._M_cur; }
176 const _Node* _M_cur;
180 : _M_cur(__n), _M_ht(__tab) { }
185 : _M_cur(__it._M_cur), _M_ht(__it._M_ht) { }
189 { return _M_cur->_M_val; }
203 { return _M_cur == __it._M_cur; }
207 { return _M_cur != __it._M_cur; }
657 const _Node* __old = _M_cur;
658 _M_cur = _M_cur->_M_next;
659 if (!_M_cur)
662 while (!_M_cur && ++__bucket < _M_ht->_M_buckets.size())
663 _M_cur = _M_ht->_M_buckets[__bucket];
685 const _Node* __old = _M_cur;
686 _M_cur = _M_cur->_M_next;
687 if (!_M_cur)
690 while (!_M_cur && ++__bucket < _M_ht->_M_buckets.size())
691 _M_cur = _M_ht->_M_buckets[__bucket];
943 _Node* __p = __it._M_cur;
982 size_type __f_bucket = __first._M_cur ? _M_bkt_num(__first._M_cur->_M_val)
985 size_type __l_bucket = __last._M_cur ? _M_bkt_num(__last._M_cur->_M_val)
988 if (__first._M_cur == __last._M_cur)
991 _M_erase_bucket(__f_bucket, __first._M_cur, __last._M_cur);
994 _M_erase_bucket(__f_bucket, __first._M_cur, 0);
998 _M_erase_bucket(__l_bucket, __last._M_cur);
1007 erase(iterator(const_cast<_Node*>(__first._M_cur),
1009 iterator(const_cast<_Node*>(__last._M_cur),
1017 { erase(iterator(const_cast<_Node*>(__it._M_cur),