Lines Matching refs:__node
84 const _Slist_node_base* __node)
86 while (__head && __head->_M_next != __node)
93 const _Slist_node_base* __node)
95 while (__head && __head->_M_next != __node)
129 __slist_reverse(_Slist_node_base* __node)
131 _Slist_node_base* __result = __node;
132 __node = __node->_M_next;
134 while(__node)
136 _Slist_node_base* __next = __node->_M_next;
137 __node->_M_next = __result;
138 __result = __node;
139 __node = __next;
145 __slist_size(_Slist_node_base* __node)
148 for (; __node != 0; __node = __node->_M_next)
329 _Node* __node = this->_M_get_node();
332 get_allocator().construct(&__node->_M_data, __x);
333 __node->_M_next = 0;
337 this->_M_put_node(__node);
340 return __node;
346 _Node* __node = this->_M_get_node();
349 get_allocator().construct(&__node->_M_data, value_type());
350 __node->_M_next = 0;
354 this->_M_put_node(__node);
357 return __node;
493 _Node* __node = (_Node*) this->_M_head._M_next;
494 this->_M_head._M_next = __node->_M_next;
495 get_allocator().destroy(&__node->_M_data);
496 this->_M_put_node(__node);
759 _Node* __node = (_Node*) this->_M_head._M_next;
760 for (; __node != 0 && __n > 0; --__n)
762 __node->_M_data = __val;
763 __prev = __node;
764 __node = (_Node*) __node->_M_next;
780 _Node* __node = (_Node*) this->_M_head._M_next;
781 while (__node != 0 && __first != __last)
783 __node->_M_data = *__first;
784 __prev = __node;
785 __node = (_Node*) __node->_M_next;