1 /////////////////////////////////////////////////////////////////////////////
2 //
3 // (C) Copyright Ion Gaztanaga 2007-2013
4 //
5 // Distributed under the Boost Software License, Version 1.0.
6 // (See accompanying file LICENSE_1_0.txt or copy at
7 // http://www.boost.org/LICENSE_1_0.txt)
8 //
9 // See http://www.boost.org/libs/intrusive for documentation.
10 //
11 /////////////////////////////////////////////////////////////////////////////
12 //[doc_splaytree_algorithms_code
13 #include <boost/intrusive/splaytree_algorithms.hpp>
14 #include <cassert>
15
16 struct my_node
17 {
my_nodemy_node18 my_node(int i = 0)
19 : int_(i)
20 {}
21 my_node *parent_, *left_, *right_;
22 //other members
23 int int_;
24 };
25
26 //Define our own splaytree_node_traits
27 struct my_splaytree_node_traits
28 {
29 typedef my_node node;
30 typedef my_node * node_ptr;
31 typedef const my_node * const_node_ptr;
32
get_parentmy_splaytree_node_traits33 static node_ptr get_parent(const_node_ptr n) { return n->parent_; }
set_parentmy_splaytree_node_traits34 static void set_parent(node_ptr n, node_ptr parent){ n->parent_ = parent; }
get_leftmy_splaytree_node_traits35 static node_ptr get_left(const_node_ptr n) { return n->left_; }
set_leftmy_splaytree_node_traits36 static void set_left(node_ptr n, node_ptr left) { n->left_ = left; }
get_rightmy_splaytree_node_traits37 static node_ptr get_right(const_node_ptr n) { return n->right_; }
set_rightmy_splaytree_node_traits38 static void set_right(node_ptr n, node_ptr right) { n->right_ = right; }
39 };
40
41 struct node_ptr_compare
42 {
operator ()node_ptr_compare43 bool operator()(const my_node *a, const my_node *b)
44 { return a->int_ < b->int_; }
45 };
46
main()47 int main()
48 {
49 typedef boost::intrusive::splaytree_algorithms<my_splaytree_node_traits> algo;
50 my_node header, two(2), three(3);
51
52 //Create an empty splaytree container:
53 //"header" will be the header node of the tree
54 algo::init_header(&header);
55
56 //Now insert node "two" in the tree using the sorting functor
57 algo::insert_equal_upper_bound(&header, &two, node_ptr_compare());
58
59 //Now insert node "three" in the tree using the sorting functor
60 algo::insert_equal_lower_bound(&header, &three, node_ptr_compare());
61
62 //Now take the first node (the left node of the header)
63 my_node *n = header.left_;
64 assert(n == &two);
65
66 //Now go to the next node
67 n = algo::next_node(n);
68 assert(n == &three);
69
70 //Erase a node just using a pointer to it
71 algo::unlink(&two);
72
73 //Erase a node using also the header (faster)
74 algo::erase(&header, &three);
75 return 0;
76 }
77
78 //]
79