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

/haiku/headers/cpp/
H A Dstl_list.h145 void _M_put_node(_List_node<_Tp>* __p) function in class:_List_alloc_base
169 void _M_put_node(_List_node<_Tp>* __p) { _Alloc_type::deallocate(__p, 1); } function in class:_List_alloc_base
193 _M_put_node(_M_node);
215 _M_put_node(_M_node);
223 void _M_put_node(_List_node<_Tp>* __p) { _Alloc_type::deallocate(__p, 1); } function in class:_List_base
240 _M_put_node(__tmp);
284 using _Base::_M_put_node;
295 __STL_UNWIND(_M_put_node(__p));
305 __STL_UNWIND(_M_put_node(__p));
390 _M_put_node(__positio
[all...]
H A Dstl_slist.h195 void _M_put_node(_Slist_node<_Tp>* __p) function in class:_Slist_alloc_base
218 void _M_put_node(_Slist_node<_Tp>* __p) { _Alloc_type::deallocate(__p, 1); } function in class:_Slist_alloc_base
246 _M_put_node(__next);
265 void _M_put_node(_Slist_node<_Tp>* __p) { _Alloc_type::deallocate(__p, 1); } function in struct:_Slist_base
273 _M_put_node(__next);
293 _M_put_node(__tmp);
330 __STL_UNWIND(_M_put_node(__node));
340 __STL_UNWIND(_M_put_node(__node));
347 using _Base::_M_put_node;
446 _M_put_node(__nod
[all...]
H A Dstl_tree.h455 void _M_put_node(_Rb_tree_node<_Tp>* __p) function in class:_Rb_tree_alloc_base
476 void _M_put_node(_Rb_tree_node<_Tp>* __p) function in class:_Rb_tree_alloc_base
492 ~_Rb_tree_base() { _M_put_node(_M_header); }
506 ~_Rb_tree_base() { _M_put_node(_M_header); }
515 void _M_put_node(_Rb_tree_node<_Tp>* __p) function in struct:_Rb_tree_base
546 using _Base::_M_put_node;
558 __STL_UNWIND(_M_put_node(__tmp));
574 _M_put_node(__p);
H A Dstl_hashtable.h214 void _M_put_node(_Node* __p) { _M_node_allocator.deallocate(__p, 1); } function in class:hashtable
223 void _M_put_node(_Node* __p) { _M_node_allocator_type::deallocate(__p, 1); } function in class:hashtable
547 __STL_UNWIND(_M_put_node(__n));
553 _M_put_node(__n);

Completed in 95 milliseconds