las3_pub / predictable_parallel_patterns

This might allow us to do lock free, conditional waits in our stealing loop.

This allows the stack and deque class to use the same offset, making it work better with each other.

Merge: Dataflow

See merge request !12

Now end users only have to #include<pls/dataflow/dataflow.h> to use all parts of the API. We split dataflow out from the general algorithms header, as it is a rather big API and could bloat the users namespace/includes.

This makes the programming model a full dataflow implementation, as it allows for branching and recursion.

Recursion works by using a function node, calling the graph again. We separated an graph invocation form an function invocation within an graph, making the graph only handle one concern.

Now all expressions in the assert macro are enclosed in parentheses, avoiding issues.

We separated the structure (input-output flow) from the rest of the architecture and reworked some template programming to have better access to the types required at compile time.

The data can now flow into a graph, follow its path on inptus/outputs and be fetched from the graph after execution.
Currently graphs are executed synchronous.

The data can now flow into a graph, follow its path on inptus/outputs and be fetched from the graph after execution.
Currently graphs are executed synchronous.

We need some tricks in template programming to have a clean user facing API while internally using our classes with more capabilities.

We need some tricks in template programming to have a clean user facing API while internally using our classes with more capabilities.

This is the base building block for creating the actual dataflow functions and networks, as their main functionality is having data flow through connected nodes.

Threads must be joined on scheduler termination and tasks must be pushed onto the stack to allow better memory management.