| /third_party/boost/boost/container/detail/ |
| D | block_slist.hpp | 78 { slist_algo::init_header(&m_slist); } in block_slist_base()
114 slist_algo::init_header(&m_slist); in release()
|
| D | block_list.hpp | 84 { list_algo::init_header(&m_list); } in block_list_base()
130 list_algo::init_header(&m_list); in release()
|
| /third_party/boost/boost/intrusive/ |
| D | unordered_set_hook.hpp | 136 BOOST_INTRUSIVE_FORCEINLINE static void init_header(typename base_type::node_ptr n) in init_header() function
138 base_type::init_header(n); in init_header()
139 group_algorithms::init_header(n); in init_header()
|
| D | circular_list_algorithms.hpp | 94 BOOST_INTRUSIVE_FORCEINLINE static void init_header(node_ptr this_node) in init_header() function in boost::intrusive::circular_list_algorithms
221 init_header(this_node); in swap_nodes()
224 init_header(other_node); in swap_nodes()
|
| D | list.hpp | 183 node_algorithms::init_header(this->get_root_node()); in list_impl()
196 node_algorithms::init_header(this->get_root_node()); in list_impl()
213 node_algorithms::init_header(this->get_root_node()); in list_impl()
231 node_algorithms::init_header(this->get_root_node()); in list_impl()
729 node_algorithms::init_header(this->get_root_node()); in clear()
756 node_algorithms::init_header(this->get_root_node()); in clear_and_dispose()
|
| D | linear_slist_algorithms.hpp | 144 BOOST_INTRUSIVE_FORCEINLINE static void init_header(const node_ptr & this_node) in init_header() function in boost::intrusive::linear_slist_algorithms
|
| D | circular_slist_algorithms.hpp | 144 BOOST_INTRUSIVE_FORCEINLINE static void init_header(node_ptr this_node) in init_header() function in boost::intrusive::circular_slist_algorithms
|
| D | rbtree_algorithms.hpp | 276 BOOST_INTRUSIVE_FORCEINLINE static void init_header(node_ptr header) in init_header() function in boost::intrusive::rbtree_algorithms
278 bstree_algo::init_header(header); in init_header()
|
| D | avltree_algorithms.hpp | 261 static void init_header(node_ptr header) in init_header() function in boost::intrusive::avltree_algorithms
263 bstree_algo::init_header(header); in init_header()
|
| D | sgtree_algorithms.hpp | 134 static void init_header(node_ptr header);
|
| D | bstree.hpp | 127 node_algorithms::init_header(this->header_ptr()); in bstbase3()
1586 node_algorithms::init_header(this->header_ptr()); in clear()
1605 node_algorithms::init_header(this->header_ptr()); in clear_and_dispose()
|
| D | treap_algorithms.hpp | 240 static void init_header(node_ptr header);
|
| D | splaytree_algorithms.hpp | 224 static void init_header(node_ptr header);
|
| D | bstree_algorithms.hpp | 591 BOOST_INTRUSIVE_FORCEINLINE static void init_header(node_ptr header) in init_header() function in boost::intrusive::bstree_algorithms
616 init_header(header); in clear_and_dispose()
|
| D | treap.hpp | 1030 node_algorithms::init_header(this->tree_type::header_ptr()); in clear_and_dispose()
|
| D | slist.hpp | 222 node_algorithms::init_header(this->get_root_node()); in set_default_constructed_state()
|
| /third_party/boost/libs/intrusive/example/ |
| D | doc_slist_algorithms.cpp | 39 algo::init_header(&one); in main()
|
| D | doc_list_algorithms.cpp | 41 algo::init_header(&one); in main()
|
| D | doc_splaytree_algorithms.cpp | 54 algo::init_header(&header); in main()
|
| D | doc_splay_algorithms.cpp | 55 algo::init_header(&header); in main()
|
| D | doc_rbtree_algorithms.cpp | 59 algo::init_header(&header); in main()
|
| D | doc_avltree_algorithms.cpp | 61 algo::init_header(&header); in main()
|
| D | doc_treap_algorithms.cpp | 55 algo::init_header(&header); in main()
|
| /third_party/boost/libs/container/src/ |
| D | pool_resource.cpp | 40 { slist_algo::init_header(&free_slist); } in pool_data_t()
61 slist_algo::init_header(&free_slist); in release()
|