Milena (Olena)
User documentation 2.0a Id
|
00001 // Copyright (C) 2007, 2008, 2009 EPITA Research and Development Laboratory (LRDE) 00002 // 00003 // This file is part of Olena. 00004 // 00005 // Olena is free software: you can redistribute it and/or modify it under 00006 // the terms of the GNU General Public License as published by the Free 00007 // Software Foundation, version 2 of the License. 00008 // 00009 // Olena is distributed in the hope that it will be useful, 00010 // but WITHOUT ANY WARRANTY; without even the implied warranty of 00011 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00012 // General Public License for more details. 00013 // 00014 // You should have received a copy of the GNU General Public License 00015 // along with Olena. If not, see <http://www.gnu.org/licenses/>. 00016 // 00017 // As a special exception, you may use this file as part of a free 00018 // software project without restriction. Specifically, if other files 00019 // instantiate templates or use macros or inline functions from this 00020 // file, or you compile this file and link it with other files to produce 00021 // an executable, this file does not by itself cause the resulting 00022 // executable to be covered by the GNU General Public License. This 00023 // exception does not however invalidate any other reasons why the 00024 // executable file might be covered by the GNU General Public License. 00025 00026 #include <mln/core/image/image2d.hh> 00027 #include <mln/util/tree.hh> 00028 #include <mln/util/branch_iter_ind.hh> 00029 00030 int main() 00031 { 00032 using namespace mln; 00033 00034 util::tree_node<int> n(11); 00035 util::tree<int> t(&n); 00036 util::tree_node<int>* f = n.add_child(21); 00037 util::tree_node<int>* g = f->add_child(31); 00038 00039 f->add_child(32); 00040 g->add_child(41)->add_child(51)->add_child(61)->add_child(71) 00041 ->add_child(81)->add_child(91); 00042 g->add_child(42); 00043 f->add_child(33); 00044 f->add_child(34); 00045 n.add_child(22); 00046 00047 util::branch<int> b(t, n); 00048 00049 std::vector< util::tree_node<int>* >::iterator it; 00050 util::branch_iter_ind<int> p(b); 00051 00052 int prev; 00053 int current; 00054 for(p.start(), prev = util::tree_node<int>(p).elt(), p.next(); 00055 p.is_valid(); 00056 prev = util::tree_node<int>(p).elt(), p.next()) 00057 { 00058 current = util::tree_node<int>(p).elt (); 00059 00060 // children 00061 if (prev + 10 == current) 00062 continue; 00063 00064 // brother 00065 if (prev + 1 == current) 00066 continue; 00067 00068 // parent 00069 if (prev > current) 00070 continue; 00071 00072 mln_assertion (false); 00073 } 00074 00075 }