Searched refs:_M_node (Results 1 - 4 of 4) sorted by relevance

/haiku/headers/cpp/
H A Dstl_list.h63 _Node* _M_node; member in struct:_List_iterator
65 _List_iterator(_Node* __x) : _M_node(__x) {}
67 _List_iterator(const iterator& __x) : _M_node(__x._M_node) {}
69 bool operator==(const _Self& __x) const { return _M_node == __x._M_node; }
70 bool operator!=(const _Self& __x) const { return _M_node != __x._M_node; }
71 reference operator*() const { return (*_M_node)._M_data; }
78 _M_node
151 _List_node<_Tp>* _M_node; member in class:_List_alloc_base
172 _List_node<_Tp>* _M_node; member in class:_List_alloc_base
226 _List_node<_Tp>* _M_node; member in class:_List_base
[all...]
H A Dstl_deque.h126 _Map_pointer _M_node; member in struct:_Deque_iterator::_Deque_iterator
130 _M_last(*__y + _S_buffer_size()), _M_node(__y) {}
131 _Deque_iterator() : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) {}
134 _M_last(__x._M_last), _M_node(__x._M_node) {}
142 return difference_type(_S_buffer_size()) * (_M_node - __x._M_node - 1) +
149 _M_set_node(_M_node + 1);
162 _M_set_node(_M_node - 1);
183 _M_set_node(_M_node
[all...]
H A Dstl_slist.h109 _Slist_node_base* _M_node; member in struct:_Slist_iterator_base
111 _Slist_iterator_base(_Slist_node_base* __x) : _M_node(__x) {}
112 void _M_incr() { _M_node = _M_node->_M_next; }
115 return _M_node == __x._M_node;
118 return _M_node != __x._M_node;
136 _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x._M_node) {}
138 reference operator*() const { return ((_Node*) _M_node)
[all...]
H A Dstl_tree.h107 _Base_ptr _M_node; member in struct:_Rb_tree_base_iterator
111 if (_M_node->_M_right != 0) {
112 _M_node = _M_node->_M_right;
113 while (_M_node->_M_left != 0)
114 _M_node = _M_node->_M_left;
117 _Base_ptr __y = _M_node->_M_parent;
118 while (_M_node == __y->_M_right) {
119 _M_node
[all...]

Completed in 81 milliseconds