The Gaudi Framework
v30r3 (a5ef0a68)
|
#include <src/PrecedenceRulesGraph.h>
Public Member Functions | |
AlgoProps () | |
AlgoProps (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} |
Algorithm * | m_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... | |
Definition at line 59 of file PrecedenceRulesGraph.h.
|
inline |
Definition at line 60 of file PrecedenceRulesGraph.h.
|
inline |
Definition at line 61 of file PrecedenceRulesGraph.h.
int precedence::AlgoProps::m_algoIndex {-1} |
Definition at line 74 of file PrecedenceRulesGraph.h.
Algorithm* precedence::AlgoProps::m_algorithm {nullptr} |
Algorithm representative behind the AlgorithmNode.
Definition at line 77 of file PrecedenceRulesGraph.h.
bool precedence::AlgoProps::m_allPass {false} |
Whether the selection result is relevant or always "pass".
Definition at line 82 of file PrecedenceRulesGraph.h.
bool precedence::AlgoProps::m_inverted {false} |
Whether the selection result is negated or not.
Definition at line 80 of file PrecedenceRulesGraph.h.
bool precedence::AlgoProps::m_isIOBound {false} |
If an algorithm is blocking.
Definition at line 84 of file PrecedenceRulesGraph.h.
std::string precedence::AlgoProps::m_name {""} |
Definition at line 72 of file PrecedenceRulesGraph.h.
int precedence::AlgoProps::m_nodeIndex {-1} |
Definition at line 73 of file PrecedenceRulesGraph.h.
int precedence::AlgoProps::m_rank {-1} |
Definition at line 75 of file PrecedenceRulesGraph.h.