public int [] getKeyPositions() { return keys.computeLogicalKeyPositions(); }
public boolean isEmpty() { return getNumberOfKeyFields() == 0; }
public Grouping(DataSet<T> set, Keys<T> keys) { if (set == null || keys == null) { throw new NullPointerException(); } if (keys.isEmpty()) { throw new InvalidProgramException("The grouping keys must not be empty."); } this.dataSet = set; this.keys = keys; }
&& keys1.areCompatibale(keys2)) { && keys1.areCompatibale(keys2) ) { int[] logicalKeyPositions1 = keys1.computeLogicalKeyPositions(); int[] logicalKeyPositions2 = keys2.computeLogicalKeyPositions(); && keys1.areCompatibale(keys2) ) { int[] logicalKeyPositions1 = keys1.computeLogicalKeyPositions(); && keys1.areCompatibale(keys2) ) { Keys.SelectorFunctionKeys<I1, ?> selectorKeys1 = (Keys.SelectorFunctionKeys<I1, ?>) keys1; int[] logicalKeyPositions2 = keys2.computeLogicalKeyPositions();
private static int[] makeFields(int[] fields, TupleTypeInfo<?> type) { int inLength = type.getArity(); // null parameter means all fields are considered if (fields == null || fields.length == 0) { fields = new int[inLength]; for (int i = 0; i < inLength; i++) { fields[i] = i; } return fields; } else { return rangeCheckAndOrderFields(fields, inLength-1); } }
&& super.keys1.areCompatibale(super.keys2)) { && super.keys2 instanceof Keys.FieldPositionKeys) if (!super.keys1.areCompatibale(super.keys2)) { throw new InvalidProgramException("The types of the key fields do not match."); int[] logicalKeyPositions1 = super.keys1.computeLogicalKeyPositions(); int[] logicalKeyPositions2 = super.keys2.computeLogicalKeyPositions(); && super.keys1.areCompatibale(super.keys2) ) { int[] logicalKeyPositions1 = super.keys1.computeLogicalKeyPositions(); && super.keys1.areCompatibale(super.keys2) ) { Keys.SelectorFunctionKeys<I1, ?> selectorKeys1 = (Keys.SelectorFunctionKeys<I1, ?>) super.keys1; int[] logicalKeyPositions2 = super.keys2.computeLogicalKeyPositions();
public void checkJoinKeyFields(int[] keyFields) { int[] ssKeys = deltaIteration.keys.computeLogicalKeyPositions(); if (!Arrays.equals(ssKeys, keyFields)) { throw new InvalidProgramException("The solution set must be joind with using the keys with which elements are identified."); } } }
int[] logicalKeyPositions = this.grouping.getKeys().computeLogicalKeyPositions(); UnaryOperatorInformation<IN, IN> operatorInfo = new UnaryOperatorInformation<IN, IN>(getInputType(), getResultType()); GroupReduceOperatorBase<IN, IN, GenericGroupReduce<IN, IN>> po =
int[] logicalKeyPositions = grouper.getKeys().computeLogicalKeyPositions(); UnaryOperatorInformation<IN, IN> operatorInfo = new UnaryOperatorInformation<IN, IN>(getInputType(), getInputType()); ReduceOperatorBase<IN, GenericReduce<IN>> po =
int[] logicalKeyPositions = grouper.getKeys().computeLogicalKeyPositions(); UnaryOperatorInformation<IN, OUT> operatorInfo = new UnaryOperatorInformation<IN, OUT>(getInputType(), getResultType()); GroupReduceOperatorBase<IN, OUT, GenericGroupReduce<IN, OUT>> po =