#include <src/EFGraphVisitors.h>

Inheritance diagram for concurrency::RankerByProductConsumption:

Collaboration diagram for concurrency::RankerByProductConsumption:

Public Member Functions
	RankerByProductConsumption ()
	Constructor. More...

virtual	~RankerByProductConsumption ()
	Destructor. More...

virtual bool	visitEnter (DecisionNode &) const

virtual bool	visit (DecisionNode &)

virtual bool	visitLeave (DecisionNode &) const

virtual bool	visitEnter (AlgorithmNode &) const

virtual bool	visit (AlgorithmNode &node)

virtual void	reset ()

Public Member Functions inherited from concurrency::IGraphVisitor
virtual	~IGraphVisitor ()

Additional Inherited Members
Public Attributes inherited from concurrency::IGraphVisitor
int	m_nodesSucceeded

int	m_slotNum

Detailed Description

Definition at line 64 of file EFGraphVisitors.h.

Constructor & Destructor Documentation

concurrency::RankerByProductConsumption::RankerByProductConsumption ( )

inline

Constructor.

Definition at line 67 of file EFGraphVisitors.h.

                                    {
         m_nodesSucceeded = 0;
         m_slotNum = -1;
       };

virtual concurrency::RankerByProductConsumption::~RankerByProductConsumption ( )

inlinevirtual

Destructor.

Definition at line 72 of file EFGraphVisitors.h.

72 {};

Member Function Documentation

virtual void concurrency::RankerByProductConsumption::reset ( )

inlinevirtual

Implements concurrency::IGraphVisitor.

Definition at line 86 of file EFGraphVisitors.h.

86 { m_nodesSucceeded = 0; }

concurrency::IGraphVisitor::m_nodesSucceeded

int m_nodesSucceeded

Definition: IGraphVisitor.h:23

virtual bool concurrency::RankerByProductConsumption::visit ( DecisionNode & )

inlinevirtual

Implements concurrency::IGraphVisitor.

Definition at line 76 of file EFGraphVisitors.h.

76 {return true;};

bool concurrency::RankerByProductConsumption::visit ( AlgorithmNode & node )

virtual

Implements concurrency::IGraphVisitor.

Definition at line 154 of file EFGraphVisitors.cpp.

                                                               {
 
       auto& products = node.getOutputDataNodes();
       float rank = 0;
 
       for (auto p : products)
         rank += p->getConsumers().size();
 
       node.setRank(rank);
       /*std::stringstream s;
       s << node.getNodeName() << ", " << rank << "\n";
       std::ofstream myfile;
       myfile.open("AlgoRank.csv", std::ios::app);
       myfile << s.str();
       myfile.close();*/
 
       return true;
     }