This functions can be used to filter or collect specific nodes in collections
The Combine node type specifies the building of a CompNode as a result of applying an associative function to the values of an existing key-values CompNode
General methods for navigating a graph of CompNodes
generic functions for a nodes graph
The GroupByKey node type specifies the building of a CompNode as a result of partitioning an exiting key-value CompNode by key
The Load node type specifies the creation of a CompNode from some source other than another CompNode.
The Op node type specifies the building of Exp CompNode by applying a function to the values of two other CompNode nodes
Optimiser for the CompNode graph
Optimiser for the CompNode graph
It uses the [Kiama](http://code.google.com/p/kiama) rewriting library by defining Strategies for traversing the graph and rules to rewrite it.
Usually the rules are applied in a top-down fashion at every node where they can be applied (using the everywhere
strategy).
The ParallelDo node type specifies the building of a CompNode as a result of applying a function to all elements of an existing CompNode and concatenating the results
Processing node in the computation graph.
Processing node in the computation graph.
It has a unique id, a BridgeStore for its outputs and some possible additional sinks.
The Return node type specifies the building of a Exp CompNode from an "ordinary" value.
This trait contains some display functions for computation graphs
Value node to either load or materialise a value
Value nodes have environments which are determined by the job configuration because they are effectively files which are distributed via the distributed cache
The Load node type specifies the creation of a CompNode from some source other than another CompNode. A DataSource object specifies how the loading is performed