![]() |
The Gaudi Framework
v30r0 (c919700c)
|
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 | Concurrent = Gaudi::tagged_bool< class Concurrent_tag > |
| using | PromptDecision = Gaudi::tagged_bool< class PromptDecision_tag > |
| using | ModeOr = Gaudi::tagged_bool< class ModeOr_tag > |
| using | AllPass = Gaudi::tagged_bool< class AllPass_tag > |
| using | Inverted = Gaudi::tagged_bool< class Inverted_tag > |
| 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 687 of file PrecedenceRulesGraph.h.
| using concurrency::AlgoNodesMap = typedef std::unordered_map<std::string, AlgorithmNode*> |
Definition at line 683 of file PrecedenceRulesGraph.h.
| using concurrency::AlgoOutputsMap = typedef std::unordered_map<std::string, DataObjIDColl> |
Definition at line 688 of file PrecedenceRulesGraph.h.
| using concurrency::AllPass = typedef Gaudi::tagged_bool<class AllPass_tag> |
Definition at line 33 of file PrecedenceRulesGraph.h.
| using concurrency::Concurrent = typedef Gaudi::tagged_bool<class Concurrent_tag> |
Definition at line 30 of file PrecedenceRulesGraph.h.
| using concurrency::DataNodesMap = typedef std::unordered_map<DataObjID, DataNode*, DataObjID_Hasher> |
Definition at line 685 of file PrecedenceRulesGraph.h.
| using concurrency::DecisionHubsMap = typedef std::unordered_map<std::string, DecisionNode*> |
Definition at line 684 of file PrecedenceRulesGraph.h.
| using concurrency::Inverted = typedef Gaudi::tagged_bool<class Inverted_tag> |
Definition at line 34 of file PrecedenceRulesGraph.h.
| using concurrency::ModeOr = typedef Gaudi::tagged_bool<class ModeOr_tag> |
Definition at line 32 of file PrecedenceRulesGraph.h.
| using concurrency::PromptDecision = typedef Gaudi::tagged_bool<class PromptDecision_tag> |
Definition at line 31 of file PrecedenceRulesGraph.h.
Definition at line 436 of file PrecedenceRulesGraph.h.