$extrastylesheet
Olena  User documentation 2.1
An Image Processing Platform
 All Classes Namespaces Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
branch_iter_ind.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/core/image/image2d.hh>
27 #include <mln/util/tree.hh>
28 #include <mln/util/branch_iter_ind.hh>
29 
30 int main()
31 {
32  using namespace mln;
33 
35  util::tree<int> t(&n);
36  util::tree_node<int>* f = n.add_child(21);
37  util::tree_node<int>* g = f->add_child(31);
38 
39  f->add_child(32);
40  g->add_child(41)->add_child(51)->add_child(61)->add_child(71)
41  ->add_child(81)->add_child(91);
42  g->add_child(42);
43  f->add_child(33);
44  f->add_child(34);
45  n.add_child(22);
46 
47  util::branch<int> b(t, n);
48 
49  std::vector< util::tree_node<int>* >::iterator it;
51 
52  int prev;
53  int current;
54  for(p.start(), prev = util::tree_node<int>(p).elt(), p.next();
55  p.is_valid();
56  prev = util::tree_node<int>(p).elt(), p.next())
57  {
58  current = util::tree_node<int>(p).elt ();
59 
60  // children
61  if (prev + 10 == current)
62  continue;
63 
64  // brother
65  if (prev + 1 == current)
66  continue;
67 
68  // parent
69  if (prev > current)
70  continue;
71 
72  mln_assertion (false);
73  }
74 
75 }