The Gaudi Framework  master (ff829712)
Loading...
Searching...
No Matches
concurrency Namespace Reference

Classes

class  ActiveLineageScout
 
struct  AlgoProps
 
class  AlgorithmNode
 
struct  CompareNodes
 
struct  CondDataProps
 
class  ConditionalLineageFinder
 
class  ConditionNode
 
class  ControlFlowNode
 
class  DataNode
 
struct  DataProps
 
class  DataReadyPromoter
 
struct  DecisionHubProps
 
class  DecisionNode
 
class  DecisionUpdater
 
class  IGraphVisitor
 
struct  IPrecedenceRulesGraph
 
class  NodePropertiesValidator
 
class  PrecedenceRulesGraph
 
class  ProductionAmbiguityFinder
 
class  RankerByCummulativeOutDegree
 
class  RankerByDataRealmEccentricity
 
class  RankerByEccentricity
 
class  RankerByProductConsumption
 
class  RankerByTiming
 
class  RunSimulator
 
class  SubSlotScout
 
class  Supervisor
 
class  TarjanSCCFinder
 The visitor implements the Tarjan algorithm for searching strongly connected components in the data flow realm of precedence rules graph. More...
 

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 AState = AlgsExecutionStates::State
 
using PRVertexDesc
 
using VariantVertexProps
 

Typedef Documentation

◆ AllPass

Definition at line 42 of file PrecedenceRulesGraph.h.

◆ AState

Definition at line 21 of file Promoters.cpp.

◆ Concurrent

Definition at line 39 of file PrecedenceRulesGraph.h.

◆ Inverted

Definition at line 43 of file PrecedenceRulesGraph.h.

◆ ModeOr

Definition at line 41 of file PrecedenceRulesGraph.h.

◆ PromptDecision

Definition at line 40 of file PrecedenceRulesGraph.h.

◆ PRVertexDesc

Definition at line 393 of file PrecedenceRulesGraph.h.

◆ VariantVertexProps

Definition at line 391 of file PrecedenceRulesGraph.h.