/third_party/boost/boost/intrusive/ |
D | list.hpp | 106 typedef circular_list_algorithms<node_traits> node_algorithms; typedef in boost::intrusive::list_impl 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() 254 node_algorithms::init(this->get_root_node()); in ~list_impl() 271 …BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::inited(to_ins… in push_back() 272 node_algorithms::link_before(this->get_root_node(), to_insert); in push_back() 289 …BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::inited(to_ins… in push_front() 290 node_algorithms::link_before(node_traits::get_next(this->get_root_node()), to_insert); in push_front() [all …]
|
D | bstree.hpp | 85 typedef typename get_algo<AlgoType, node_traits>::type node_algorithms; typedef 127 node_algorithms::init_header(this->header_ptr()); in bstbase3() 149 …{ return iterator(node_algorithms::begin_node(this->header_ptr()), this->priv_value_traits_ptr())… in begin() 155 …{ return const_iterator(node_algorithms::begin_node(this->header_ptr()), this->priv_value_traits_… in cbegin() 158 …{ return iterator(node_algorithms::end_node(this->header_ptr()), this->priv_value_traits_ptr()); … in end() 164 …{ return const_iterator(node_algorithms::end_node(this->header_ptr()), this->priv_value_traits_pt… in cend() 167 …{ return iterator(node_algorithms::root_node(this->header_ptr()), this->priv_value_traits_ptr());… in root() 173 …{ return const_iterator(node_algorithms::root_node(this->header_ptr()), this->priv_value_traits_p… in croot() 195 node_algorithms::replace_node( get_value_traits().to_node_ptr(*replace_this) in replace_node() 199 node_algorithms::init(replace_this.pointed_node()); in replace_node() [all …]
|
D | slist.hpp | 157 >::type node_algorithms; typedef in boost::intrusive::slist_impl 222 node_algorithms::init_header(this->get_root_node()); in set_default_constructed_state() 376 node_algorithms::init(this->get_root_node()); in ~slist_impl() 416 node_algorithms::init(to_erase); in clear_and_dispose() 435 …BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::inited(to_ins… in push_front() 441 node_algorithms::link_after(this->get_root_node(), to_insert); in push_front() 460 … BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::inited(n)); in push_back() 461 node_algorithms::link_after(this->get_last_node(), n); in push_back() 493 node_algorithms::unlink_after(this->get_root_node()); in pop_front_and_dispose() 496 node_algorithms::init(to_erase); in pop_front_and_dispose() [all …]
|
D | treap.hpp | 135 typedef BOOST_INTRUSIVE_IMPDEF(treap_algorithms<node_traits>) node_algorithms; typedef in boost::intrusive::treap_impl 168 typedef typename node_algorithms::insert_commit_data insert_commit_data; 436 …BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_ins… in insert_equal() 438 ( node_algorithms::insert_equal_upper_bound in insert_equal() 465 …BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_ins… in insert_equal() 467 (node_algorithms::insert_equal in insert_equal() 680 (node_algorithms::insert_unique_check in BOOST_INTRUSIVE_DOC1ST() 733 (node_algorithms::insert_unique_check in insert_unique_check() 761 …BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(to_ins… in insert_unique_commit() 762 node_algorithms::insert_unique_commit(this->tree_type::header_ptr(), to_insert, commit_data); in insert_unique_commit() [all …]
|
D | sgtree.hpp | 264 typedef BOOST_INTRUSIVE_IMPDEF(sgtree_algorithms<node_traits>) node_algorithms; typedef in boost::intrusive::sgtree_impl 289 typedef BOOST_INTRUSIVE_IMPDEF(typename node_algorithms::insert_commit_data) insert_commit_data; 451 BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(node_algorithms::unique(to_insert)); in insert_equal() 453 node_ptr p = node_algorithms::insert_equal_upper_bound in insert_equal() 466 BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(node_algorithms::unique(to_insert)); in insert_equal() 468 node_ptr p = node_algorithms::insert_equal in insert_equal() 517 node_algorithms::insert_unique_check in BOOST_INTRUSIVE_DOC1ST() 529 node_algorithms::insert_unique_check in insert_unique_check() 549 BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(node_algorithms::unique(to_insert)); in insert_unique_commit() 551 node_algorithms::insert_unique_commit in insert_unique_commit() [all …]
|
D | splaytree.hpp | 99 typedef typename implementation_defined::node_algorithms node_algorithms; typedef in boost::intrusive::splaytree_impl 485 { return node_algorithms::splay_up(i.pointed_node(), tree_type::header_ptr()); } in splay_up() 502 node_ptr r = node_algorithms::splay_down(tree_type::header_ptr(), key, key_node_comp); in splay_down()
|
D | bs_set.hpp | 83 typedef typename implementation_defined::node_algorithms node_algorithms; typedef in boost::intrusive::bs_set_impl 619 typedef typename implementation_defined::node_algorithms node_algorithms; typedef in boost::intrusive::bs_multiset_impl
|
D | set.hpp | 86 typedef typename implementation_defined::node_algorithms node_algorithms; typedef in boost::intrusive::set_impl 623 typedef typename implementation_defined::node_algorithms node_algorithms; typedef in boost::intrusive::multiset_impl
|
D | unordered_set.hpp | 118 typedef typename implementation_defined::node_algorithms node_algorithms; typedef in boost::intrusive::unordered_set_impl 616 typedef typename implementation_defined::node_algorithms node_algorithms; typedef in boost::intrusive::unordered_multiset_impl
|
D | avl_set.hpp | 84 typedef typename implementation_defined::node_algorithms node_algorithms; typedef in boost::intrusive::avl_set_impl 623 typedef typename implementation_defined::node_algorithms node_algorithms; typedef in boost::intrusive::avl_multiset_impl
|
D | treap_set.hpp | 87 typedef typename implementation_defined::node_algorithms node_algorithms; typedef in boost::intrusive::treap_set_impl 645 typedef typename implementation_defined::node_algorithms node_algorithms; typedef in boost::intrusive::treap_multiset_impl
|
D | splay_set.hpp | 84 typedef typename implementation_defined::node_algorithms node_algorithms; typedef in boost::intrusive::splay_set_impl 644 typedef typename implementation_defined::node_algorithms node_algorithms; typedef in boost::intrusive::splay_multiset_impl
|
D | sg_set.hpp | 84 typedef typename implementation_defined::node_algorithms node_algorithms; typedef in boost::intrusive::sg_set_impl 632 typedef typename implementation_defined::node_algorithms node_algorithms; typedef in boost::intrusive::sg_multiset_impl
|
D | hashtable.hpp | 375 typedef circular_slist_algorithms<node_traits> node_algorithms; typedef 674 typedef typename slist_impl::node_algorithms node_algorithms; typedef 969 buckets_it->clear_and_dispose(detail::init_disposer<node_algorithms>()); in priv_clear_buckets() 1393 typedef typename slist_impl::node_algorithms node_algorithms; typedef 1720 typedef typename slist_impl::node_algorithms node_algorithms; typedef in boost::intrusive::hashtable_impl 2273 … BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(n)); in insert_unique_commit() 3179 typedef detail::init_disposer<node_algorithms> NodeDisposer; in rehash_impl() 3369 … BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(n)); in priv_insert_equal_after_find()
|
D | rbtree.hpp | 109 typedef typename implementation_defined::node_algorithms node_algorithms; typedef in boost::intrusive::rbtree_impl
|
D | avltree.hpp | 109 typedef typename implementation_defined::node_algorithms node_algorithms; typedef in boost::intrusive::avltree_impl
|
/third_party/boost/boost/intrusive/detail/ |
D | generic_hook.hpp | 153 typedef typename get_algo<Algo, NodeTraits>::type node_algorithms; typedef in boost::intrusive::generic_hook 154 typedef typename node_algorithms::node node; 155 typedef typename node_algorithms::node_ptr node_ptr; 156 typedef typename node_algorithms::const_node_ptr const_node_ptr; 176 node_algorithms::init(this->this_ptr()); in generic_hook() 183 node_algorithms::init(this->this_ptr()); in generic_hook() 198 node_algorithms::swap_nodes in swap_nodes() 206 return !node_algorithms::unique(this->this_ptr()); in is_linked() 213 if(!node_algorithms::inited(n)){ in unlink() 214 node_algorithms::unlink(n); in unlink() [all …]
|
D | tree_iterator.hpp | 52 typedef bstree_algorithms_base<node_traits> node_algorithms; typedef in boost::intrusive::tree_iterator 98 members_.nodeptr_ = node_algorithms::next_node(members_.nodeptr_); in operator ++() 105 members_.nodeptr_ = node_algorithms::next_node(members_.nodeptr_); in operator ++() 111 members_.nodeptr_ = node_algorithms::prev_node(members_.nodeptr_); in operator --() 118 members_.nodeptr_ = node_algorithms::prev_node(members_.nodeptr_); in operator --() 163 … return tree_iterator(node_algorithms::get_header(this->pointed_node()), this->get_value_traits()); in end_iterator_from_it()
|
D | node_cloner_disposer.hpp | 44 , node_traits>::type node_algorithms; typedef 67 … BOOST_INTRUSIVE_SAFE_HOOK_DEFAULT_ASSERT(!safemode_or_autounlink || node_algorithms::unique(n)); in operator ()() 84 , node_traits>::type node_algorithms; typedef 95 node_algorithms::init(p); in operator ()()
|
/third_party/boost/libs/intrusive/test/ |
D | nonhook_node.hpp | 37 typedef Node_Algorithms< node_traits > node_algorithms; typedef 41 node_algorithms::init(pointer_traits<node_ptr>::pointer_to(static_cast< node& >(*this))); in nonhook_node_member() 47 node_algorithms::init(pointer_traits<node_ptr>::pointer_to(static_cast< node& >(*this))); in nonhook_node_member() 59 node_algorithms::init(pointer_traits<node_ptr>::pointer_to(static_cast< node& >(*this))); in ~nonhook_node_member() 64 node_algorithms::swap_nodes(pointer_traits<node_ptr>::pointer_to(static_cast< node& >(*this)), in swap_nodes() 70 …return !node_algorithms::unique(pointer_traits<const_node_ptr>::pointer_to(static_cast< const node… in is_linked()
|
D | list_test.cpp | 47 typedef typename list_type::node_algorithms node_algorithms; typedef 315 swap_nodes< node_algorithms >(values[0], values[2]); in test_swap() 319 swap_nodes< node_algorithms >(values[2], values[4]); in test_swap() 331 swap_nodes< node_algorithms >(values[1], values[2]); in test_swap() 336 swap_nodes< node_algorithms >(values[0], values[2]); in test_swap() 341 swap_nodes< node_algorithms >(values[0], values[2]); in test_swap()
|
D | slist_test.cpp | 48 typedef typename list_type::node_algorithms node_algorithms; typedef 384 swap_nodes< node_algorithms >(values[0], values[2]); in test_swap() 388 swap_nodes< node_algorithms >(values[2], values[4]); in test_swap() 403 swap_nodes< node_algorithms >(values[1], values[2]); in test_swap() 411 swap_nodes< node_algorithms >(values[0], values[2]); in test_swap() 418 swap_nodes< node_algorithms >(values[0], values[2]); in test_swap()
|
/third_party/boost/libs/intrusive/doc/ |
D | intrusive.qbk | 2632 [section:node_algorithms Node algorithms with custom NodeTraits] 3108 described in the previous chapter: [link intrusive.node_algorithms Node Algorithms].
|
/third_party/boost/doc/html/ |
D | doc_HTML.manifest | 1499 intrusive/node_algorithms.html
|