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

public ChooseStep(final Traversal.Admin traversal, final Traversal.Admin<S, ?> predicateTraversal, final Traversal.Admin<S, E> trueChoice, final Traversal.Admin<S, E> falseChoice) {
  this(traversal, (Traversal.Admin<S, M>) predicateTraversal.addStep(new HasNextStep<>(predicateTraversal)));
  this.addGlobalChildOption((M) Boolean.TRUE, trueChoice);
  this.addGlobalChildOption((M) Boolean.FALSE, falseChoice);
}

public static <A, B, C extends Traversal<A, B>> C addRepeatToTraversal(final C traversal, final Traversal.Admin<B, B> repeatTraversal) {
  final Step<?, B> step = traversal.asAdmin().getEndStep();
  if (step instanceof RepeatStep && null == ((RepeatStep) step).repeatTraversal) {
    ((RepeatStep<B>) step).setRepeatTraversal(repeatTraversal);
  } else {
    final RepeatStep<B> repeatStep = new RepeatStep<>(traversal.asAdmin());
    repeatStep.setRepeatTraversal(repeatTraversal);
    traversal.asAdmin().addStep(repeatStep);
  }
  return traversal;
}

/**
 * Add a {@link Step} to the end of the traversal. This method should link the step to its next and previous step accordingly.
 *
 * @param step the step to add
 * @param <E2> the output of the step
 * @return the updated traversal
 * @throws IllegalStateException if the {@link TraversalStrategies} have already been applied
 */
public default <E2> Traversal.Admin<S, E2> addStep(final Step<?, E2> step) throws IllegalStateException {
  return this.addStep(this.getSteps().size(), step);
}

@Override
public void addGlobalChildOption(final M pickToken, final Traversal.Admin<S, E> traversalOption) {
  if (this.traversalOptions.containsKey(pickToken))
    this.traversalOptions.get(pickToken).add(traversalOption);
  else
    this.traversalOptions.put(pickToken, new ArrayList<>(Collections.singletonList(traversalOption)));
  traversalOption.addStep(new EndStep(traversalOption));
  if (!this.hasBarrier && !TraversalHelper.getStepsOfAssignableClassRecursively(Barrier.class, traversalOption).isEmpty())
    this.hasBarrier = true;
  this.integrateChild(traversalOption);
}

/**
 * Insert a step after a specified step instance.
 *
 * @param insertStep the step to insert
 * @param beforeStep the step to insert the new step after
 * @param traversal  the traversal on which the action should occur
 */
public static <S, E> void insertAfterStep(final Step<S, E> insertStep, final Step<?, S> beforeStep, final Traversal.Admin<?, ?> traversal) {
  traversal.addStep(stepIndex(beforeStep, traversal) + 1, insertStep);
}

public static <S, E> void removeToTraversal(final Step<S, ?> startStep, final Step<?, E> endStep, final Traversal.Admin<S, E> newTraversal) {
  final Traversal.Admin<?, ?> originalTraversal = startStep.getTraversal();
  Step<?, ?> currentStep = startStep;
  while (currentStep != endStep && !(currentStep instanceof EmptyStep)) {
    final Step<?, ?> temp = currentStep.getNextStep();
    originalTraversal.removeStep(currentStep);
    newTraversal.addStep(currentStep);
    currentStep = temp;
  }
}

@Test
@LoadGraphWith(MODERN)
public void testProfileStrategyCallback() {
  final Traversal<Vertex, TraversalMetrics> t = get_g_V_out_out_profile();
  MockStep mockStep = new MockStep(t.asAdmin());
  t.asAdmin().addStep(3, mockStep);
  TraversalMetrics traversalMetrics = t.next();
  assertTrue(mockStep.callbackCalled);
  if (!onGraphComputer(t.asAdmin())) {
    assertEquals(100, traversalMetrics.getMetrics(3).getCount("bogusCount").longValue());
  }
}

