concurrency::DataNode Class Reference

#include <src/PrecedenceRulesGraph.h>

Collaboration diagram for concurrency::DataNode:

Public Member Functions
	DataNode (PrecedenceRulesGraph &graph, const DataObjID &path)
	Constructor. More...
	~DataNode ()
	Destructor. More...
const DataObjID &	getPath ()
bool	accept (IGraphVisitor &visitor)
	Entry point for a visitor. More...
void	addProducerNode (AlgorithmNode *node)
	Associate an AlgorithmNode, which is a data supplier for this one. More...
void	addConsumerNode (AlgorithmNode *node)
	Associate an AlgorithmNode, which is a data consumer of this one. 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
PrecedenceRulesGraph *	m_graph

Private Attributes
DataObjID	m_data_object_path
std::vector< AlgorithmNode * >	m_producers
std::vector< AlgorithmNode * >	m_consumers

Detailed Description

Definition at line 246 of file PrecedenceRulesGraph.h.

Constructor & Destructor Documentation

concurrency::DataNode::DataNode ( PrecedenceRulesGraph &  graph, const DataObjID &  path  )

inline

Constructor.

Definition at line 249 of file PrecedenceRulesGraph.h.

: m_graph(&graph), m_data_object_path(path) {}

concurrency::DataNode::~DataNode ( )

inline

Destructor.

Definition at line 251 of file PrecedenceRulesGraph.h.

{}

Member Function Documentation

bool concurrency::DataNode::accept ( IGraphVisitor &  visitor )

inline

Entry point for a visitor.

Definition at line 254 of file PrecedenceRulesGraph.h.

                                        {
      if (visitor.visitEnter(*this))
        return visitor.visit(*this);
      return true;
    }

void concurrency::DataNode::addConsumerNode ( AlgorithmNode *  node )

inline

Associate an AlgorithmNode, which is a data consumer of this one.

Definition at line 265 of file PrecedenceRulesGraph.h.

                                              {
      if (std::find(m_consumers.begin(),m_consumers.end(),node) == m_consumers.end())
        m_consumers.push_back(node);
    }

void concurrency::DataNode::addProducerNode ( AlgorithmNode *  node )

inline

Associate an AlgorithmNode, which is a data supplier for this one.

Definition at line 260 of file PrecedenceRulesGraph.h.

                                              {
      if (std::find(m_producers.begin(),m_producers.end(),node) == m_producers.end())
        m_producers.push_back(node);
    }

const std::vector<AlgorithmNode*>& concurrency::DataNode::getConsumers ( ) const

inline

Get all data object consumers.

Definition at line 272 of file PrecedenceRulesGraph.h.

{return m_consumers;}

const DataObjID& concurrency::DataNode::getPath ( )

inline

Definition at line 252 of file PrecedenceRulesGraph.h.

{return m_data_object_path;}

const std::vector<AlgorithmNode*>& concurrency::DataNode::getProducers ( ) const

inline

Get all data object producers.

Definition at line 270 of file PrecedenceRulesGraph.h.

{return m_producers;}

Member Data Documentation

std::vector<AlgorithmNode*> concurrency::DataNode::m_consumers

private

Definition at line 278 of file PrecedenceRulesGraph.h.

DataObjID concurrency::DataNode::m_data_object_path

private

Definition at line 276 of file PrecedenceRulesGraph.h.

PrecedenceRulesGraph* concurrency::DataNode::m_graph

Definition at line 274 of file PrecedenceRulesGraph.h.

std::vector<AlgorithmNode*> concurrency::DataNode::m_producers

private

Definition at line 277 of file PrecedenceRulesGraph.h.

---

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

• GaudiHive/src/PrecedenceRulesGraph.h