The Gaudi Framework  master (594c33fa)
concurrency::ControlFlowNode Class Referenceabstract

#include </builds/gaudi/Gaudi/GaudiHive/src/PRGraph/PrecedenceRulesGraph.h>

Inheritance diagram for concurrency::ControlFlowNode:
Collaboration diagram for concurrency::ControlFlowNode:

Public Member Functions

 ControlFlowNode (PrecedenceRulesGraph &graph, unsigned int nodeIndex, const std::string &name)
 Constructor. More...
 
virtual ~ControlFlowNode ()=default
 Destructor. More...
 
virtual bool accept (IGraphVisitor &visitor)=0
 Visitor entry point. More...
 
virtual void printState (std::stringstream &output, EventSlot &slot, const unsigned int &recursionLevel) const =0
 Print a string representing the control flow state. More...
 
const unsigned int & getNodeIndex () const
 Get node index. More...
 
const std::stringname () const
 Get node name. More...
 

Public Attributes

PrecedenceRulesGraphm_graph
 

Protected Attributes

unsigned int m_nodeIndex
 
std::string m_nodeName
 

Detailed Description

Definition at line 412 of file PrecedenceRulesGraph.h.

Constructor & Destructor Documentation

◆ ControlFlowNode()

concurrency::ControlFlowNode::ControlFlowNode ( PrecedenceRulesGraph graph,
unsigned int  nodeIndex,
const std::string name 
)
inline

Constructor.

Definition at line 415 of file PrecedenceRulesGraph.h.

416  : m_graph( &graph ), m_nodeIndex( nodeIndex ), m_nodeName( name ) {}

◆ ~ControlFlowNode()

virtual concurrency::ControlFlowNode::~ControlFlowNode ( )
virtualdefault

Destructor.

Member Function Documentation

◆ accept()

virtual bool concurrency::ControlFlowNode::accept ( IGraphVisitor visitor)
pure virtual

Visitor entry point.

Implemented in concurrency::AlgorithmNode, and concurrency::DecisionNode.

◆ getNodeIndex()

const unsigned int& concurrency::ControlFlowNode::getNodeIndex ( ) const
inline

Get node index.

Definition at line 425 of file PrecedenceRulesGraph.h.

425 { return m_nodeIndex; }

◆ name()

const std::string& concurrency::ControlFlowNode::name ( ) const
inline

Get node name.

Definition at line 427 of file PrecedenceRulesGraph.h.

427 { return m_nodeName; }

◆ printState()

virtual void concurrency::ControlFlowNode::printState ( std::stringstream output,
EventSlot slot,
const unsigned int &  recursionLevel 
) const
pure virtual

Print a string representing the control flow state.

Implemented in concurrency::AlgorithmNode, and concurrency::DecisionNode.

Member Data Documentation

◆ m_graph

PrecedenceRulesGraph* concurrency::ControlFlowNode::m_graph

Definition at line 430 of file PrecedenceRulesGraph.h.

◆ m_nodeIndex

unsigned int concurrency::ControlFlowNode::m_nodeIndex
protected

Definition at line 433 of file PrecedenceRulesGraph.h.

◆ m_nodeName

std::string concurrency::ControlFlowNode::m_nodeName
protected

Definition at line 434 of file PrecedenceRulesGraph.h.


The documentation for this class was generated from the following file:
concurrency::ControlFlowNode::name
const std::string & name() const
Get node name.
Definition: PrecedenceRulesGraph.h:427
concurrency::ControlFlowNode::m_nodeIndex
unsigned int m_nodeIndex
Definition: PrecedenceRulesGraph.h:433
plotSpeedupsPyRoot.graph
graph
Definition: plotSpeedupsPyRoot.py:168
concurrency::ControlFlowNode::m_nodeName
std::string m_nodeName
Definition: PrecedenceRulesGraph.h:434
concurrency::ControlFlowNode::m_graph
PrecedenceRulesGraph * m_graph
Definition: PrecedenceRulesGraph.h:430