PRGraphVisitors.h

Go to the documentation of this file.

#ifndef PRGRAPHVISITORS_H_
#define PRGRAPHVISITORS_H_

#include "IGraphVisitor.h"
#include "PrecedenceRulesGraph.h"

namespace concurrency {

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

    bool visitEnter(DecisionNode& node) const override;

    bool visit(DecisionNode& node) override;

    bool visitLeave(DecisionNode& node) const override;


    bool visitEnter(AlgorithmNode& node) const override;

    bool visit(AlgorithmNode& node) override;


    void reset() override { m_nodesSucceeded = 0; }

  };

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

      bool visitEnter(DecisionNode& node) const override;

      bool visit(DecisionNode& node) override;

      bool visitLeave(DecisionNode& /*node*/) const override {return true;};


      bool visitEnter(AlgorithmNode& node) const override;

      bool visit(AlgorithmNode& node) override;


      void reset() override { m_nodesSucceeded = 0; }

    };


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

      bool visitEnter(DecisionNode& node) const override;

      bool visit(DecisionNode& node) override;

      bool visitLeave(DecisionNode& /*node*/) const override {return true;};


      bool visitEnter(AlgorithmNode& node) const override;

      bool visit(AlgorithmNode& node) override;


      void reset() override { m_nodesSucceeded = 0; }

    };

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

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

      bool visit(DecisionNode&) override {return true;}\

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


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

      bool visit(AlgorithmNode& node) override;


      void reset() override { m_nodesSucceeded = 0; }

      };

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

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

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

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


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

      bool visit(AlgorithmNode& node) override;


      void reset() override { 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;
      };
      ~RankerByTiming() override {}

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

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

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


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

      bool visit(AlgorithmNode& node) override;


      void reset() override { m_nodesSucceeded = 0; }

      };

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

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

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

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


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

      bool visit(AlgorithmNode& node) override;


      void reset() override { m_nodesSucceeded = 0; }

      };

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

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

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

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


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

      bool visit(AlgorithmNode& node) override;


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

      void recursiveVisit(AlgorithmNode& node);

      uint m_currentDepth;
      uint m_maxKnownDepth;

      };

}



#endif /* PRGRAPHVISITORS_H_ */