| /third_party/boost/boost/intrusive/detail/ |
| D | any_node_and_algorithms.hpp | 37 typedef typename pointer_rebind<VoidPointer, node>::type node_ptr; typedef
39 node_ptr node_ptr_1;
40 node_ptr node_ptr_2;
41 node_ptr node_ptr_3;
49 typedef typename node::node_ptr node_ptr; typedef
52 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const const_node_ptr & n) in get_next()
55 BOOST_INTRUSIVE_FORCEINLINE static void set_next(node_ptr n, node_ptr next) in set_next()
58 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous(const const_node_ptr & n) in get_previous()
61 BOOST_INTRUSIVE_FORCEINLINE static void set_previous(node_ptr n, node_ptr prev) in set_previous()
70 typedef typename node::node_ptr node_ptr; typedef
[all …]
|
| D | rbtree_node.hpp | 47 typedef typename pointer_rebind<VoidPointer, node >::type node_ptr; typedef
50 node_ptr parent_, left_, right_;
58 typedef typename pointer_rebind<VoidPointer, node >::type node_ptr; typedef
62 node_ptr parent_, left_, right_;
72 typedef typename node::node_ptr node_ptr; typedef
77 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_parent(const const_node_ptr & n) in get_parent()
80 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_parent(const node_ptr & n) in get_parent()
83 BOOST_INTRUSIVE_FORCEINLINE static void set_parent(node_ptr n, node_ptr p) in set_parent()
86 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_left(const const_node_ptr & n) in get_left()
89 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_left(const node_ptr & n) in get_left()
[all …]
|
| D | avltree_node.hpp | 44 …edef typename pointer_rebind<VoidPointer, compact_avltree_node<VoidPointer> >::type node_ptr; typedef
47 node_ptr parent_, left_, right_;
54 typedef typename pointer_rebind<VoidPointer, avltree_node<VoidPointer> >::type node_ptr; typedef
57 node_ptr parent_, left_, right_;
67 typedef typename node::node_ptr node_ptr; typedef
72 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_parent(const const_node_ptr & n) in get_parent()
75 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_parent(const node_ptr & n) in get_parent()
78 BOOST_INTRUSIVE_FORCEINLINE static void set_parent(node_ptr n, node_ptr p) in set_parent()
81 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_left(const const_node_ptr & n) in get_left()
84 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_left(const node_ptr & n) in get_left()
[all …]
|
| D | common_slist_algorithms.hpp | 39 typedef typename NodeTraits::node_ptr node_ptr; typedef in boost::intrusive::detail::common_slist_algorithms
43 static node_ptr get_previous_node(node_ptr p, const node_ptr & this_node) in get_previous_node()
45 for( node_ptr p_next in get_previous_node()
55 BOOST_INTRUSIVE_FORCEINLINE static void init(node_ptr this_node) in init()
56 { NodeTraits::set_next(this_node, node_ptr()); } in init()
60 node_ptr next = NodeTraits::get_next(this_node); in unique()
67 BOOST_INTRUSIVE_FORCEINLINE static void unlink_after(node_ptr prev_node) in unlink_after()
73 BOOST_INTRUSIVE_FORCEINLINE static void unlink_after(node_ptr prev_node, node_ptr last_node) in unlink_after()
76 BOOST_INTRUSIVE_FORCEINLINE static void link_after(node_ptr prev_node, node_ptr this_node) in link_after()
82 BOOST_INTRUSIVE_FORCEINLINE static void incorporate_after(node_ptr bp, node_ptr b, node_ptr be) in incorporate_after()
[all …]
|
| D | tree_node.hpp | 34 typedef typename pointer_rebind<VoidPointer, tree_node>::type node_ptr; typedef
36 node_ptr parent_, left_, right_;
44 typedef typename node::node_ptr node_ptr; typedef
47 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_parent(const const_node_ptr & n) in get_parent()
50 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_parent(const node_ptr & n) in get_parent()
53 BOOST_INTRUSIVE_FORCEINLINE static void set_parent(node_ptr n, node_ptr p) in set_parent()
56 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_left(const const_node_ptr & n) in get_left()
59 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_left(const node_ptr & n) in get_left()
62 BOOST_INTRUSIVE_FORCEINLINE static void set_left(node_ptr n, node_ptr l) in set_left()
65 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_right(const const_node_ptr & n) in get_right()
[all …]
|
| D | bstree_algorithms_base.hpp | 35 typedef typename NodeTraits::node_ptr node_ptr; typedef in boost::intrusive::bstree_algorithms_base
45 static node_ptr next_node(const node_ptr & node) in next_node()
47 node_ptr const n_right(NodeTraits::get_right(node)); in next_node()
52 node_ptr n(node); in next_node()
53 node_ptr p(NodeTraits::get_parent(n)); in next_node()
69 static node_ptr prev_node(const node_ptr & node) in prev_node()
79 node_ptr p(node); in prev_node()
80 node_ptr x = NodeTraits::get_parent(p); in prev_node()
96 static node_ptr minimum(node_ptr node) in minimum()
98 for(node_ptr p_left = NodeTraits::get_left(node) in minimum()
[all …]
|
| D | list_node.hpp | 38 typedef typename pointer_rebind<VoidPointer, list_node>::type node_ptr; typedef
39 node_ptr next_;
40 node_ptr prev_;
47 typedef typename node::node_ptr node_ptr; typedef
50 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous(const const_node_ptr & n) in get_previous()
53 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous(const node_ptr & n) in get_previous()
56 BOOST_INTRUSIVE_FORCEINLINE static void set_previous(node_ptr n, node_ptr prev) in set_previous()
59 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const const_node_ptr & n) in get_next()
62 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const node_ptr & n) in get_next()
65 BOOST_INTRUSIVE_FORCEINLINE static void set_next(node_ptr n, node_ptr next) in set_next()
|
| D | hook_traits.hpp | 39 typedef NodePtr node_ptr; typedef
40 typedef typename pointer_traits<node_ptr>::element_type node;
43 typedef typename pointer_traits<node_ptr>::
45 typedef typename pointer_traits<node_ptr>::
47 typedef typename pointer_traits<node_ptr>::
58 BOOST_INTRUSIVE_FORCEINLINE static pointer to_value_ptr(const node_ptr & n) in to_value_ptr()
74 BOOST_INTRUSIVE_FORCEINLINE static node_ptr to_node_ptr(reference value) in to_node_ptr()
76 node_ptr p = pointer_traits<node_ptr>::pointer_to in to_node_ptr()
93 : public bhtraits_base<T, typename NodeTraits::node_ptr, Tag, Type>
108 typedef typename node_traits::node_ptr node_ptr; typedef
[all …]
|
| D | slist_node.hpp | 35 typedef typename pointer_rebind<VoidPointer, slist_node>::type node_ptr; typedef
36 node_ptr next_;
46 typedef typename node::node_ptr node_ptr; typedef
49 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const const_node_ptr & n) in get_next()
52 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const node_ptr & n) in get_next()
55 BOOST_INTRUSIVE_FORCEINLINE static void set_next(node_ptr n, node_ptr next) in set_next()
|
| /third_party/boost/boost/intrusive/ |
| D | splaytree_algorithms.hpp | 55 typedef typename NodeTraits::node_ptr node_ptr; typedef
57 …splaydown_assemble_and_fix_header(node_ptr t, node_ptr header, node_ptr leftmost, node_ptr rightmo… in splaydown_assemble_and_fix_header()
90 node_ptr const old_t_left = NodeTraits::get_left(t_); in assemble()
91 node_ptr const old_t_right = NodeTraits::get_right(t_); in assemble()
102 node_ptr const null_right = NodeTraits::get_right(null_node_); in assemble()
103 node_ptr const null_left = NodeTraits::get_left(null_node_); in assemble()
116 node_ptr t_, null_node_, l_, r_, leftmost_, rightmost_;
169 typedef typename NodeTraits::node_ptr node_ptr; typedef in boost::intrusive::splaytree_algorithms
179 static node_ptr get_header(const const_node_ptr & n);
182 static node_ptr begin_node(const const_node_ptr & header);
[all …]
|
| D | linear_slist_algorithms.hpp | 62 typedef typename NodeTraits::node_ptr node_ptr; typedef in boost::intrusive::linear_slist_algorithms
75 static void init(const node_ptr & this_node);
103 static void unlink_after(const node_ptr & prev_node);
113 static void unlink_after(const node_ptr & prev_node, const node_ptr & last_node);
122 static void link_after(const node_ptr & prev_node, const node_ptr & this_node);
133 static void transfer_after(const node_ptr & p, const node_ptr & b, const node_ptr & e);
144 BOOST_INTRUSIVE_FORCEINLINE static void init_header(const node_ptr & this_node) in init_header()
145 { NodeTraits::set_next(this_node, node_ptr ()); } in init_header()
156 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & prev_init_node, con… in get_previous_node()
187 static void swap_trailing_nodes(node_ptr this_node, node_ptr other_node) in swap_trailing_nodes()
[all …]
|
| D | sgtree_algorithms.hpp | 68 typedef typename NodeTraits::node_ptr node_ptr; typedef in boost::intrusive::sgtree_algorithms
89 static node_ptr get_header(const_node_ptr n);
92 static node_ptr begin_node(const_node_ptr header);
95 static node_ptr end_node(const_node_ptr header);
98 static void swap_tree(node_ptr header1, node_ptr header2);
101 static void swap_nodes(node_ptr node1, node_ptr node2);
104 static void swap_nodes(node_ptr node1, node_ptr header1, node_ptr node2, node_ptr header2);
107 static void replace_node(node_ptr node_to_be_replaced, node_ptr new_node);
110 static void replace_node(node_ptr node_to_be_replaced, node_ptr header, node_ptr new_node);
116 static node_ptr unlink_leftmost_without_rebalance(node_ptr header);
[all …]
|
| D | circular_slist_algorithms.hpp | 62 typedef typename NodeTraits::node_ptr node_ptr; typedef in boost::intrusive::circular_slist_algorithms
75 static void init(node_ptr this_node);
103 static void unlink_after(node_ptr prev_node);
113 static void unlink_after(node_ptr prev_node, node_ptr last_node);
122 static void link_after(node_ptr prev_node, node_ptr this_node);
133 static void transfer_after(node_ptr p, node_ptr b, node_ptr e);
144 BOOST_INTRUSIVE_FORCEINLINE static void init_header(node_ptr this_node) in init_header()
156 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr &prev_init_node, cons… in get_previous_node()
166 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node()
176 … BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_previous_node(const node_ptr & this_node) in get_previous_previous_node()
[all …]
|
| D | treap_algorithms.hpp | 117 typedef typename NodeTraits::node_ptr node_ptr; typedef in boost::intrusive::treap_algorithms
130 rerotate_on_destroy(node_ptr header, node_ptr p, std::size_t &n) in rerotate_on_destroy()
144 const node_ptr header_;
145 const node_ptr p_;
150 static void rotate_up_n(const node_ptr header, const node_ptr p, std::size_t n) in rotate_up_n()
152 node_ptr p_parent(NodeTraits::get_parent(p)); in rotate_up_n()
153 node_ptr p_grandparent(NodeTraits::get_parent(p_parent)); in rotate_up_n()
184 static node_ptr get_header(const_node_ptr n);
187 static node_ptr begin_node(const_node_ptr header);
190 static node_ptr end_node(const_node_ptr header);
[all …]
|
| D | avltree_algorithms.hpp | 42 typedef typename NodeTraits::node_ptr node_ptr; typedef
49 BOOST_INTRUSIVE_FORCEINLINE node_ptr operator()(const node_ptr & p) in operator ()()
51 node_ptr n = base_t::get()(p); in operator ()()
56 BOOST_INTRUSIVE_FORCEINLINE node_ptr operator()(const node_ptr & p) const in operator ()()
58 node_ptr n = base_t::get()(p); in operator ()()
152 typedef typename NodeTraits::node_ptr node_ptr; typedef in boost::intrusive::avltree_algorithms
170 static node_ptr get_header(const const_node_ptr & n);
173 static node_ptr begin_node(const const_node_ptr & header);
176 static node_ptr end_node(const const_node_ptr & header);
179 static void swap_tree(node_ptr header1, node_ptr header2);
[all …]
|
| D | rbtree_algorithms.hpp | 50 typedef typename NodeTraits::node_ptr node_ptr; typedef
57 BOOST_INTRUSIVE_FORCEINLINE node_ptr operator()(node_ptr p) in operator ()()
59 node_ptr n = base_t::get()(p); in operator ()()
75 typedef typename node_traits::node_ptr node_ptr; typedef
95 const node_ptr p_left(node_traits::get_left(p)); (void)p_left; in operator ()()
96 const node_ptr p_right(node_traits::get_right(p)); (void)p_right; in operator ()()
174 typedef typename NodeTraits::node_ptr node_ptr; typedef in boost::intrusive::rbtree_algorithms
194 static node_ptr get_header(const const_node_ptr & n);
197 static node_ptr begin_node(const const_node_ptr & header);
200 static node_ptr end_node(const const_node_ptr & header);
[all …]
|
| D | bstree_algorithms.hpp | 178 typedef typename NodeTraits::node_ptr node_ptr; typedef in boost::intrusive::bstree_algorithms
180 typedef insert_commit_data_t<node_ptr> insert_commit_data;
181 typedef data_for_rebalance_t<node_ptr> data_for_rebalance;
190 BOOST_INTRUSIVE_FORCEINLINE dispose_subtree_disposer(Disposer &disp, const node_ptr & subtree) in dispose_subtree_disposer()
204 const node_ptr subtree_;
217 BOOST_INTRUSIVE_FORCEINLINE static node_ptr begin_node(const const_node_ptr & header) in begin_node()
227 BOOST_INTRUSIVE_FORCEINLINE static node_ptr end_node(const const_node_ptr & header) in end_node()
237 BOOST_INTRUSIVE_FORCEINLINE static node_ptr root_node(const const_node_ptr & header) in root_node()
239 node_ptr p = node_traits::get_parent(header); in root_node()
262 static node_ptr get_header(const const_node_ptr & node);
[all …]
|
| D | circular_list_algorithms.hpp | 60 typedef typename NodeTraits::node_ptr node_ptr; typedef in boost::intrusive::circular_list_algorithms
70 BOOST_INTRUSIVE_FORCEINLINE static void init(node_ptr this_node) in init()
72 const node_ptr null_node = node_ptr(); in init()
94 BOOST_INTRUSIVE_FORCEINLINE static void init_header(node_ptr this_node) in init_header()
111 node_ptr next = NodeTraits::get_next(this_node); in unique()
141 BOOST_INTRUSIVE_FORCEINLINE static node_ptr unlink(node_ptr this_node) in unlink()
143 node_ptr next(NodeTraits::get_next(this_node)); in unlink()
144 node_ptr prev(NodeTraits::get_previous(this_node)); in unlink()
157 BOOST_INTRUSIVE_FORCEINLINE static void unlink(node_ptr b, node_ptr e) in unlink()
160 node_ptr prevb(NodeTraits::get_previous(b)); in unlink()
[all …]
|
| D | unordered_set_hook.hpp | 41 node_ptr; typedef
42 node_ptr prev_in_group_;
53 node_ptr; typedef
54 node_ptr prev_in_group_;
64 node_ptr; typedef
77 < node >::type node_ptr; typedef
85 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_next(const const_node_ptr & n) in get_next()
86 { return pointer_traits<node_ptr>::static_cast_from(n->next_); } in get_next()
88 BOOST_INTRUSIVE_FORCEINLINE static void set_next(node_ptr n, node_ptr next) in set_next()
91 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_prev_in_group(const const_node_ptr & n) in get_prev_in_group()
[all …]
|
| /third_party/boost/libs/intrusive/test/ |
| D | bptr_value.hpp | 134 typedef bounded_pointer< val_t > node_ptr; typedef
137 static node_ptr get_previous(const_node_ptr p) { return p->m_previous; } in get_previous()
138 static void set_previous(node_ptr p, node_ptr prev) { p->m_previous = prev; } in set_previous()
139 static node_ptr get_next(const_node_ptr p) { return p->m_next; } in get_next()
140 static void set_next(node_ptr p, node_ptr next) { p->m_next = next; } in set_next()
147 typedef bounded_pointer< val_t > node_ptr; typedef
150 static node_ptr get_parent(const_node_ptr p) { return p->m_parent; } in get_parent()
151 static void set_parent(node_ptr p, node_ptr parent) { p->m_parent = parent; } in set_parent()
152 static node_ptr get_left(const_node_ptr p) { return p->m_l_child; } in get_left()
153 static void set_left(node_ptr p, node_ptr l_child) { p->m_l_child = l_child; } in set_left()
[all …]
|
| D | nonhook_node.hpp | 35 typedef typename node_traits::node_ptr node_ptr; 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()
65 … pointer_traits<node_ptr>::pointer_to(static_cast< node& >(other))); in swap_nodes()
80 typedef typename node_traits::node_ptr node_ptr; typedef
82 typedef typename pointer_traits<node_ptr>::
84 typedef typename pointer_traits<node_ptr>::
93 static node_ptr to_node_ptr(reference value) in to_node_ptr()
[all …]
|
| /third_party/boost/libs/intrusive/example/ |
| D | doc_rbtree_algorithms.cpp | 31 typedef my_node * node_ptr; typedef
34 static node_ptr get_parent(const_node_ptr n) { return n->parent_; } in get_parent()
35 static void set_parent(node_ptr n, node_ptr parent){ n->parent_ = parent; } in set_parent()
36 static node_ptr get_left(const_node_ptr n) { return n->left_; } in get_left()
37 static void set_left(node_ptr n, node_ptr left) { n->left_ = left; } in set_left()
38 static node_ptr get_right(const_node_ptr n) { return n->right_; } in get_right()
39 static void set_right(node_ptr n, node_ptr right) { n->right_ = right; } in set_right()
41 static void set_color(node_ptr n, color c) { n->color_ = c; } in set_color()
|
| D | doc_avltree_algorithms.cpp | 31 typedef my_node * node_ptr; typedef
35 static node_ptr get_parent(const_node_ptr n) { return n->parent_; } in get_parent()
36 static void set_parent(node_ptr n, node_ptr parent){ n->parent_ = parent; } in set_parent()
37 static node_ptr get_left(const_node_ptr n) { return n->left_; } in get_left()
38 static void set_left(node_ptr n, node_ptr left) { n->left_ = left; } in set_left()
39 static node_ptr get_right(const_node_ptr n) { return n->right_; } in get_right()
40 static void set_right(node_ptr n, node_ptr right) { n->right_ = right; } in set_right()
42 static void set_balance(node_ptr n, balance b) { n->balance_ = b; } in set_balance()
|
| D | doc_splaytree_algorithms.cpp | 30 typedef my_node * node_ptr; typedef
33 static node_ptr get_parent(const_node_ptr n) { return n->parent_; } in get_parent()
34 static void set_parent(node_ptr n, node_ptr parent){ n->parent_ = parent; } in set_parent()
35 static node_ptr get_left(const_node_ptr n) { return n->left_; } in get_left()
36 static void set_left(node_ptr n, node_ptr left) { n->left_ = left; } in set_left()
37 static node_ptr get_right(const_node_ptr n) { return n->right_; } in get_right()
38 static void set_right(node_ptr n, node_ptr right) { n->right_ = right; } in set_right()
|
| D | doc_splay_algorithms.cpp | 31 typedef my_node * node_ptr; typedef
34 static node_ptr get_parent(const_node_ptr n) { return n->parent_; } in get_parent()
35 static void set_parent(node_ptr n, node_ptr parent){ n->parent_ = parent; } in set_parent()
36 static node_ptr get_left(const_node_ptr n) { return n->left_; } in get_left()
37 static void set_left(node_ptr n, node_ptr left) { n->left_ = left; } in set_left()
38 static node_ptr get_right(const_node_ptr n) { return n->right_; } in get_right()
39 static void set_right(node_ptr n, node_ptr right) { n->right_ = right; } in set_right()
|