all_class.h

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <list>
#include <set>

using namespace std;

enum STATUS { IN, OUT};

class NODE
{
  string label;
  vector<string> in, out; // Could change to set<string> to speed up search, although with costlier insertion, insertion happens only once
  int height;
  enum STATUS status;
  bool propogate_reached;
public:
  NODE( string _label )
  {
    label = _label;
  }
  NODE( string _label, enum STATUS _status, vector<string> _in, vector<string> _out )
  {
    label = _label;
    status = _status;
    in = _in; // try std::move ?
    out = _out;
  }
  bool operator<( NODE other ) const
  {
    return label < other.label;
  }
  bool operator==( NODE other ) const
  {
    return label == other.label;
  }
  vector<string> ret_in() const
  {
    return in;
  }
  vector<string> ret_out() const
  {
    return out;
  }
  bool isIn_in( string in_just ) const
  {
    return (find( in.begin(), in.end(), in_just )!=in.end());
  }
  bool isIn_out( string out_just ) const
  {
    return (find( out.begin(), out.end(), out_just )!=out.end());
  }
  void propogate_initialise()
  {
    propogate_reached = false;
  }
  void added_to_heap()
  {
    propogate_reached = true;
  }
  bool is_added_to_heap() const
  {
    return propogate_reached;
  }
  string ret_label() const
  {
    return label;
  }
  int ret_height() const
  {
    return height;
  }
  enum STATUS ret_status() const
  {
    return status;
  }
  void eval_height();    // Finds the height of the node based on its justifications
  void eval_status();
  bool chk_crculr();    // Check for circularities
  vector<string> chk_exist_just();// Check if the justifications exist, return those that don't exist
  friend class PropNODE;
};

set<NODE> nodes;

class PropNODE
{
  NODE *it;
public:
  bool operator<( PropNODE other ) const
  {
    return it->height < other.it->height;
    /* Since going to be using a sorted, the one with the least height should be first */
  }
  PropNODE( NODE* it_ )
  {
    it = it_;
  }
  friend void propogate( NODE *proponent );
};

void propogate( NODE *proponent );

bool is_KEYWORD();
void handle_IS();
bool handle_STATE( string &label, vector<string> &in, vector<string> &out, enum STATUS &status );
void handle_LIST();
void handle_HELP();