|
dispenso 1.5.1
A library for task parallelism
|
#include <graph.h>
Public Member Functions | |
| SubgraphT (const SubgraphT< N > &)=delete | |
| SubgraphT (SubgraphT< N > &&other) noexcept | |
| template<class T > | |
| N & | addNode (T &&f) |
| size_t | numNodes () const |
| void | reserve (size_t n) |
| const N & | node (size_t index) const |
| N & | node (size_t index) |
| template<class F > | |
| void | forEachNode (F &&func) const |
| template<class F > | |
| void | forEachNode (F &&func) |
| void | clear () |
Friends | |
| template<class T > | |
| class | GraphT |
A subgraph within a Graph, containing a collection of nodes that can be executed together.
| N | The node type (Node or BiPropNode). |
|
inlinenoexcept |
| void dispenso::SubgraphT< N >::clear | ( | ) |
Removes all dependency between nodes of this subgraph and other nodes, destroy this subgraph nodes. This is not concurrency safe.
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
Reserve capacity for the specified number of nodes. This can improve performance when the number of nodes is known in advance by avoiding vector reallocations during addNode calls. This is not concurrency safe.
| n | - number of nodes to reserve capacity for |