@SuppressWarnings("unchecked")
public void setRepeatTraversal(final Traversal.Admin<S, S> repeatTraversal) {
  if (null != this.repeatTraversal)
    throw new IllegalStateException("The repeat()-step already has its loop section declared: " + this);
  this.repeatTraversal = repeatTraversal; // .clone();
  this.repeatTraversal.addStep(new RepeatEndStep(this.repeatTraversal));
  this.integrateChild(this.repeatTraversal);
}

/**
 * Replace a step with a new step.
 *
 * @param removeStep the step to remove
 * @param insertStep the step to insert
 * @param traversal  the traversal on which the action will occur
 */
public static <S, E> void replaceStep(final Step<S, E> removeStep, final Step<S, E> insertStep, final Traversal.Admin<?, ?> traversal) {
  final int i;
  traversal.removeStep(i = stepIndex(removeStep, traversal));
  traversal.addStep(i, insertStep);
}

public UniGraphUnionStep(Traversal.Admin traversal, UniGraph graph, final Traversal.Admin<?, E>... unionTraversals) {
  super(traversal, graph);
  this.unionTraversals = Arrays.asList(unionTraversals);
  this.unionTraversals.forEach(t -> t.addStep(new UniGraphTraverserStep<>(t)));
}

/**
 * Filter all traversers in the traversal.
 *
 * @return the updated traversal with respective {@link NoneStep}.
 */
public default Traversal<S, E> none() {
  this.asAdmin().getBytecode().addStep(Symbols.none);
  return this.asAdmin().addStep(new NoneStep<>(this.asAdmin()));
}

public static <A, B, C extends Traversal<A, B>> C addEmitToTraversal(final C traversal, final Traversal.Admin<B, ?> emitPredicate) {
  final Step<?, B> step = traversal.asAdmin().getEndStep();
  if (step instanceof RepeatStep && null == ((RepeatStep) step).emitTraversal) {
    ((RepeatStep<B>) step).setEmitTraversal(emitPredicate);
  } else {
    final RepeatStep<B> repeatStep = new RepeatStep<>(traversal.asAdmin());
    repeatStep.setEmitTraversal(emitPredicate);
    traversal.asAdmin().addStep(repeatStep);
  }
  return traversal;
}

public static <A, B, C extends Traversal<A, B>> C addRepeatToTraversal(final C traversal, final Traversal.Admin<B, B> repeatTraversal) {
  final Step<?, B> step = traversal.asAdmin().getEndStep();
  if (step instanceof RepeatStep && null == ((RepeatStep) step).repeatTraversal) {
    ((RepeatStep<B>) step).setRepeatTraversal(repeatTraversal);
  } else {
    final RepeatStep<B> repeatStep = new RepeatStep<>(traversal.asAdmin());
    repeatStep.setRepeatTraversal(repeatTraversal);
    traversal.asAdmin().addStep(repeatStep);
  }
  return traversal;
}

/**
 * Replace a step with a new step.
 *
 * @param removeStep the step to remove
 * @param insertStep the step to insert
 * @param traversal  the traversal on which the action will occur
 */
public static <S, E> void replaceStep(final Step<S, E> removeStep, final Step<S, E> insertStep, final Traversal.Admin<?, ?> traversal) {
  final int i;
  traversal.removeStep(i = stepIndex(removeStep, traversal));
  traversal.addStep(i, insertStep);
}

public static <S, E> void removeToTraversal(final Step<S, ?> startStep, final Step<?, E> endStep, final Traversal.Admin<S, E> newTraversal) {
  final Traversal.Admin<?, ?> originalTraversal = startStep.getTraversal();
  Step<?, ?> currentStep = startStep;
  while (currentStep != endStep && !(currentStep instanceof EmptyStep)) {
    final Step<?, ?> temp = currentStep.getNextStep();
    originalTraversal.removeStep(currentStep);
    newTraversal.addStep(currentStep);
    currentStep = temp;
  }
}