#include <src/ExecutionFlowGraph.h>

Collaboration diagram for concurrency::DataNode:

Public Member Functions
	DataNode (ExecutionFlowGraph &, const std::string &path)
	Constructor. More...

	~DataNode ()
	Destructor. More...

const std::string &	getPath ()

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...

Private Attributes
std::string	m_data_object_path

std::vector< AlgorithmNode * >	m_producers

std::vector< AlgorithmNode * >	m_consumers

Detailed Description

Definition at line 232 of file ExecutionFlowGraph.h.

Constructor & Destructor Documentation

concurrency::DataNode::DataNode	(	ExecutionFlowGraph &	,
		const std::string &	path
	)

inline

Constructor.

Definition at line 235 of file ExecutionFlowGraph.h.

235 : m_data_object_path(path) {}

EnvConfig.path

list path

Definition: __init__.py:15

concurrency::DataNode::m_data_object_path

std::string m_data_object_path

Definition: ExecutionFlowGraph.h:254

concurrency::DataNode::~DataNode ( )

inline

Destructor.

Definition at line 237 of file ExecutionFlowGraph.h.

237 {}

Member Function Documentation

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

inline

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

Definition at line 245 of file ExecutionFlowGraph.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 240 of file ExecutionFlowGraph.h.

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