$extrastylesheet
Olena  User documentation 2.1
An Image Processing Platform
 All Classes Namespaces Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
tree_to_fast.cc
1 // Copyright (C) 2007, 2008, 2009 EPITA Research and Development Laboratory (LRDE)
2 //
3 // This file is part of Olena.
4 //
5 // Olena is free software: you can redistribute it and/or modify it under
6 // the terms of the GNU General Public License as published by the Free
7 // Software Foundation, version 2 of the License.
8 //
9 // Olena is distributed in the hope that it will be useful,
10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 // General Public License for more details.
13 //
14 // You should have received a copy of the GNU General Public License
15 // along with Olena. If not, see <http://www.gnu.org/licenses/>.
16 //
17 // As a special exception, you may use this file as part of a free
18 // software project without restriction. Specifically, if other files
19 // instantiate templates or use macros or inline functions from this
20 // file, or you compile this file and link it with other files to produce
21 // an executable, this file does not by itself cause the resulting
22 // executable to be covered by the GNU General Public License. This
23 // exception does not however invalidate any other reasons why the
24 // executable file might be covered by the GNU General Public License.
25 
26 #include <mln/util/tree.hh>
27 #include <mln/util/tree_to_fast.hh>
28 #include <mln/util/tree_fast.hh>
29 
30 int main ()
31 {
32  using namespace mln;
33 
34  unsigned elt1 = 1;
35  unsigned elt2 = 2;
36  unsigned elt3 = 3;
37  unsigned elt4 = 4;
38  unsigned elt5 = 5;
39  unsigned elt6= 42;
40 
41  util::tree_node<unsigned> node(elt1);
42  util::tree_node<unsigned>* node2 = node.add_child(elt2);
43  node.add_child(elt3);
44  mln_assertion(node2);
45  node2->add_child(elt4);
46  node2->add_child(elt5);
47  util::tree_node<unsigned>* node3 = node.search(elt4);
48  mln_assertion(node3);
49  node3 = node2->search(elt1);
50  mln_assertion(!node3);
52  mln_assertion(tre);
53  tre->add_tree_up(elt6);
54  mln_assertion (tre->check_consistency());
55 
56 
58  mln_assertion(tree_fast.has (elt1));
59  mln_assertion(tree_fast.has (elt2));
60  mln_assertion(tree_fast.has (elt3));
61  mln_assertion(tree_fast.has (elt4));
62  mln_assertion(tree_fast.has (elt5));
63  mln_assertion(tree_fast.has (elt6));
64  mln_assertion(tree_fast.search(elt6) == tree_fast.root_);
65 }