![]() |
The Gaudi Framework
v28r2
|
#include <vector>#include <algorithm>#include <unordered_map>#include <chrono>#include <fstream>#include <sstream>#include <boost/graph/adjacency_list.hpp>#include <boost/graph/graphml.hpp>#include "AlgsExecutionStates.h"#include "EventSlot.h"#include "IGraphVisitor.h"#include "GaudiKernel/Algorithm.h"#include "GaudiKernel/CommonMessaging.h"#include "CPUCruncher.h"

Go to the source code of this file.
Classes | |
| struct | boost::AlgoNodeStruct |
| class | concurrency::ControlFlowNode |
| class | concurrency::DecisionNode |
| class | concurrency::AlgorithmNode |
| class | concurrency::DataNode |
| struct | concurrency::IPrecedenceRulesGraph |
| class | concurrency::PrecedenceRulesGraph |
Namespaces | |
| boost | |
| The namespace threadpool contains a thread pool and related utility classes. | |
| concurrency | |
Typedefs | |
| typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::bidirectionalS, AlgoNodeStruct > | boost::ExecPlan |
| typedef graph_traits< ExecPlan >::vertex_descriptor | boost::AlgoVertex |
| typedef AlgsExecutionStates::State | concurrency::State |
| typedef std::unordered_map< std::string, AlgorithmNode * > | concurrency::AlgoNodesMap |
| typedef std::unordered_map< std::string, DecisionNode * > | concurrency::DecisionHubsMap |
| typedef std::unordered_map< DataObjID, DataNode *, DataObjID_Hasher > | concurrency::DataNodesMap |
| typedef std::unordered_map< std::string, DataObjIDColl > | concurrency::AlgoInputsMap |
| typedef std::unordered_map< std::string, DataObjIDColl > | concurrency::AlgoOutputsMap |