| The Gaudi Framework v30r0 (c919700c)

- Main Page
- Related Pages
- Modules
- Namespaces
- Classes
- Files

- Class List
- Class Index
- Class Hierarchy
- Class Members

Public Member Functions | List of all members
concurrency::RankerByTiming Class Reference

`#include <src/PRGraphVisitors.h>`

Inheritance diagram for concurrency::RankerByTiming:
[legend]
Collaboration diagram for concurrency::RankerByTiming:
[legend]

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

## Detailed Description

Definition at line 98 of file PRGraphVisitors.h.

## Member Function Documentation

bool concurrency::RankerByTiming::visit | ( | AlgorithmNode & | node | ) |
| override virtual

Reimplemented from concurrency::IGraphVisitor.

Definition at line 304 of file PRGraphVisitors.cpp.

305 {
306
307 std::ifstream myfile;
308 myfile.open( "InputExecutionPlan.graphml", std::ios::in );
309
310 precedence::PrecTrace execPlan;
311 using precedence::AlgoTraceProps;
312 using boost::get;
313
314 boost::dynamic_properties dp;
315 dp.property( "name", get( &AlgoTraceProps::m_name, execPlan ) );
316 dp.property( "index", get( &AlgoTraceProps::m_index, execPlan ) );
317 dp.property( "dataRank", get( &AlgoTraceProps::m_rank, execPlan ) );
318 dp.property( "runtime", get( &AlgoTraceProps::m_runtime, execPlan ) );
319
320 boost::read_graphml( myfile, execPlan, dp );
321
322 typedef boost::graph_traits<precedence::PrecTrace>::vertex_iterator itV;
323 std::pair<itV, itV> vp;
324
325 for ( vp = boost::vertices( execPlan ); vp.first != vp.second; ++vp.first ) {
326 precedence::AlgoTraceVertex v = *vp.first;
327 auto index = get( &AlgoTraceProps::m_name, execPlan );
328 if ( index[v] == node.getNodeName() ) {
329 auto index_runtime = get( &AlgoTraceProps::m_runtime, execPlan );
330 float rank = index_runtime[v];
331 node.setRank( rank );
332 // std::cout << "Rank of " << index[v] << " is " << rank << std::endl;
333 }
334 }
335 return true;
336 }
std::ifstream::open
T open(T...args)
precedence::AlgoTraceVertex
boost::graph_traits< PrecTrace >::vertex_descriptor AlgoTraceVertex
Definition: PrecedenceRulesGraph.h:56
precedence::AlgoTraceProps
Definition: PrecedenceRulesGraph.h:42
precedence::PrecTrace
boost::adjacency_list< boost::vecS, boost::vecS, boost::bidirectionalS, AlgoTraceProps > PrecTrace
Definition: PrecedenceRulesGraph.h:55
std::pair
GaudiPython.Persistency.get
def get(type_)
Definition: Persistency.py:29
std::ifstream
STL class.

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

- GaudiHive/src/PRGraphVisitors.h
- GaudiHive/src/PRGraphVisitors.cpp