EFGraphVisitors.h

Go to the documentation of this file.

#ifndef EFGRAPHVISITORS_H_
#define EFGRAPHVISITORS_H_

#include "IGraphVisitor.h"
#include "ExecutionFlowGraph.h"

namespace concurrency {

  class RunSimulator : public IGraphVisitor {
  public:
    RunSimulator(const int& slotNum) {
      m_nodesSucceeded = 0;
      m_slotNum = slotNum;
    };
    virtual ~RunSimulator() {};

    virtual bool visitEnter(DecisionNode& node) const;

    virtual bool visit(DecisionNode& node);

    virtual bool visitLeave(DecisionNode& node) const;


    virtual bool visitEnter(AlgorithmNode& node) const;

    virtual bool visit(AlgorithmNode& node);


    virtual void reset() { m_nodesSucceeded = 0; }

  };

  class Trigger : public IGraphVisitor {
    public:
      Trigger(const int& slotNum) {
        m_nodesSucceeded = 0;
        m_slotNum = slotNum;
      };
      virtual ~Trigger() {};

      virtual bool visitEnter(DecisionNode& node) const;

      virtual bool visit(DecisionNode& node);

      virtual bool visitLeave(DecisionNode& node) const;


      virtual bool visitEnter(AlgorithmNode& node) const;

      virtual bool visit(AlgorithmNode& node);


      virtual void reset() { m_nodesSucceeded = 0; }

    };

  class RankerByProductConsumption : public IGraphVisitor {
    public:
      RankerByProductConsumption() {
        m_nodesSucceeded = 0;
        m_slotNum = -1;
      };
      virtual ~RankerByProductConsumption() {};

      virtual bool visitEnter(DecisionNode&) const {return true;};

      virtual bool visit(DecisionNode&) {return true;};

      virtual bool visitLeave(DecisionNode&) const {return true;};


      virtual bool visitEnter(AlgorithmNode&) const {return true;};

      virtual bool visit(AlgorithmNode& node);


      virtual void reset() { m_nodesSucceeded = 0; }

      };

  class RankerByCummulativeOutDegree : public IGraphVisitor {
    public:
      RankerByCummulativeOutDegree() {
        m_nodesSucceeded = 0;
        m_slotNum = -1;
      };
      virtual ~RankerByCummulativeOutDegree() {};

      virtual bool visitEnter(DecisionNode&) const {return true;};

      virtual bool visit(DecisionNode&) {return true;};

      virtual bool visitLeave(DecisionNode&) const {return true;};


      virtual bool visitEnter(AlgorithmNode&) const {return true;};

      virtual bool visit(AlgorithmNode& node);


      virtual void reset() { m_nodesSucceeded = 0; }

      void runThroughAdjacents(boost::graph_traits<boost::ExecPlan>::vertex_descriptor vertex, boost::ExecPlan graph);

      };

  class RankerByTiming : public IGraphVisitor {
    public:
      RankerByTiming() {
        m_nodesSucceeded = 0;
        m_slotNum = -1;
      };
      virtual ~RankerByTiming() {};

      virtual bool visitEnter(DecisionNode&) const {return true;};

      virtual bool visit(DecisionNode&) {return true;};

      virtual bool visitLeave(DecisionNode&) const {return true;};


      virtual bool visitEnter(AlgorithmNode&) const {return true;};

      virtual bool visit(AlgorithmNode& node);


      virtual void reset() { m_nodesSucceeded = 0; }

      };

  class RankerByEccentricity : public IGraphVisitor {
    public:
      RankerByEccentricity() {
        m_nodesSucceeded = 0;
        m_slotNum = -1;
      };
      virtual ~RankerByEccentricity() {};

      virtual bool visitEnter(DecisionNode&) const {return true;};

      virtual bool visit(DecisionNode&) {return true;};

      virtual bool visitLeave(DecisionNode&) const {return true;};


      virtual bool visitEnter(AlgorithmNode&) const {return true;};

      virtual bool visit(AlgorithmNode& node);


      virtual void reset() { m_nodesSucceeded = 0; }

      };

  class RankerByDataRealmEccentricity : public IGraphVisitor {
    public:
      RankerByDataRealmEccentricity() {
        m_nodesSucceeded = 0;
        m_slotNum = -1;
        m_currentDepth = 0;
        m_maxKnownDepth = 0;
      };
      virtual ~RankerByDataRealmEccentricity() {};

      virtual bool visitEnter(DecisionNode&) const {return true;};

      virtual bool visit(DecisionNode&) {return true;};

      virtual bool visitLeave(DecisionNode&) const {return true;};


      virtual bool visitEnter(AlgorithmNode&) const {return true;};

      virtual bool visit(AlgorithmNode& node);


      virtual void reset() {
        m_nodesSucceeded = 0;
        m_currentDepth = 0;
        m_maxKnownDepth = 0;
      }

      void recursiveVisit(AlgorithmNode& node);

      uint m_currentDepth;
      uint m_maxKnownDepth;

      };

}



#endif /* EFGRAPHVISITORS_H_ */