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

/haiku/headers/cpp/
H A Dstl_slist.h32 _Slist_node_base* _M_next; member in struct:_Slist_node_base
39 __new_node->_M_next = __prev_node->_M_next;
40 __prev_node->_M_next = __new_node;
48 while (__head && __head->_M_next != __node)
49 __head = __head->_M_next;
57 while (__head && __head->_M_next != __node)
58 __head = __head->_M_next;
67 _Slist_node_base* __first = __before_first->_M_next;
68 _Slist_node_base* __after = __pos->_M_next;
[all...]
H A Dstl_hashtable.h52 _Hashtable_node* _M_next; member in struct:_Hashtable_node
349 for (_Node* __cur = _M_buckets[__bucket]; __cur; __cur = __cur->_M_next)
464 __first = __first->_M_next)
475 __first = __first->_M_next)
485 for (const _Node* __cur = _M_buckets[__n]; __cur; __cur = __cur->_M_next)
542 __n->_M_next = 0;
569 _M_cur = _M_cur->_M_next;
594 _M_cur = _M_cur->_M_next;
677 __cur1 = __cur1->_M_next, __cur2 = __cur2->_M_next)
[all...]
H A Dstl_list.h44 _Void_pointer _M_next; member in struct:_List_node
78 _M_node = (_Node*)(_M_node->_M_next);
188 _M_node->_M_next = _M_node;
210 _M_node->_M_next = _M_node;
235 _List_node<_Tp>* __cur = (_List_node<_Tp>*) _M_node->_M_next;
238 __cur = (_List_node<_Tp>*) __cur->_M_next;
242 _M_node->_M_next = _M_node;
312 iterator begin() { return (_Node*)(_M_node->_M_next); }
313 const_iterator begin() const { return (_Node*)(_M_node->_M_next); }
328 bool empty() const { return _M_node->_M_next
[all...]

Completed in 24 milliseconds