@Override public boolean hasNext() { if (!this.locked) this.applyStrategies(); return this.lastTraverser.bulk() > 0L || this.finalEndStep.hasNext(); }
@Override public boolean hasNext() { return !this.traverserSet.isEmpty() || this.hostStep.getPreviousStep().hasNext(); }
@Override public Traverser.Admin<S> next() { if (!this.traverserSet.isEmpty()) return this.traverserSet.remove(); ///////////// if (this.hostStep.getPreviousStep().hasNext()) return this.hostStep.getPreviousStep().next(); ///////////// return this.traverserSet.remove(); }
if (option.getStartStep().hasNext() && option.hasNext()) return option.getEndStep();
@Override protected Iterator<Traverser.Admin<S>> standardAlgorithm() throws NoSuchElementException { if (null == this.repeatTraversal) throw new IllegalStateException("The repeat()-traversal was not defined: " + this); while (true) { if (this.repeatTraversal.getEndStep().hasNext()) { return this.repeatTraversal.getEndStep(); } else { final Traverser.Admin<S> start = this.starts.next(); start.initialiseLoops(this.getId(), this.loopName); if (doUntil(start, true)) { start.resetLoops(); return IteratorUtils.of(start); } this.repeatTraversal.addStart(start); if (doEmit(start, true)) { final Traverser.Admin<S> emitSplit = start.split(); emitSplit.resetLoops(); return IteratorUtils.of(emitSplit); } } } }
while (endStep.hasNext()) { haltedTraversers.add(this.haltedTraverserStrategy.halt(endStep.next()));
if (!currentStep.getId().equals(previousStep.getId()) && !(previousStep instanceof EmptyStep)) { GraphComputing.atMaster(previousStep, true); while (previousStep.hasNext()) { final Traverser.Admin<Object> result = previousStep.next(); if (result.isHalted()) while (currentStep.hasNext()) { final Traverser.Admin<Object> traverser = currentStep.next(); if (traverser.isHalted())
@Override public boolean hasNext() { return !this.traversers.isEmpty() || this.hostStep.getPreviousStep().hasNext(); }
@Override public boolean hasNext() { return !this.traversers.isEmpty() || this.hostStep.getPreviousStep().hasNext(); }
@Override public boolean hasNext() { if (!this.locked) this.applyStrategies(); return this.lastTraverser.bulk() > 0L || this.finalEndStep.hasNext(); }
@Override public boolean hasNext() { return !this.traverserSet.isEmpty() || this.hostStep.getPreviousStep().hasNext(); }
@Override public Traverser.Admin<S> next() { if (!this.traversers.isEmpty()) return this.traversers.poll(); ///////////// if (this.hostStep.getPreviousStep().hasNext()) return this.hostStep.getPreviousStep().next(); ///////////// throw FastNoSuchElementException.instance(); }
@Override public Traverser.Admin<S> next() { if (!this.traversers.isEmpty()) return this.traversers.poll(); ///////////// if (this.hostStep.getPreviousStep().hasNext()) return this.hostStep.getPreviousStep().next(); ///////////// throw FastNoSuchElementException.instance(); }
boolean lastIter = true; while (true) { if (this.repeatTraversal.getEndStep().hasNext()) { return Iterators.concat(this.repeatTraversal.getEndStep(), emits.iterator()); } else {
@Override public Traverser.Admin<S> next() { if (!this.traverserSet.isEmpty()) return this.traverserSet.remove(); ///////////// if (this.hostStep.getPreviousStep().hasNext()) return this.hostStep.getPreviousStep().next(); ///////////// return this.traverserSet.remove(); }
if (option.getStartStep().hasNext() && option.hasNext()) return option.getEndStep();
@SuppressWarnings("unchecked") @Override protected Iterator<Traverser.Admin<S>> standardAlgorithm() throws NoSuchElementException { final SqlgRepeatStepBarrier<S> repeatStep = (SqlgRepeatStepBarrier<S>) this.getTraversal().getParent(); while (true) { Iterator<Iterator<Traverser.Admin<S>>> returnIterator = toReturn.iterator(); if (returnIterator.hasNext()) { Iterator<Traverser.Admin<S>> next = returnIterator.next(); returnIterator.remove(); if (SqlgRepeatStepBarrier.this.sqlgRangeHolder != null && applyRange()) { continue; } return next; } boolean foundSomething = false; // if (repeatStep.optimizeUntil) { if (barrierUntil()) { if (!repeatStep.untilFirst) { Multimap<String, Traverser.Admin<S>> startRecordIds = LinkedListMultimap.create(); foundSomething = repeatStep.doUntilBarrier(this.starts, this.toReturn, startRecordIds); for (Traverser.Admin<S> start : startRecordIds.values()) { //This is a brain bender. if (!repeatStep.emitFirst) { repeatStep.repeatTraversal.addStart(start); } else { //util is last and emit is first. //the start here did not pass the until so it goes round again. //The RepeatStep will iter the start and since emit is first it will emit it. repeatStep.addStart(start); }
@Override protected Iterator<Traverser.Admin<S>> standardAlgorithm() throws NoSuchElementException { if (null == this.repeatTraversal) throw new IllegalStateException("The repeat()-traversal was not defined: " + this); while (true) { if (this.repeatTraversal.getEndStep().hasNext()) { return this.repeatTraversal.getEndStep(); } else { final Traverser.Admin<S> start = this.starts.next(); start.initialiseLoops(this.getId(), this.loopName); if (doUntil(start, true)) { start.resetLoops(); return IteratorUtils.of(start); } this.repeatTraversal.addStart(start); if (doEmit(start, true)) { final Traverser.Admin<S> emitSplit = start.split(); emitSplit.resetLoops(); return IteratorUtils.of(emitSplit); } } } }
while (endStep.hasNext()) { haltedTraversers.add(this.haltedTraverserStrategy.halt(endStep.next()));
if (!currentStep.getId().equals(previousStep.getId()) && !(previousStep instanceof EmptyStep)) { GraphComputing.atMaster(previousStep, true); while (previousStep.hasNext()) { final Traverser.Admin<Object> result = previousStep.next(); if (result.isHalted()) while (currentStep.hasNext()) { final Traverser.Admin<Object> traverser = currentStep.next(); if (traverser.isHalted())