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

Classes

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

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.