accept(IGraphVisitor &visitor) override | concurrency::AlgorithmNode | virtual |
addInputDataNode(DataNode *node) | concurrency::AlgorithmNode | |
addOutputDataNode(DataNode *node) | concurrency::AlgorithmNode | |
addParentNode(DecisionNode *node) | concurrency::AlgorithmNode | |
AlgorithmNode(PrecedenceRulesGraph &graph, Gaudi::Algorithm *algoPtr, unsigned int nodeIndex, unsigned int algoIndex) | concurrency::AlgorithmNode | inline |
ControlFlowNode(PrecedenceRulesGraph &graph, unsigned int nodeIndex, const std::string &name) | concurrency::ControlFlowNode | inline |
getAlgoIndex() const | concurrency::AlgorithmNode | inline |
getAlgorithm() const | concurrency::AlgorithmNode | inline |
getInputDataNodes() const | concurrency::AlgorithmNode | inline |
getNodeIndex() const | concurrency::ControlFlowNode | inline |
getOutputDataNodes() const | concurrency::AlgorithmNode | inline |
getParentDecisionHubs() const | concurrency::AlgorithmNode | inline |
getRank() const | concurrency::AlgorithmNode | inline |
isAsynchronous() const | concurrency::AlgorithmNode | inline |
m_algoIndex | concurrency::AlgorithmNode | private |
m_algoName | concurrency::AlgorithmNode | private |
m_algorithm | concurrency::AlgorithmNode | private |
m_graph | concurrency::ControlFlowNode | |
m_inputs | concurrency::AlgorithmNode | private |
m_isAsynchronous | concurrency::AlgorithmNode | private |
m_nodeIndex | concurrency::ControlFlowNode | protected |
m_nodeName | concurrency::ControlFlowNode | protected |
m_outputs | concurrency::AlgorithmNode | private |
m_parents | concurrency::AlgorithmNode | |
m_rank | concurrency::AlgorithmNode | private |
name() const | concurrency::ControlFlowNode | inline |
printState(std::stringstream &output, EventSlot &slot, const unsigned int &recursionLevel) const override | concurrency::AlgorithmNode | virtual |
setAsynchronous(bool value) | concurrency::AlgorithmNode | inline |
setRank(float rank) | concurrency::AlgorithmNode | inline |
~ControlFlowNode()=default | concurrency::ControlFlowNode | virtual |