Searched refs:_M_node (Results 1 – 8 of 8) sorted by relevance
124 : _M_node() { } in _List_iterator()128 : _M_node(__x) { } in _List_iterator()133 { return static_cast<_Node*>(_M_node)->_M_data; }137 { return &static_cast<_Node*>(_M_node)->_M_data; }142 _M_node = _M_node->_M_next;150 _M_node = _M_node->_M_next;157 _M_node = _M_node->_M_prev;165 _M_node = _M_node->_M_prev;171 { return _M_node == __x._M_node; }175 { return _M_node != __x._M_node; }[all …]
194 _M_destroy_nodes(__new_start._M_node, in _M_fill_insert()195 this->_M_impl._M_start._M_node); in _M_fill_insert()211 _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1, in _M_fill_insert()212 __new_finish._M_node + 1); in _M_fill_insert()228 for (__cur = this->_M_impl._M_start._M_node; in _M_fill_initialize()229 __cur < this->_M_impl._M_finish._M_node; in _M_fill_initialize()278 for (__cur_node = this->_M_impl._M_start._M_node; in _M_range_initialize()279 __cur_node < this->_M_impl._M_finish._M_node; in _M_range_initialize()309 *(this->_M_impl._M_finish._M_node + 1) = this->_M_allocate_node(); in _M_push_back_aux()313 this->_M_impl._M_finish._M_set_node(this->_M_impl._M_finish._M_node in _M_push_back_aux()[all …]
168 : _M_node() { } in _Rb_tree_iterator()172 : _M_node(__x) { } in _Rb_tree_iterator()176 { return static_cast<_Link_type>(_M_node)->_M_value_field; }180 { return &static_cast<_Link_type>(_M_node)->_M_value_field; }185 _M_node = _Rb_tree_increment(_M_node);193 _M_node = _Rb_tree_increment(_M_node);200 _M_node = _Rb_tree_decrement(_M_node);208 _M_node = _Rb_tree_decrement(_M_node);214 { return _M_node == __x._M_node; }218 { return _M_node != __x._M_node; }[all …]
73 _Node* __cur = static_cast<_Node*>(this->_M_impl._M_node._M_next); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()74 while (__cur != &this->_M_impl._M_node) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()89 __tmp->hook(__position._M_node); in insert()98 iterator __ret = iterator(__position._M_node->_M_next); in erase()274 if (this->_M_impl._M_node._M_next != &this->_M_impl._M_node in sort()275 && this->_M_impl._M_node._M_next->_M_next != &this->_M_impl._M_node) in sort()351 if (this->_M_impl._M_node._M_next != &this->_M_impl._M_node in sort()352 && this->_M_impl._M_node._M_next->_M_next != &this->_M_impl._M_node) in sort()
122 _Map_pointer _M_node; member126 _M_last(*__y + _S_buffer_size()), _M_node(__y) {} in _Deque_iterator()128 _Deque_iterator() : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) {} in _Deque_iterator()132 _M_last(__x._M_last), _M_node(__x._M_node) {} in _Deque_iterator()148 _M_set_node(_M_node + 1);167 _M_set_node(_M_node - 1);194 _M_set_node(_M_node + __node_offset);232 _M_node = __new_node; in _M_set_node()271 { return (__x._M_node == __y._M_node) ? (__x._M_cur < __y._M_cur)272 : (__x._M_node < __y._M_node); }[all …]
165 _Slist_node_base* _M_node;168 : _M_node(__x) {}172 { _M_node = _M_node->_M_next; }176 { return _M_node == __x._M_node; }180 { return _M_node != __x._M_node; }203 : _Slist_iterator_base(__x._M_node) {}207 { return ((_Node*) _M_node)->_M_data; }502 __pos._M_node)); }507 __pos._M_node)); }558 { return iterator(_M_insert_after(__pos._M_node, __x)); }[all …]
4203 from this->_M_node to this->_M_impl._M_node * bits/list.tcc: Same
5166 * include/bits/stl_list.h (_List_iterator): Initialize _M_node