concurrency::DecisionUpdater Class Reference

#include <src/PRGraphVisitors.h>

Inheritance diagram for concurrency::DecisionUpdater:

Collaboration diagram for concurrency::DecisionUpdater:

Public Member Functions
	DecisionUpdater (EventSlot &slot)
	Constructor. More...
bool	visit (AlgorithmNode &node) override
Public Member Functions inherited from concurrency::IGraphVisitor
virtual	~IGraphVisitor ()=default
virtual bool	visitEnter (DecisionNode &) const
virtual bool	visit (DecisionNode &)
virtual bool	visitEnter (AlgorithmNode &) const
virtual bool	visitEnter (DataNode &) const
virtual bool	visit (DataNode &)
virtual void	reset ()

Additional Inherited Members
Public Attributes inherited from concurrency::IGraphVisitor
int	m_nodesSucceeded
EventSlot *	m_slot

Detailed Description

Definition at line 27 of file PRGraphVisitors.h.

Constructor & Destructor Documentation

concurrency::DecisionUpdater::DecisionUpdater ( EventSlot &  slot )

inline

Constructor.

Definition at line 30 of file PRGraphVisitors.h.

                                       {
        m_nodesSucceeded = 0;
        m_slot = &slot;
      };

Member Function Documentation

bool concurrency::DecisionUpdater::visit ( AlgorithmNode &  node )

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 50 of file PRGraphVisitors.cpp.

                                                 {

    auto& states = m_slot->algsStates;
    const State& state = states[node.getAlgoIndex()];
    int decision = -1;

    if ( true == node.isOptimist() )
      decision = 1;
    else if ( State::EVTACCEPTED == state )
      decision = !node.isLiar();
    else if ( State::EVTREJECTED == state )
      decision = node.isLiar();

    if ( -1 != decision ) {

      m_slot->controlFlowState[node.getNodeIndex()] = decision;

      auto promoter = DataReadyPromoter(*m_slot);
      for ( auto output : node.getOutputDataNodes() )
        for ( auto consumer : output->getConsumers() )
          if (State::CONTROLREADY == states[consumer->getAlgoIndex()])
            consumer->accept(promoter);

      auto vis = concurrency::Supervisor( *m_slot );
      for ( auto p : node.getParentDecisionHubs() )
        p->accept(vis);

      return true; // return true only if the algorithm produced a decision
    }

    return false;
  }

---

The documentation for this class was generated from the following files:

• GaudiHive/src/PRGraphVisitors.h
• GaudiHive/src/PRGraphVisitors.cpp