AddSortKey
Related Doc:
package dag
Performs a scoped node substitution on this DepGraph.
Performs a scoped node substitution on this DepGraph.
The substitution is represented as a pair from -> to both of type E. The replacement is performed everywhere in the DAG below the scope node of type S. Both S and E are constained to be one of DepGraph or BucketSpec by the availability of instances of the type classes EditUpdate[E] and ScopeUpdate[S] as defined above.
A pair of the whole rewritten DAG and the rewritten scope node.
Returns true if the identities are guaranteed to be unique.
Returns true if the identities are guaranteed to be unique.
The set of available value-sorted keys.
The set of available value-sorted keys.
Evaluator will deref by
sortFieldto get the sort ordering andvalueFieldto get the actual value set that is being sorted. Thus,parentis assumed to evaluate to a set of objects containingsortFieldandvalueField. The identity of the sort should be stable between other sorts that are logically the same. Thus, if one were to sort setfoobyuserIdfor later joining with setbarsorted bypersonId, those two sorts would be semantically very different, but logically identitical and would thus share the same identity. This is very important to ensure correctness in evaluation of theJoinnode.