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

/freebsd-11.0-release/contrib/libstdc++/include/bits/
H A Dstl_list.h124 : _M_node() { }
128 : _M_node(__x) { }
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
178 _List_node_base* _M_node; member in struct:_List_iterator
260 const _List_node_base* _M_node; member in struct:_List_const_iterator
306 _List_node_base _M_node; member in struct:_List_base::_List_impl
[all...]
H A Dstl_tree.h168 : _M_node() { }
172 : _M_node(__x) { }
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);
220 _Base_ptr _M_node; member in struct:_Rb_tree_iterator
295 _Base_ptr _M_node; member in struct:_Rb_tree_const_iterator
[all...]
H A Dstl_deque.h122 _Map_pointer _M_node; member in struct:_Deque_iterator
126 _M_last(*__y + _S_buffer_size()), _M_node(__y) {}
128 _Deque_iterator() : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) {}
132 _M_last(__x._M_last), _M_node(__x._M_node) {}
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;
271 { return (__x._M_node
[all...]

Completed in 60 milliseconds