The Gaudi Framework  v29r3 (fa547fc2)
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Modules Pages
concurrency::ConditionNode Class Reference

#include <src/PrecedenceRulesGraph.h>

Inheritance diagram for concurrency::ConditionNode:
Collaboration diagram for concurrency::ConditionNode:

Public Member Functions

 ConditionNode (PrecedenceRulesGraph &graph, const DataObjID &path, SmartIF< ICondSvc > condSvc)
 Constructor. More...
 
bool accept (IGraphVisitor &visitor) override
 Need to hide the (identical) base method with this one so that visitEnter(ConditionNode&) and visit(ConditionNode&) are called. More...
 
- Public Member Functions inherited from concurrency::DataNode
 DataNode (PrecedenceRulesGraph &graph, const DataObjID &path)
 Constructor. More...
 
virtual ~DataNode ()=default
 Destructor. More...
 
const DataObjIDgetPath ()
 
void addProducerNode (AlgorithmNode *node)
 Add relationship to producer AlgorithmNode. More...
 
void addConsumerNode (AlgorithmNode *node)
 Add relationship to consumer AlgorithmNode. More...
 
const std::vector< AlgorithmNode * > & getProducers () const
 Get all data object producers. More...
 
const std::vector< AlgorithmNode * > & getConsumers () const
 Get all data object consumers. More...
 

Public Attributes

SmartIF< ICondSvcm_condSvc
 
- Public Attributes inherited from concurrency::DataNode
PrecedenceRulesGraphm_graph
 

Detailed Description

Definition at line 541 of file PrecedenceRulesGraph.h.

Constructor & Destructor Documentation

concurrency::ConditionNode::ConditionNode ( PrecedenceRulesGraph graph,
const DataObjID path,
SmartIF< ICondSvc condSvc 
)
inline

Constructor.

Definition at line 545 of file PrecedenceRulesGraph.h.

546  : DataNode( graph, path ), m_condSvc( condSvc )
547  {
548  }
DataNode(PrecedenceRulesGraph &graph, const DataObjID &path)
Constructor.

Member Function Documentation

bool concurrency::ConditionNode::accept ( IGraphVisitor visitor)
inlineoverridevirtual

Need to hide the (identical) base method with this one so that visitEnter(ConditionNode&) and visit(ConditionNode&) are called.

using DataNode::accept; ?

Reimplemented from concurrency::DataNode.

Definition at line 553 of file PrecedenceRulesGraph.h.

554  {
555  if ( visitor.visitEnter( *this ) ) return visitor.visit( *this );
556  return true;
557  }

Member Data Documentation

SmartIF<ICondSvc> concurrency::ConditionNode::m_condSvc

Definition at line 561 of file PrecedenceRulesGraph.h.


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