PRGraphVisitors.h

Go to the documentation of this file.

#ifndef PRGRAPHVISITORS_H_
#define PRGRAPHVISITORS_H_

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

namespace concurrency {

  class DataReadyPromoter : public IGraphVisitor {
  public:
    DataReadyPromoter( EventSlot& slot, const Cause& cause, bool ifTrace = false )
        : m_slot( &slot ), m_cause( cause ), m_trace( ifTrace ){};

    using IGraphVisitor::visit;
    using IGraphVisitor::visitEnter;

    bool visitEnter( AlgorithmNode& ) const override;

    bool visit( AlgorithmNode& ) override;

    bool visitEnter( DataNode& ) const override;

    bool visit( DataNode& ) override;

    bool visitEnter( ConditionNode& ) const override;

    bool visit( ConditionNode& ) override;

    EventSlot* m_slot;
    Cause      m_cause;
    bool       m_trace;
  };

  class DecisionUpdater : public IGraphVisitor {
  public:
    DecisionUpdater( EventSlot& slot, const Cause& cause, bool ifTrace = false )
        : m_slot( &slot ), m_cause( cause ), m_trace( ifTrace ){};

    using IGraphVisitor::visit;

    bool visit( AlgorithmNode& ) override;

    EventSlot* m_slot;
    Cause      m_cause;
    bool       m_trace;
  };

  class Supervisor : public IGraphVisitor {
  public:
    Supervisor( EventSlot& slot, const Cause& cause, bool ifTrace = false )
        : m_slot( &slot ), m_cause( cause ), m_trace( ifTrace ){};

    using IGraphVisitor::visit;
    using IGraphVisitor::visitEnter;

    bool visitEnter( DecisionNode& ) const override;

    bool visit( DecisionNode& ) override;

    bool visitEnter( AlgorithmNode& ) const override;

    bool visit( AlgorithmNode& ) override;

    EventSlot* m_slot;
    Cause      m_cause;
    bool       m_trace;
  };

  class RankerByProductConsumption : public IGraphVisitor {
  public:
    using IGraphVisitor::visit;

    bool visit( AlgorithmNode& ) override;
  };

  class RankerByCummulativeOutDegree : public IGraphVisitor {
  public:
    using IGraphVisitor::visit;

    bool visit( AlgorithmNode& ) override;
    void reset() override { m_nodesSucceeded = 0; };

    void runThroughAdjacents( boost::graph_traits<precedence::PrecTrace>::vertex_descriptor, precedence::PrecTrace );

    int m_nodesSucceeded{0};
  };

  class RankerByTiming : public IGraphVisitor {
  public:
    using IGraphVisitor::visit;

    bool visit( AlgorithmNode& ) override;
  };

  class RankerByEccentricity : public IGraphVisitor {
  public:
    using IGraphVisitor::visit;

    bool visit( AlgorithmNode& ) override;
  };

  class RankerByDataRealmEccentricity : public IGraphVisitor {
  public:
    using IGraphVisitor::visit;

    bool visit( AlgorithmNode& ) override;

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

    void recursiveVisit( AlgorithmNode& );

    uint m_currentDepth{0};
    uint m_maxKnownDepth{0};
  };

  class RunSimulator : public IGraphVisitor {
  public:
    RunSimulator( EventSlot& slot, const Cause& cause ) : m_slot( &slot ), m_cause( cause ){};

    using IGraphVisitor::visit;
    using IGraphVisitor::visitEnter;

    bool visitEnter( DecisionNode& ) const override;

    bool visit( DecisionNode& ) override;

    bool visitEnter( AlgorithmNode& ) const override;

    bool visit( AlgorithmNode& ) override;

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

    EventSlot* m_slot;
    Cause      m_cause;
    int        m_nodesSucceeded{0};
  };
} // namespace concurrency

#endif /* PRGRAPHVISITORS_H_ */