4 #include "../../EventSlot.h" 5 #include "../PrecedenceRulesGraph.h" 37 : m_slot( slot ), m_startNode( node ), m_previousNodeName( node.getNodeName() ){};
50 m_previousNodeName = m_startNode.getNodeName();
53 virtual bool reply()
const {
return m_active; };
69 :
ActiveLineageScout( slot, node ), m_foundEntryPoint( slot->parentSlot == nullptr ){};
75 m_foundEntryPoint = ( m_slot->parentSlot == nullptr );
76 m_previousNodeName = m_startNode.getNodeName();
79 bool reply()
const override {
return m_active && m_foundEntryPoint; };
84 bool m_foundEntryPoint{
true};
const ControlFlowNode & m_startNode
std::string reply() const
Class representing an event slot.
bool visitEnter(ConditionNode &) const override
SubSlotScout(const EventSlot *slot, const ControlFlowNode &node)
Constructor.
bool visit(DecisionNode &) override
ActiveLineageScout(const EventSlot *slot, const ControlFlowNode &node)
Constructor.
virtual bool visit(DecisionNode &)
bool reply() const override
bool visitEnter(DataNode &) const override
bool visitEnter(ConditionNode &) const override
virtual bool visitEnter(DecisionNode &) const
std::ostringstream m_status
bool visitEnter(AlgorithmNode &) const override
std::string m_previousNodeName
bool visitEnter(DataNode &) const override
virtual bool reply() const
bool visitEnter(AlgorithmNode &) const override