sparse-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 TREE_SPARSE_TREE_NODE_H
#define TREE_SPARSE_TREE_NODE_H

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

using namespace std;

namespace libpmk {


class SparseTreeNode {
public:
  SparseTreeNode();

  SparseTreeNode(const LargeIndex& index);


  SparseTreeNode(const SparseTreeNode& other);

  virtual ~SparseTreeNode();

  const LargeIndex& index() const { return index_; }
  SparseTreeNode* parent() { return parent_; }
  SparseTreeNode* prev_sibling() { return previous_sibling_; }
  SparseTreeNode* next_sibling() { return next_sibling_; }
  SparseTreeNode* first_child() { return first_child_; }
  SparseTreeNode* last_child() { return last_child_; }

  void set_parent(SparseTreeNode* parent) { parent_ = parent; }
  void set_prev_sibling(SparseTreeNode* sibling) {
    previous_sibling_ = sibling;
  }
  void set_next_sibling(SparseTreeNode* sibling) { next_sibling_ = sibling; }
  void set_first_child(SparseTreeNode* child) { first_child_ = child; }
  void set_last_child(SparseTreeNode* child) { last_child_ = child; }
  void set_index(const LargeIndex& index) { index_ = index; }

  bool has_parent() const { return parent_ != NULL; }
  bool has_prev_sibling() const { return previous_sibling_ != NULL; }
  bool has_next_sibling() const { return next_sibling_ != NULL; }
  bool has_child() const { return first_child_ != NULL; }
   

  void ReadFromStream(istream& input_stream);


  void WriteToStream(ostream& output_stream) const;

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

  bool operator<(const SparseTreeNode& other) const;

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

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

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

#endif  // TREE_SPARSE_TREE_NODE_H

---