Node.cpp

#include "Node.h"
#include "Rule.h"
#include "SequiturGrammar.h"
#include <iostream>

Node::Node(Rule* rule, int symbol) :
rule(rule),
symbol(symbol){}

bool Node::isGuard() {
  return this->symbol == -1;
}

int Node::hashCode() { // Same as craig's implementation
  int combined = ((this->symbol << 16) | (this->symbol >> 16)) ^ (this->next->symbol);
  return (combined * (combined + 3));
}

bool Node::digramOverlap(Node* other) {
  return this->next == other || this->prev == other;
}

void Node::connect(Node* other) {
  this->next = other;
  other->prev = this;
}

void Node::printRule() {
  Node* guard = this;
  while (!guard->isGuard()) guard=guard->next;
  std::cout << "RULE USAGE=" << guard->rule->usage << ", ";
  std::cout << guard->rule->symbol;
  std::cout << " -> ";
  Node* t = guard->next;
  while (!t->isGuard()) {
    if (t->symbol<this->rule->grammar->M)
      std::cout <<  (char)t->symbol<< " ";
    else {
      std::cout <<  t->symbol<< " ";
    }
    t = t->next;
  }
  std::cout << std::endl;
}

void Node::printDigram() {
  if (this->symbol < this->rule->grammar->M)
    std::cout << (char)this->symbol << ",";
  else
    std::cout << this->symbol << ",";

  if (this->next->symbol < this->rule->grammar->M)
    std::cout << (char)this->next->symbol << std::endl;
  else
    std::cout << this->next->symbol << std::endl;
}