| /third_party/boost/boost/intrusive/ |
| D | circular_slist_algorithms.hpp | 75 static void init(node_ptr this_node);
86 static bool unique(const_node_ptr this_node);
94 static bool inited(const_node_ptr this_node);
122 static void link_after(node_ptr prev_node, node_ptr this_node);
144 BOOST_INTRUSIVE_FORCEINLINE static void init_header(node_ptr this_node) in init_header() argument
145 { NodeTraits::set_next(this_node, this_node); } in init_header()
156 …INLINE static node_ptr get_previous_node(const node_ptr &prev_init_node, const node_ptr &this_node) in get_previous_node() argument
157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node()
166 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node() argument
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
[all …]
|
| D | circular_list_algorithms.hpp | 70 BOOST_INTRUSIVE_FORCEINLINE static void init(node_ptr this_node) in init() argument
73 NodeTraits::set_next(this_node, null_node); in init()
74 NodeTraits::set_previous(this_node, null_node); in init()
83 BOOST_INTRUSIVE_FORCEINLINE static bool inited(const const_node_ptr &this_node) in inited() argument
84 { return !NodeTraits::get_next(this_node); } in inited()
94 BOOST_INTRUSIVE_FORCEINLINE static void init_header(node_ptr this_node) in init_header() argument
96 NodeTraits::set_next(this_node, this_node); in init_header()
97 NodeTraits::set_previous(this_node, this_node); in init_header()
109 BOOST_INTRUSIVE_FORCEINLINE static bool unique(const const_node_ptr &this_node) in unique() argument
111 node_ptr next = NodeTraits::get_next(this_node); in unique()
[all …]
|
| D | linear_slist_algorithms.hpp | 75 static void init(const node_ptr & this_node);
86 static bool unique(const_node_ptr this_node);
94 static bool inited(const_node_ptr this_node);
122 static void link_after(const node_ptr & prev_node, const node_ptr & this_node);
144 BOOST_INTRUSIVE_FORCEINLINE static void init_header(const node_ptr & this_node) in init_header() argument
145 { NodeTraits::set_next(this_node, node_ptr ()); } in init_header()
156 …LINE static node_ptr get_previous_node(const node_ptr & prev_init_node, const node_ptr & this_node) in get_previous_node() argument
157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node()
167 static std::size_t count(const const_node_ptr & this_node) in count() argument
170 const_node_ptr p = this_node; in count()
[all …]
|
| D | slist.hpp | 2111 static void priv_swap_lists(node_ptr this_node, node_ptr other_node, detail::bool_<false>) in priv_swap_lists() argument
2112 { node_algorithms::swap_nodes(this_node, other_node); } in priv_swap_lists()
2115 static void priv_swap_lists(node_ptr this_node, node_ptr other_node, detail::bool_<true>) in priv_swap_lists() argument
2116 { node_algorithms::swap_trailing_nodes(this_node, other_node); } in priv_swap_lists()
|
| /third_party/boost/boost/intrusive/detail/ |
| D | common_slist_algorithms.hpp | 43 static node_ptr get_previous_node(node_ptr p, const node_ptr & this_node) in get_previous_node() argument
46 ; this_node != (p_next = NodeTraits::get_next(p)) in get_previous_node()
55 BOOST_INTRUSIVE_FORCEINLINE static void init(node_ptr this_node) in init() argument
56 { NodeTraits::set_next(this_node, node_ptr()); } in init()
58 BOOST_INTRUSIVE_FORCEINLINE static bool unique(const const_node_ptr & this_node) in unique() argument
60 node_ptr next = NodeTraits::get_next(this_node); in unique()
61 return !next || next == this_node; in unique()
64 BOOST_INTRUSIVE_FORCEINLINE static bool inited(const const_node_ptr & this_node) in inited() argument
65 { return !NodeTraits::get_next(this_node); } in inited()
69 const_node_ptr this_node(NodeTraits::get_next(prev_node)); in unlink_after() local
[all …]
|
| /third_party/boost/boost/heap/ |
| D | skew_heap.hpp | 642 node_pointer this_node = object.node_; in erase() local
644 unlink_node(this_node); in erase()
648 this_node->~node(); in erase()
650 alloc.deallocate(this_node, 1); in erase()
678 node_pointer this_node = handle.node_; in update() local
680 if (this_node->get_parent()) { in update()
681 if (super_t::operator()(super_t::get_value(this_node->get_parent()->value), in update()
682 super_t::get_value(this_node->value))) in update()
715 node_pointer this_node = handle.node_; in increase() local
717 if (this_node == root) in increase()
[all …]
|
| D | binomial_heap.hpp | 455 node_pointer this_node = handle.node_; in update() local
457 if (this_node->parent) { in update()
458 …if (super_t::operator()(super_t::get_value(this_node->parent->value), super_t::get_value(this_node… in update()
664 node_pointer this_node = static_cast<node_pointer>(&*this_iterator); in merge_and_clear_nodes()
665 size_type this_degree = this_node->child_count(); in merge_and_clear_nodes()
682 carry_node = merge_trees(this_node, rhs_node); in merge_and_clear_nodes()
703 carry_node = merge_trees(this_node, carry_node); in merge_and_clear_nodes()
837 node_pointer this_node = static_cast<node_pointer>(&*it); in insert_node() local
838 size_type this_degree = this_node->child_count(); in insert_node()
844 n = merge_trees(n, this_node); in insert_node()
|
| /third_party/boost/boost/heap/detail/ |
| D | heap_node.hpp | 55 Node const & this_node = static_cast<Node const &>(*it); in is_heap() local
56 const Node * child = static_cast<const Node*>(&this_node); in is_heap()
|
| /third_party/boost/libs/intrusive/doc/ |
| D | intrusive.qbk | 2459 //Get the previous node of "this_node"
2460 static node_ptr get_prev_node(node_ptr this_node)
2462 node_ptr p = this_node;
2463 while (this_node != NodeTraits::get_next(p))
2468 // number of elements in the group of nodes containing "this_node"
2469 static std::size_t count(const_node_ptr this_node)
2472 const_node_ptr p = this_node;
2476 } while (p != this_node);
|