| bounded_traversal | bounded_traversal traverses implicit asynchronous tree specified by init
and unfold arguments, and it also does backward pass with fold operation.
All unfold and fold operations are executed in parallel if they do not
depend on each other (not related by ancestor-descendant relation in implicit tree)
with amount of concurrency constrained by scheduled_max.
|
| bounded_traversal_dag | bounded_traversal_dag traverses implicit asynchronous DAG specified by init
and unfold arguments, and it also does backward pass with fold operation.
All unfold and fold operations are executed in parallel if they do not
depend on each other (not related by ancestor-descendant relation in implicit DAG)
with amount of concurrency constrained by scheduled_max.
|
| bounded_traversal_stream | bounded_traversal_stream traverses implicit asynchronous tree specified by init
and unfold arguments. All unfold operations are executed in parallel if they
do not depend on each other (not related by ancestor-descendant relation in implicit
tree) with amount of concurrency constrained by scheduled_max. Main difference
with bounded_traversal is that this one is not structure perserving, and returns
stream.
|
| Iter | A type used frequently in fold-like invocations inside this module
|