/home/laradmin/lar/perception/planarobstacles/mtt/include/mtt/tree_util.hh

Go to the documentation of this file.

#ifndef tree_util_hh_
#define tree_util_hh_

#include <iostream>
#include "tree.hh"

namespace kptree {

template<class T>
void print_tree_bracketed(const tree<T>& t, std::ostream& str=std::cout);

template<class T>
void print_subtree_bracketed(const tree<T>& t, typename tree<T>::iterator iRoot, 
                                                                          std::ostream& str=std::cout);



// Iterate over all roots (the head) and print each one on a new line
// by calling printSingleRoot.

template<class T>
void print_tree_bracketed(const tree<T>& t, std::ostream& str) 
        {
                std::cout<<std::endl;
        int headCount = t.number_of_siblings(t.begin());
        int headNum = 0;
        for(typename tree<T>::sibling_iterator iRoots = t.begin(); iRoots != t.end(); ++iRoots, ++headNum) {
                print_subtree_bracketed(t,iRoots,str);
                if (headNum != headCount) {
                        str << std::endl;
                        }
                }
                
                std::cout<<std::endl;
        }


// Print everything under this root in a flat, bracketed structure.

template<class T>
void print_subtree_bracketed(const tree<T>& t, typename tree<T>::iterator iRoot, std::ostream& str) 
        {
        if(t.empty()) return;
        if (t.number_of_children(iRoot) == 0) {
                str << *iRoot;  
                }
        else {
                // parent
                str << *iRoot;
                str << "(";
                // child1, ..., childn
                int siblingCount = t.number_of_siblings(t.begin(iRoot));
                int siblingNum;
                typename tree<T>::sibling_iterator iChildren;
                for (iChildren = t.begin(iRoot), siblingNum = 0; iChildren != t.end(iRoot); ++iChildren, ++siblingNum) {
                        // recursively print child
                        print_subtree_bracketed(t,iChildren,str);
                        // comma after every child except the last one
                        if (siblingNum != siblingCount ) {
                                str << ", ";
                                }
                        }
                str << ")";
                }
        }

}

#endif

---

mtt
Author(s): Jorge Almeida
autogenerated on Wed Jul 23 04:34:56 2014