StateNode.hh

Go to the documentation of this file.

class StateNode
{
public:
  StateNode * next;
  StateNode * down;
  State state;
  StateNode():next(0),down(0),state() {}
};
  

class StateTable
{
private:
  StateNode * root;
public:
  StateTable():root(0){}
  void insert(const vector<State> & states, State synchronisedState);
  State getSynchronisedState(const  vector<State> & states) const;
};



void StateTable::insert(const vector<State> & states, State synchronisedState)
{
  StateNode * current;
  vector<State>::size_type index = 0;
  if(root == 0)
        {
          current = new StateNode();
          current->state = states[index];
        }

  while(index != states.size()-1)
        {
          if(current->state == states[index])
                {
                  if(current->down == 0)
                        {
                          current->down = new StateNode();
                          current->down->state = states[index+1];
                        }
                  current = current->down;
                  ++index;
                }
          else
                {
                  if(current->state.id() < states[index].id())
                        {
                          if(current->next == 0)
                                {
                                  current->next =  new StateNode();
                                  current->next->state = states[index];
                                }
                          current = current->next;
                        }
                  else
                        {
                          // current->state.id() > states[index].id()
                          StateNode * newNode = new StateNode();
                          newNode->state = current->state;
                          newNode->next  = current->next;
                          newNode->down  = current->down;
                          current->state = states[index];
                        }
                }
        }
  if(current->down == 0)
        {
          current->down = new StateNode();
          current->down->state = synchronisedState;
        }
}


 
State StateTable::getSynchronisedState(const  vector<State> & states)
{
  State result;
  if(root != 0)
        {
          StateNode * current = root;
          vector<State>::size_type index = 0;
          bool exit = false;
          while(!exit  && (index != states.size()))
                {
                  if(current->state == states[index])
                        {
                          if(current->down != 0)
                                {
                                  current = current->down;
                                  ++index;
                                }
                          else
                                {
                                  assertion(StateNodeInvalid, index != states.size(), "getSynchronisedState: the synchronised state of the visited state is not there");
                                  exit = true;
                                }
                        }
                  else
                        {
                          if(current->state.id() < states[index].id())
                                {
                                  if(current->next != 0)
                                        {
                                          current = current->next;
                                        }
                                  else
                                        {
                                          exit =true;
                                        }
                                }
                          else
                                {
                                  // current->state.id() > states[index].id()
                                  exit = true;
                                }
                        }
                }
          if(index = states.size() )
                {
                  result = current->state;
                }
        }
  return result;
}