| /third_party/boost/boost/intrusive/ |
| D | rbtree_algorithms.hpp | 181 typedef bstree_algorithms<NodeTraits> bstree_algo; typedef in boost::intrusive::rbtree_algorithms
189 typedef typename bstree_algo::insert_commit_data insert_commit_data;
213 node_ptr header1(bstree_algo::get_header(node1)), header2(bstree_algo::get_header(node2)); in swap_nodes()
222 bstree_algo::swap_nodes(node1, header1, node2, header2); in swap_nodes()
234 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
240 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
278 bstree_algo::init_header(header); in init_header()
285 typename bstree_algo::data_for_rebalance info; in erase()
286 bstree_algo::erase(header, z, info); in erase()
296 typename bstree_algo::data_for_rebalance info; in transfer_unique()
[all …]
|
| D | splaytree_algorithms.hpp | 163 typedef bstree_algorithms<NodeTraits> bstree_algo; typedef in boost::intrusive::splaytree_algorithms
174 typedef typename bstree_algo::insert_commit_data insert_commit_data;
234 splay_up(bstree_algo::prev_node(z), header); in erase()
251 bstree_algo::erase(header, z); in erase()
259 typename bstree_algo::insert_commit_data commit_data; in transfer_unique()
260 … bool const transferable = bstree_algo::insert_unique_check(header1, z, comp, commit_data).second; in transfer_unique()
263 bstree_algo::insert_commit(header1, z, commit_data); in transfer_unique()
276 bstree_algo::insert_equal_upper_bound_check(header1, z, comp, commit_data); in transfer_equal()
278 bstree_algo::insert_commit(header1, z, commit_data); in transfer_equal()
312 { return bstree_algo::count(header, key, comp); } in count()
[all …]
|
| D | avltree_algorithms.hpp | 158 typedef bstree_algorithms<NodeTraits> bstree_algo; typedef in boost::intrusive::avltree_algorithms
165 typedef typename bstree_algo::insert_commit_data insert_commit_data;
189 node_ptr header1(bstree_algo::get_header(node1)), header2(bstree_algo::get_header(node2)); in swap_nodes()
198 bstree_algo::swap_nodes(node1, header1, node2, header2); in swap_nodes()
210 replace_node(node_to_be_replaced, bstree_algo::get_header(node_to_be_replaced), new_node); in replace_node()
216 bstree_algo::replace_node(node_to_be_replaced, header, new_node); in replace_node()
263 bstree_algo::init_header(header); in init_header()
270 typename bstree_algo::data_for_rebalance info; in erase()
271 bstree_algo::erase(header, z, info); in erase()
281 typename bstree_algo::data_for_rebalance info; in transfer_unique()
[all …]
|
| D | treap_algorithms.hpp | 123 typedef bstree_algorithms<NodeTraits> bstree_algo; typedef in boost::intrusive::treap_algorithms
156 bstree_algo::rotate_right(p_parent, p, p_grandparent, header); in rotate_up_n()
159 bstree_algo::rotate_left(p_parent, p, p_grandparent, header); in rotate_up_n()
173 : public bstree_algo::insert_commit_data
214 while(!bstree_algo::is_header(x)) in unlink()
248 bstree_algo::erase(header, z); in erase()
314 bstree_algo::insert_equal_upper_bound_check(h, new_node, comp, commit_data); in insert_equal_upper_bound()
339 bstree_algo::insert_equal_lower_bound_check(h, new_node, comp, commit_data); in insert_equal_lower_bound()
367 bstree_algo::insert_equal_check(h, hint, new_node, comp, commit_data); in insert_equal()
395 bstree_algo::insert_before_check(header, pos, commit_data); in insert_before()
[all …]
|
| D | sgtree_algorithms.hpp | 74 typedef bstree_algorithms<NodeTraits> bstree_algo; typedef in boost::intrusive::sgtree_algorithms
82 : bstree_algo::insert_commit_data
141 bstree_algo::erase(header, z); in erase()
145 bstree_algo::rebalance(header); in erase()
200 bstree_algo::insert_equal_upper_bound(h, new_node, comp, &depth); in insert_equal_upper_bound()
212 bstree_algo::insert_equal_lower_bound(h, new_node, comp, &depth); in insert_equal_lower_bound()
224 bstree_algo::insert_equal(header, hint, new_node, comp, &depth); in insert_equal()
236 bstree_algo::insert_before(header, pos, new_node, &depth); in insert_before()
247 bstree_algo::push_back(header, new_node, &depth); in push_back()
257 bstree_algo::push_front(header, new_node, &depth); in push_front()
[all …]
|