- 31 Jul, 2019 2 commits
-
-
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.
FritzFlorian committed -
FritzFlorian committed
-
- 30 Jul, 2019 2 commits
-
-
FritzFlorian committed
-
FritzFlorian committed
-
- 29 Jul, 2019 6 commits
-
-
This makes the programming model a full dataflow implementation, as it allows for branching and recursion.
FritzFlorian committed -
FritzFlorian committed
-
FritzFlorian committed
-
FritzFlorian committed
-
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.
FritzFlorian committed -
Now all expressions in the assert macro are enclosed in parentheses, avoiding issues.
FritzFlorian committed
-
- 24 Jul, 2019 1 commit
-
-
FritzFlorian committed
-
- 22 Jul, 2019 1 commit
-
-
FritzFlorian committed
-
- 19 Jul, 2019 1 commit
-
-
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.
FritzFlorian committed
-
- 11 Jul, 2019 2 commits
-
-
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.
FritzFlorian committed -
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.
FritzFlorian committed
-
- 10 Jul, 2019 1 commit
-
-
FritzFlorian committed
-
- 09 Jul, 2019 3 commits
-
-
We need some tricks in template programming to have a clean user facing API while internally using our classes with more capabilities.
FritzFlorian committed -
We need some tricks in template programming to have a clean user facing API while internally using our classes with more capabilities.
FritzFlorian committed -
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.
FritzFlorian committed
-
- 03 Jul, 2019 1 commit
-
-
FritzFlorian committed
-
- 28 Jun, 2019 1 commit
-
-
FritzFlorian committed
-
- 24 Jun, 2019 2 commits
-
-
FritzFlorian committed
-
FritzFlorian committed
-
- 20 Jun, 2019 2 commits
-
-
Florian Fritz committed
-
FritzFlorian committed
-
- 18 Jun, 2019 3 commits
-
-
FritzFlorian committed
-
Threads must be joined on scheduler termination and tasks must be pushed onto the stack to allow better memory management.
FritzFlorian committed -
FritzFlorian committed
-
- 17 Jun, 2019 1 commit
-
-
FritzFlorian committed
-
- 14 Jun, 2019 4 commits
-
-
FritzFlorian committed
-
FritzFlorian committed
-
FritzFlorian committed
-
This removes boost as an dependency from our code and makes our project again only dependent on C++11 compilers (no external dependency).
FritzFlorian committed
-
- 12 Jun, 2019 5 commits
-
-
Now all algorithms are used without the parallel pre-/suffix and the for_each method has an specialization for integer ranges.
FritzFlorian committed -
FritzFlorian committed
-
This seems to be only possible with two different function names, as variadic arguments and default arguments wont work together.
FritzFlorian committed -
FritzFlorian committed
-
FritzFlorian committed
-
- 11 Jun, 2019 2 commits
-
-
FritzFlorian committed
-
FritzFlorian committed
-