las3_pub / predictable_parallel_patterns

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.

This removes boost as an dependency from our code and makes our project
again only dependent on C++11 compilers (no external dependency).

Now all algorithms are used without the parallel pre-/suffix and the for_each method has an specialization for integer ranges.

This seems to be only possible with two different function names, as variadic arguments and default arguments wont work together.

Change to pure fork-join task model

See merge request !11

See the comment in the source. This race should actually not be important, but we fix it anyways for now to make the CI happy.

This should have been fine without the atomic property (as it is only a single writer and multiple readers to a single bit). Nevertheless we fixed the 'race' to remove a warning in the thread sanitizer.