/** * @see java.util.Iterator#hasNext() */ public boolean hasNext() throws TeiidComponentException{ try { return tupleSourceIterator.hasNext(); } catch (TeiidProcessingException e) { throw new TeiidComponentException(e); } }
/** * @see java.util.Iterator#hasNext() */ public boolean hasNext() throws TeiidComponentException{ try { return tupleSourceIterator.hasNext(); } catch (TeiidProcessingException e) { throw new TeiidComponentException(e); } }
/** * @see java.util.Iterator#hasNext() */ public boolean hasNext() throws TeiidComponentException{ try { return tupleSourceIterator.hasNext(); } catch (TeiidProcessingException e) { throw new TeiidComponentException(e); } }
outputTs = tb.createIndexedTupleSource(true); while (outputTs.hasNext()) { List<?> tuple = outputTs.nextTuple(); Integer rowId = (Integer)tuple.get(tuple.size() - 1);
while (specificationTs.hasNext()) { List<?> tuple = specificationTs.nextTuple(); if (multiGroup) {
List<?> lastRow = null; while (specificationTs.hasNext()) { List<?> tuple = specificationTs.nextTuple(); if (multiGroup) {
this.currentState.ts.hasNext(); if (procAssignments != null) { while (this.currentState.ts.hasNext()) { if (this.currentState.currentRow != null && this.currentState.resultsBuffer != null) { this.currentState.resultsBuffer.addTuple(this.currentState.currentRow.subList(0, this.currentState.resultsBuffer.getSchema().size())); while (this.currentState.ts.hasNext()) { List<?> tuple = this.currentState.ts.nextTuple(); this.currentState.resultsBuffer.addTuple(tuple); } else if (mode == Mode.UPDATE) { List<?> t = this.currentState.ts.nextTuple(); if (this.currentState.ts.hasNext()) { throw new AssertionError("Invalid update count result - more than 1 row returned"); //$NON-NLS-1$ while (this.currentState.ts.hasNext()) { this.currentState.ts.nextTuple();
this.currentState.ts.hasNext(); if (procAssignments != null) { while (this.currentState.ts.hasNext()) { if (this.currentState.currentRow != null && this.currentState.resultsBuffer != null) { this.currentState.resultsBuffer.addTuple(this.currentState.currentRow.subList(0, this.currentState.resultsBuffer.getSchema().size())); while (this.currentState.ts.hasNext()) { List<?> tuple = this.currentState.ts.nextTuple(); this.currentState.resultsBuffer.addTuple(tuple); } else if (mode == Mode.UPDATE) { List<?> t = this.currentState.ts.nextTuple(); if (this.currentState.ts.hasNext()) { throw new AssertionError("Invalid update count result - more than 1 row returned"); //$NON-NLS-1$ while (this.currentState.ts.hasNext()) { this.currentState.ts.nextTuple();
this.currentState.ts.hasNext(); if (procAssignments != null) { while (this.currentState.ts.hasNext()) { if (this.currentState.currentRow != null && this.currentState.resultsBuffer != null) { this.currentState.resultsBuffer.addTuple(this.currentState.currentRow.subList(0, this.currentState.resultsBuffer.getSchema().size())); while (this.currentState.ts.hasNext()) { List<?> tuple = this.currentState.ts.nextTuple(); this.currentState.resultsBuffer.addTuple(tuple); } else if (mode == Mode.UPDATE) { List<?> t = this.currentState.ts.nextTuple(); if (this.currentState.ts.hasNext()) { throw new AssertionError("Invalid update count result - more than 1 row returned"); //$NON-NLS-1$ while (this.currentState.ts.hasNext()) { this.currentState.ts.nextTuple();
Long endPartition = null; while (specificationTs.hasNext()) { long currentIndex = specificationTs.getCurrentIndex(); List<?> tuple = specificationTs.nextTuple();
Long endPartition = null; while (specificationTs.hasNext()) { long currentIndex = specificationTs.getCurrentIndex(); List<?> tuple = specificationTs.nextTuple();
int sizeHint = index.getExpectedHeight(state.getRowCount()); index.setBatchInsert(sorted); outer: while (its.hasNext()) {
int sizeHint = index.getExpectedHeight(state.getRowCount()); index.setBatchInsert(sorted); outer: while (its.hasNext()) {
int sizeHint = index.getExpectedHeight(state.getRowCount()); index.setBatchInsert(sorted); outer: while (its.hasNext()) {
protected boolean compareToPrevious(SourceState target) throws TeiidComponentException, TeiidProcessingException { if (!target.getIterator().hasNext()) { target.setMaxProbeMatch(target.getIterator().getCurrentIndex()); return false;
protected boolean compareToPrevious(SourceState target) throws TeiidComponentException, TeiidProcessingException { if (!target.getIterator().hasNext()) { target.setMaxProbeMatch(target.getIterator().getCurrentIndex()); return false;
protected boolean compareToPrevious(SourceState target) throws TeiidComponentException, TeiidProcessingException { if (!target.getIterator().hasNext()) { target.setMaxProbeMatch(target.getIterator().getCurrentIndex()); return false; } List previousTuple = target.getCurrentTuple(); target.saveNext(); if (target.getMaxProbeMatch() >= target.getIterator().getCurrentIndex()) { return true; } if (previousTuple != null) { int compare = 1; if (!target.isExpresssionDistinct()) { compare = compare(previousTuple, target.getCurrentTuple(), target.getExpressionIndexes(), target.getExpressionIndexes()); if (compare < 0) { //sanity check - this means the sort order is not as expected //note this is not a complete check - it will not detect all invalid circumstances as we exit early throw new TeiidComponentException(QueryPlugin.Util.gs(QueryPlugin.Event.TEIID31202)); } } if (compare != 0) { target.setMaxProbeMatch(target.getIterator().getCurrentIndex() - 1); return false; } } target.setMaxProbeMatch(target.getIterator().getCurrentIndex()); return true; }