00001 // Copyright (C) 2007, 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/util/tree_fast.hh> 00027 00028 int main () 00029 { 00030 using namespace mln; 00031 00032 unsigned elt1 = 1; 00033 unsigned elt2 = 2; 00034 unsigned elt3 = 3; 00035 unsigned elt4 = 4; 00036 unsigned elt5 = 5; 00037 unsigned elt6= 42; 00038 00039 util::tree_fast<unsigned> tree_fast(elt1); 00040 mln_assertion(tree_fast.has (elt1)); 00041 tree_fast.add_child(tree_fast.search(elt1), elt2); 00042 mln_assertion(tree_fast.has (elt2)); 00043 tree_fast.add_child(tree_fast.search(elt1), elt3); 00044 mln_assertion(tree_fast.has (elt3)); 00045 tree_fast.add_child(tree_fast.search(elt2), elt4); 00046 mln_assertion(tree_fast.has (elt4)); 00047 tree_fast.add_child(tree_fast.search(elt2), elt5); 00048 mln_assertion(tree_fast.has (elt5)); 00049 tree_fast.add_parent(elt6); 00050 mln_assertion(tree_fast.has (elt6)); 00051 mln_assertion(tree_fast.search(elt6) == tree_fast.root_); 00052 }
1.7.1