tree-node.h

Go to the documentation of this file.

// Copyright 2007, Massachusetts Institute of Technology.
// The use of this code is permitted for research only. There is
// absolutely no warranty for this software.
//
// Author: John Lee (jjl@mit.edu)
//

#ifndef UTIL_TREE_NODE_H
#define UTIL_TREE_NODE_H

#include <iostream>
#include "util/sparse-vector.h"

using namespace std;

namespace libpmk {


class TreeNode {
 public:
   TreeNode();

   TreeNode(const LargeIndex& index);


   TreeNode(const TreeNode& other);

   virtual ~TreeNode();

   const LargeIndex& GetIndex() const;
   TreeNode* GetParent();
   TreeNode* GetPreviousSibling();
   TreeNode* GetNextSibling();
   TreeNode* GetFirstChild();
   TreeNode* GetLastChild();

   void SetParent(TreeNode* parent);
   void SetPreviousSibling(TreeNode* sibling);
   void SetNextSibling(TreeNode* sibling);
   void SetFirstChild(TreeNode* child);
   void SetLastChild(TreeNode* child);
   void SetIndex(const LargeIndex& index);

   bool HasParent() const;
   bool HasPreviousSibling() const;
   bool HasNextSibling() const;
   bool HasChild() const;
   

   void ReadFromStream(istream& input_stream);


   void WriteToStream(ostream& output_stream) const;

   virtual void Combine(const TreeNode& other) = 0;

   bool operator<(const TreeNode& other) const;

   static bool CompareNodes(const TreeNode* one, const TreeNode* two);

 protected:
   virtual void ReadData(istream& input_stream) = 0;

   virtual void WriteData(ostream& output_stream) const = 0;
 private:
   LargeIndex index_;
   TreeNode* parent_;
   TreeNode* next_sibling_;
   TreeNode* previous_sibling_;
   TreeNode* first_child_;
   TreeNode* last_child_;
};
}  // namespace libpmk
#endif  // UTIL_TREE_NODE_H

---