private static Direction getDirection(final Traversal.Admin<Vertex, Edge> incidentTraversal) { final VertexStep step = TraversalHelper.getLastStepOfAssignableClass(VertexStep.class, incidentTraversal).get(); return step.getDirection(); } }
private static Direction getOppositeDirection(final Traversal.Admin<Vertex, Edge> incidentTraversal) { final VertexStep step = TraversalHelper.getLastStepOfAssignableClass(VertexStep.class, incidentTraversal).get(); return step.getDirection().opposite(); } }
TraversalHelper.getLastStepOfAssignableClass(VertexComputing.class, traversal).ifPresent(step -> { if (step instanceof TraversalVertexProgramStep) { final ComputerResultStep computerResultStep = new ComputerResultStep<>(traversal);
private static Direction getDirection(Traversal.Admin<Vertex, Edge> incidentTraversal) { VertexStep<?> step = TraversalHelper.getLastStepOfAssignableClass(VertexStep.class, incidentTraversal).get(); return step.getDirection(); } }
private static Direction getDirection(final Traversal.Admin<Vertex, Edge> incidentTraversal) { final VertexStep step = TraversalHelper.getLastStepOfAssignableClass(VertexStep.class, incidentTraversal).get(); return step.getDirection(); } }
private static Direction getDirection(final Traversal.Admin<Vertex, Edge> incidentTraversal) { final VertexStep step = TraversalHelper.getLastStepOfAssignableClass(VertexStep.class, incidentTraversal).get(); return step.getDirection(); } }
private static Direction getOppositeDirection(final Traversal.Admin<Vertex, Edge> incidentTraversal) { final VertexStep step = TraversalHelper.getLastStepOfAssignableClass(VertexStep.class, incidentTraversal).get(); return step.getDirection().opposite(); } }
@Override public void apply(Traversal.Admin<?, ?> traversal) { if (!(traversal.getGraph().orElseThrow(IllegalStateException::new) instanceof SqlgGraph)) { return; } if (!SqlgTraversalUtil.mayOptimize(traversal)) { return; } Optional<DropStep> dropStepOptional = TraversalHelper.getLastStepOfAssignableClass(DropStep.class, traversal); if (dropStepOptional.isPresent()) { DropStep<?> dropStep = dropStepOptional.get(); TraversalHelper.replaceStep(dropStep, new SqlgDropStepBarrier<>(traversal, dropStep.getMutatingCallbackRegistry()), traversal); } }
@Override public void apply(Traversal.Admin<?, ?> traversal) { if (!(traversal.getGraph().orElseThrow(IllegalStateException::new) instanceof SqlgGraph)) { return; } if (!SqlgTraversalUtil.mayOptimize(traversal)) { return; } Optional<DropStep> dropStepOptional = TraversalHelper.getLastStepOfAssignableClass(DropStep.class, traversal); if (dropStepOptional.isPresent()) { DropStep<?> dropStep = dropStepOptional.get(); TraversalHelper.replaceStep(dropStep, new SqlgDropStepBarrier<>(traversal, dropStep.getMutatingCallbackRegistry()), traversal); } }
Traversal.Admin[] traversals = (Traversal.Admin[]) unionStep.getGlobalChildren().toArray(new Traversal.Admin[0]); for (Traversal.Admin admin : traversals) { if (TraversalHelper.getLastStepOfAssignableClass(ReducingBarrierStep.class, admin).isPresent() || traversal.getParent() instanceof RepeatStep) return;
Optional<LocalStep> localStepOptional = TraversalHelper.getLastStepOfAssignableClass(LocalStep.class, traversal); if (localStepOptional.isPresent()) { LocalStep<?, ?> localStep = localStepOptional.get();
Optional<LocalStep> localStepOptional = TraversalHelper.getLastStepOfAssignableClass(LocalStep.class, traversal); if (localStepOptional.isPresent()) { LocalStep<?, ?> localStep = localStepOptional.get();
Optional<RepeatStep> repeatStepOptional = TraversalHelper.getLastStepOfAssignableClass(RepeatStep.class, traversal); if (repeatStepOptional.isPresent()) { RepeatStep<?> repeatStep = repeatStepOptional.get();
Optional<RepeatStep> repeatStepOptional = TraversalHelper.getLastStepOfAssignableClass(RepeatStep.class, traversal); if (repeatStepOptional.isPresent()) { RepeatStep<?> repeatStep = repeatStepOptional.get();
Optional<PropertyFetcher> lastStepOfAssignableClass = TraversalHelper.getLastStepOfAssignableClass(PropertyFetcher.class, repeatTraversal); if (lastStepOfAssignableClass.isPresent()) { lastStepOfAssignableClass.get().fetchAllKeys(); }); Optional<PropertyFetcher> lastStepOfAssignableClass = TraversalHelper.getLastStepOfAssignableClass(PropertyFetcher.class, traversal); if (lastStepOfAssignableClass.isPresent()) { lastStepOfAssignableClass.get().fetchAllKeys();
TraversalHelper.getLastStepOfAssignableClass(VertexComputing.class, traversal).ifPresent(step -> { if (step instanceof TraversalVertexProgramStep) { final ComputerResultStep computerResultStep = new ComputerResultStep<>(traversal);