Home
last modified time | relevance | path

Searched refs:_M_node (Results 1 – 8 of 8) sorted by relevance

/freebsd-12.1/contrib/libstdc++/include/bits/
H A Dstl_list.h142 _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; }
209 : _M_node(__x._M_node) { } in _List_const_iterator()
224 _M_node = _M_node->_M_next;
232 _M_node = _M_node->_M_next;
239 _M_node = _M_node->_M_prev;
[all …]
H A Ddeque.tcc212 __new_finish._M_node + 1); in _M_fill_insert()
403 _M_destroy_nodes(__new_start._M_node, in _M_range_insert_aux()
404 this->_M_impl._M_start._M_node); in _M_range_insert_aux()
421 __new_finish._M_node + 1); in _M_range_insert_aux()
541 __new_finish._M_node + 1); in _M_insert_aux()
589 _M_destroy_nodes(__new_start._M_node, in _M_insert_aux()
590 this->_M_impl._M_start._M_node); in _M_insert_aux()
630 __new_finish._M_node + 1); in _M_insert_aux()
646 if (__first._M_node != __last._M_node) in _M_destroy_data_aux()
714 = this->_M_impl._M_finish._M_node - this->_M_impl._M_start._M_node + 1; in _M_reallocate_map()
[all …]
H A Dstl_tree.h185 _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; }
247 : _M_node(__it._M_node) { } in _Rb_tree_const_iterator()
260 _M_node = _Rb_tree_increment(_M_node);
268 _M_node = _Rb_tree_increment(_M_node);
275 _M_node = _Rb_tree_decrement(_M_node);
[all …]
H A Dlist.tcc73 _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()
H A Dstl_deque.h122 _Map_pointer _M_node; member
132 _M_last(__x._M_last), _M_node(__x._M_node) {} in _Deque_iterator()
148 _M_set_node(_M_node + 1);
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); }
279 { return (__x._M_node == __y._M_node) ? (__x._M_cur < __y._M_cur)
280 : (__x._M_node < __y._M_node); }
332 * (__x._M_node - __y._M_node - 1) + (__x._M_cur - __x._M_first)
344 * (__x._M_node - __y._M_node - 1) + (__x._M_cur - __x._M_first)
[all …]
/freebsd-12.1/contrib/libstdc++/include/ext/
H A Dslist168 : _M_node(__x) {}
172 { _M_node = _M_node->_M_next; }
176 { return _M_node == __x._M_node; }
180 { return _M_node != __x._M_node; }
578 __pos._M_node),
584 __pos._M_node),
624 __last._M_node));
646 __slist_splice_after(__pos._M_node, __before_first._M_node,
655 __prev._M_node, __prev._M_node->_M_next); }
678 __i._M_node); }
[all …]
/freebsd-12.1/contrib/libstdc++/
H A DChangeLog-20044203 from this->_M_node to this->_M_impl._M_node * bits/list.tcc: Same
H A DChangeLog-20055166 * include/bits/stl_list.h (_List_iterator): Initialize _M_node