concurrency::RankerByEccentricity Class Reference

#include </builds/gaudi/Gaudi/GaudiHive/src/PRGraph/Visitors/Rankers.h>

Inheritance diagram for concurrency::RankerByEccentricity:

Collaboration diagram for concurrency::RankerByEccentricity:

Public Member Functions
bool	visit (AlgorithmNode &) override
virtual bool	visit (DecisionNode &)
virtual bool	visit (DataNode &)
virtual bool	visit (ConditionNode &)
Public Member Functions inherited from concurrency::IGraphVisitor
virtual	~IGraphVisitor ()=default
virtual bool	visitEnter (DecisionNode &) const
virtual bool	visitEnter (AlgorithmNode &) const
virtual bool	visitEnter (DataNode &) const
virtual bool	visitEnter (ConditionNode &) const
virtual void	reset ()

Detailed Description

Definition at line 48 of file Rankers.h.

Member Function Documentation

visit() [1/4]

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

overridevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 121 of file Rankers.cpp.

                                                        {
 
    std::ifstream myfile;
    myfile.open( "Eccentricity.graphml", std::ios::in );
 
    precedence::PrecTrace execPlan;
 
    boost::dynamic_properties dp;
    using boost::get;
 
    dp.property( "name", get( &precedence::AlgoTraceProps::m_name, execPlan ) );
    dp.property( "Eccentricity", get( &precedence::AlgoTraceProps::m_eccentricity, execPlan ) );
 
    boost::read_graphml( myfile, execPlan, dp );
 
    typedef boost::graph_traits<precedence::PrecTrace>::vertex_iterator itV;
    std::pair<itV, itV>                                                 vp;
 
    for ( vp = boost::vertices( execPlan ); vp.first != vp.second; ++vp.first ) {
      precedence::AlgoTraceVertex v     = *vp.first;
      auto                        index = get( &precedence::AlgoTraceProps::m_name, execPlan );
      if ( index[v] == node.name() ) {
        auto  index_eccentricity = get( &precedence::AlgoTraceProps::m_eccentricity, execPlan );
        float rank               = index_eccentricity[v];
        node.setRank( rank );
        // std::cout << "Rank of " << index[v] << " is " << rank << std::endl;
      }
    }
    return true;
  }

visit() [2/4]

virtual bool concurrency::IGraphVisitor::visit ( ConditionNode & )

inlinevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 34 of file IGraphVisitor.h.

{ return true; }

visit() [3/4]

virtual bool concurrency::IGraphVisitor::visit ( DataNode & )

inlinevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 31 of file IGraphVisitor.h.

{ return true; }

visit() [4/4]

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

inlinevirtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 25 of file IGraphVisitor.h.

{ return true; }

---

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

• GaudiHive/src/PRGraph/Visitors/Rankers.h
• GaudiHive/src/PRGraph/Visitors/Rankers.cpp