nodeAndRanks.h

Go to the documentation of this file.

#ifndef _NODE_AND_RANKS_H_
#define _NODE_AND_RANKS_H_

#include <vector>
#include "TreeNode.h"

namespace ot {

  class NodeAndRanks {
    public:

      ot::TreeNode node; 
      std::vector<int> ranks; 
      bool operator == ( NodeAndRanks  const & other)  const{
        return ((this->node) == other.node);
      }//end fn.

      bool operator != ( NodeAndRanks const  & other)  const{
        return ((this->node) != other.node);
      }//end fn.

      bool operator  < ( NodeAndRanks  const & other)  const{
        return ((this->node) < other.node);
      }//end function

      bool operator  <= ( NodeAndRanks  const  & other)  const{
        return ((this->node) <= other.node);
      }//end fn.

      bool operator  > ( NodeAndRanks const  & other)  const{
        return ((this->node) > other.node);
      }//end fn.

      bool operator  >= ( NodeAndRanks  const & other)  const{    
        return ((this->node) >= other.node);
      }//end fn.

      //Asignment Operator
      NodeAndRanks & operator = ( NodeAndRanks const & other) {
        if(this == (&other)) {return *this;}    
        this->node = other.node;
        this->ranks = other.ranks;    
        return *this;
      }//end fn.


      NodeAndRanks () {      }

      //copy constructor        
      NodeAndRanks  (const NodeAndRanks  &other) {
        node = other.node;
        ranks = other.ranks;    
      }

  };

}//end namespace


#endif

---