|
dispenso 1.4.1
A library for task parallelism
|
#include <graph.h>
Public Member Functions | |
| GraphT (const GraphT< N > &)=delete | |
| GraphT () | |
| GraphT (GraphT< N > &&other) | |
| template<class T > | |
| N & | addNode (T &&f) |
| size_t | numNodes () const |
| const N & | node (size_t index) const |
| N & | node (size_t index) |
| SubgraphT< N > & | addSubgraph () |
| size_t | numSubgraphs () const |
| const SubgraphT< N > & | subgraph (size_t index) const |
| SubgraphT< N > & | subgraph (size_t index) |
| template<class F > | |
| void | forEachSubgraph (F &&func) const |
| template<class F > | |
| void | forEachSubgraph (F &&func) |
| template<class F > | |
| void | forEachNode (F &&func) const |
| template<class F > | |
| void | forEachNode (F &&func) |
| void | clear () |
| void | clearSubgraphs () |
Friends | |
| template<class T > | |
| class | SubgraphT |
A directed acyclic graph (DAG) for expressing task dependencies.
GraphT manages a collection of subgraphs, each containing nodes that represent work to be done. Nodes can have dependencies on other nodes, and the graph executor ensures nodes run only after their dependencies complete.
| N | The node type (Node or BiPropNode). |
|
inline |
| dispenso::GraphT< N >::GraphT | ( | GraphT< N > && | other | ) |
Move constructor
Construct a NodeType with a valid functor. This node is created into subgraph 0. This is not concurrency safe.
| f | A functor with signature void(). |
| SubgraphT< N > & dispenso::GraphT< N >::addSubgraph | ( | ) |
Create an empty subgraph. This is not concurrency safe.
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |