The Gaudi Framework  v31r0 (aeb156f0)
precedence::AlgoProps Struct Reference

#include <src/PrecedenceRulesGraph.h>

Collaboration diagram for precedence::AlgoProps:

Public Member Functions

 AlgoProps ()
 
 AlgoProps (Gaudi::Algorithm *algo, uint nodeIndex, uint algoIndex, bool inverted, bool allPass)
 

Public Attributes

std::string m_name {""}
 
int m_nodeIndex {-1}
 
int m_algoIndex {-1}
 
int m_rank {-1}
 
Gaudi::Algorithmm_algorithm {nullptr}
 Algorithm representative behind the AlgorithmNode. More...
 
bool m_inverted {false}
 Whether the selection result is negated or not. More...
 
bool m_allPass {false}
 Whether the selection result is relevant or always "pass". More...
 
bool m_isIOBound {false}
 If an algorithm is blocking. More...
 

Detailed Description

Definition at line 55 of file PrecedenceRulesGraph.h.

Constructor & Destructor Documentation

precedence::AlgoProps::AlgoProps ( )
inline

Definition at line 56 of file PrecedenceRulesGraph.h.

56 {}
precedence::AlgoProps::AlgoProps ( Gaudi::Algorithm algo,
uint  nodeIndex,
uint  algoIndex,
bool  inverted,
bool  allPass 
)
inline

Definition at line 57 of file PrecedenceRulesGraph.h.

58  : m_name( algo->name() )
59  , m_nodeIndex( nodeIndex )
60  , m_algoIndex( algoIndex )
61  , m_algorithm( algo )
62  , m_inverted( inverted )
63  , m_allPass( allPass )
64  , m_isIOBound( algo->isIOBound() ) {}
const std::string & name() const override
The identifying name of the algorithm object.
Definition: Algorithm.cpp:635
bool isIOBound() const
Definition: Algorithm.h:431
bool m_isIOBound
If an algorithm is blocking.
bool m_allPass
Whether the selection result is relevant or always "pass".
bool m_inverted
Whether the selection result is negated or not.
Gaudi::Algorithm * m_algorithm
Algorithm representative behind the AlgorithmNode.

Member Data Documentation

int precedence::AlgoProps::m_algoIndex {-1}

Definition at line 68 of file PrecedenceRulesGraph.h.

Gaudi::Algorithm* precedence::AlgoProps::m_algorithm {nullptr}

Algorithm representative behind the AlgorithmNode.

Definition at line 71 of file PrecedenceRulesGraph.h.

bool precedence::AlgoProps::m_allPass {false}

Whether the selection result is relevant or always "pass".

Definition at line 76 of file PrecedenceRulesGraph.h.

bool precedence::AlgoProps::m_inverted {false}

Whether the selection result is negated or not.

Definition at line 74 of file PrecedenceRulesGraph.h.

bool precedence::AlgoProps::m_isIOBound {false}

If an algorithm is blocking.

Definition at line 78 of file PrecedenceRulesGraph.h.

std::string precedence::AlgoProps::m_name {""}

Definition at line 66 of file PrecedenceRulesGraph.h.

int precedence::AlgoProps::m_nodeIndex {-1}

Definition at line 67 of file PrecedenceRulesGraph.h.

int precedence::AlgoProps::m_rank {-1}

Definition at line 69 of file PrecedenceRulesGraph.h.


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