node.cpp

Go to the documentation of this file.

#include "hpp/node.hpp"
 
 
template <class X1>
inline 
void node<X1>::data_on_path(std::vector< data_addr > & vec) const{
  node<X1> const* ptr = this;
  vec.clear();
  while(ptr){
    if( !isNULLit(ptr->d_iterator) ){
      vec.push_back(ptr->d_iterator);
    }  
    ptr = ptr->parent;
  }
}
 
template <class X1>
inline 
void node<X1>::add_new_node( data_addr const & pos ){
  #ifdef MAX_CMMTree_NODES
    #ifdef NODE_COUNTER
      if( n_count == MAX_CMMTree_NODES) 
        throw std::runtime_error( "node<X1>::add_new_node():\nThe number of nodes has reached an acceptable value of \"MAX_CMMTree_NODES = " + std::to_string(MAX_CMMTree_NODES) + "\".");
    #else
      throw std::runtime_error( "node<X1>::add_new_node():\nYou have decided to use the constant \"MAX_CMMTree_NODES = " + std::to_string(MAX_CMMTree_NODES) + "\".\nPlease uncomment the \"NODE_COUNTER\" directive and recompile the program."); 
    #endif 
  #endif 
 
  if(!children){
    children = new std::vector< node<X1>* >(1);
    (*children)[0] = new node<X1>(this, pos);
  }
  else{
    children->emplace_back( new node<X1>( this, pos ) );
  }  
}
 
template <class X1>
inline node<X1>::~node(){
  if(children){
    for(size_t i = 0; i< children->size(); ++i)
      delete (*children)[i]; 
    delete children;
  }
  #ifdef NODE_COUNTER
    n_count--;
  #endif
}
 
template <class X1>
inline size_t node<X1>::node_level() const {
  size_t lev(0); node<X1>* ptr(parent);
  while(ptr){
    lev++;
    ptr=ptr->parent;
  }
  return lev;
}
 
template <class X1>
void node<X1>::all_siblings_addresses(std::vector< const node<X1>* > & vec)const{
  if(parent){
    vec.resize(parent->children->size()) ;
    for(size_t i=0; i< vec.size(); ++i)
      vec[i] =parent->children->operator[](i);
  }
  else{
    vec.resize(1);
    vec[0] = this;
  }
}
 
template <class X1>
std::ostream& operator<<(std::ostream& out, node<X1> const& r) {
  out << '<' << typeid(r).name()      << '>';
  out << '[' << r.this_node_address() << ']';
 
  if (! r.parent_node_address() )
    out << "(root,";
  else
    out << '(' << r.parent_node_address()  << ',';
 
  out << (! r.isNULLit( r.data_address() ) ) << ','
      << r.children_number() << '|'
      << r.node_level()      << '|'
      << r.siblings_number() << ')';
 
  return out;
}