Best code snippets using org.apache.tinkerpop.gremlin.process.traversal.Traversal$Admin.reset(Showing top 15 results out of 315)

@Override
protected Iterator<E> flatMap(final Traverser.Admin<S> traverser) {
  for (final Traversal.Admin<S, E> coalesceTraversal : this.coalesceTraversals) {
    coalesceTraversal.reset();
    coalesceTraversal.addStart(traverser.split());
    if (coalesceTraversal.hasNext())
      return coalesceTraversal;
  }
  return EmptyIterator.instance();
}

public static final <S, E> boolean test(final Traverser.Admin<S> traverser, final Traversal.Admin<S, E> traversal) {
  final Traverser.Admin<S> split = traverser.split();
  split.setSideEffects(traversal.getSideEffects());
  split.setBulk(1l);
  traversal.reset();
  traversal.addStart(split);
  return traversal.hasNext(); // filter
}

@Override
public void reset() {
  if (null != this.bypassTraversal)
    this.bypassTraversal.reset();
}

@Override
public Map<K, V> projectTraverser(final Traverser.Admin<S> traverser) {
  final Map<K, V> map = new HashMap<>(1);
  this.valueTraversal.reset();
  this.valueTraversal.addStart(traverser);
  if (null == this.barrierStep) {
    if (this.valueTraversal.hasNext())
      map.put(TraversalUtil.applyNullable(traverser, this.keyTraversal), (V) this.valueTraversal.next());
  } else if (this.barrierStep.hasNextBarrier())
    map.put(TraversalUtil.applyNullable(traverser, this.keyTraversal), (V) this.barrierStep.nextBarrier());
  return map;
}

  public static <K, V> Map<K, V> doFinalReduction(final Map<K, Object> map, final Traversal.Admin<?, V> valueTraversal) {
    TraversalHelper.getFirstStepOfAssignableClass(Barrier.class, valueTraversal).ifPresent(barrierStep -> {
      for (final K key : map.keySet()) {
        valueTraversal.reset();
        barrierStep.addBarrier(map.get(key));
        if (valueTraversal.hasNext())
          map.put(key, valueTraversal.next());
      }
    });
    return (Map<K, V>) map;
  }
}

public static final <S, E> E apply(final S start, final Traversal.Admin<S, E> traversal) {
  traversal.reset();
  traversal.addStart(traversal.getTraverserGenerator().generate(start, traversal.getStartStep(), 1l));
  try {
    return traversal.next(); // map
  } catch (final NoSuchElementException e) {
    throw new IllegalArgumentException("The provided start does not map to a value: " + start + "->" + traversal);
  }
}

public static final <S, E> E apply(final Traverser.Admin<S> traverser, final Traversal.Admin<S, E> traversal) {
  final Traverser.Admin<S> split = traverser.split();
  split.setSideEffects(traversal.getSideEffects());
  split.setBulk(1l);
  traversal.reset();
  traversal.addStart(split);
  try {
    return traversal.next(); // map
  } catch (final NoSuchElementException e) {
    throw new IllegalArgumentException("The provided traverser does not map to a value: " + split + "->" + traversal);
  }
}

public static final <S, E> Iterator<E> applyAll(final Traverser.Admin<S> traverser, final Traversal.Admin<S, E> traversal) {
  final Traverser.Admin<S> split = traverser.split();
  split.setSideEffects(traversal.getSideEffects());
  split.setBulk(1l);
  traversal.reset();
  traversal.addStart(split);
  return traversal; // flatmap
}

public static final <S, E> Iterator<E> applyAll(final S start, final Traversal.Admin<S, E> traversal) {
  traversal.reset();
  traversal.addStart(traversal.getTraverserGenerator().generate(start, traversal.getStartStep(), 1l));
  return traversal; // flatMap
}

  public static final <S, E> boolean test(final S start, final Traversal.Admin<S, E> traversal) {
    traversal.reset();
    traversal.addStart(traversal.getTraverserGenerator().generate(start, traversal.getStartStep(), 1l));
    return traversal.hasNext(); // filter
  }
}

@Override
protected Iterator<E> flatMap(final Traverser.Admin<S> traverser) {
  for (final Traversal.Admin<S, E> coalesceTraversal : this.coalesceTraversals) {
    coalesceTraversal.reset();
    coalesceTraversal.addStart(traverser.split());
    if (coalesceTraversal.hasNext())
      return coalesceTraversal;
  }
  return EmptyIterator.instance();
}

public static final <S, E> boolean test(final Traverser.Admin<S> traverser, final Traversal.Admin<S, E> traversal) {
  final Traverser.Admin<S> split = traverser.split();
  split.setSideEffects(traversal.getSideEffects());
  split.setBulk(1l);
  traversal.reset();
  traversal.addStart(split);
  return traversal.hasNext(); // filter
}

public static final <S, E> E apply(final S start, final Traversal.Admin<S, E> traversal) {
  traversal.reset();
  traversal.addStart(traversal.getTraverserGenerator().generate(start, traversal.getStartStep(), 1l));
  try {
    return traversal.next(); // map
  } catch (final NoSuchElementException e) {
    throw new IllegalArgumentException("The provided start does not map to a value: " + start + "->" + traversal);
  }
}

  public static <K, V> Map<K, V> doFinalReduction(final Map<K, Object> map, final Traversal.Admin<?, V> valueTraversal) {
    TraversalHelper.getFirstStepOfAssignableClass(Barrier.class, valueTraversal).ifPresent(barrierStep -> {
      for (final K key : map.keySet()) {
        valueTraversal.reset();
        barrierStep.addBarrier(map.get(key));
        if (valueTraversal.hasNext())
          map.put(key, valueTraversal.next());
      }
    });
    return (Map<K, V>) map;
  }
}

@Override
public void reset() {
  if (null != this.bypassTraversal)
    this.bypassTraversal.reset();
}