![]() |
The Gaudi Framework
v29r2 (7a580596)
|
Namespaces | |
| recursive_CF | |
Classes | |
| class | AlgorithmNode |
| class | ConditionNode |
| class | ControlFlowNode |
| class | DataNode |
| class | DataReadyPromoter |
| class | DecisionNode |
| class | DecisionUpdater |
| class | IGraphVisitor |
| struct | IPrecedenceRulesGraph |
| class | PrecedenceRulesGraph |
| class | RankerByCummulativeOutDegree |
| class | RankerByDataRealmEccentricity |
| class | RankerByEccentricity |
| class | RankerByProductConsumption |
| class | RankerByTiming |
| class | RunSimulator |
| class | Supervisor |
Typedefs | |
| using | State = AlgsExecutionStates::State |
| using | AlgoNodesMap = std::unordered_map< std::string, AlgorithmNode * > |
| using | DecisionHubsMap = std::unordered_map< std::string, DecisionNode * > |
| using | DataNodesMap = std::unordered_map< DataObjID, DataNode *, DataObjID_Hasher > |
| using | AlgoInputsMap = std::unordered_map< std::string, DataObjIDColl > |
| using | AlgoOutputsMap = std::unordered_map< std::string, DataObjIDColl > |
| using concurrency::AlgoInputsMap = typedef std::unordered_map<std::string, DataObjIDColl> |
Definition at line 569 of file PrecedenceRulesGraph.h.
| using concurrency::AlgoNodesMap = typedef std::unordered_map<std::string, AlgorithmNode*> |
Definition at line 565 of file PrecedenceRulesGraph.h.
| using concurrency::AlgoOutputsMap = typedef std::unordered_map<std::string, DataObjIDColl> |
Definition at line 570 of file PrecedenceRulesGraph.h.
| using concurrency::DataNodesMap = typedef std::unordered_map<DataObjID, DataNode*, DataObjID_Hasher> |
Definition at line 567 of file PrecedenceRulesGraph.h.
| using concurrency::DecisionHubsMap = typedef std::unordered_map<std::string, DecisionNode*> |
Definition at line 566 of file PrecedenceRulesGraph.h.
Definition at line 323 of file PrecedenceRulesGraph.h.