Package com.tinkerpop.gremlin.process

Examples of com.tinkerpop.gremlin.process.Step

43
44
45
46
47
48
49
50
51
52
53
54
        if (startStep.startAssignableTo(Vertex.class, Edge.class)) {
            final Element element = ((StartStep<?>) startStep).getStart();
            final String label = startStep.getLabel();
            TraversalHelper.removeStep(startStep, traversal);
            if (TraversalHelper.isLabeled(label)) {
                final Step identityStep = new IdentityStep(traversal);
                identityStep.setLabel(label);
                TraversalHelper.insertStep(identityStep, 0, traversal);
            }
            TraversalHelper.insertStep(new HasStep(traversal, new HasContainer(T.id, Compare.eq, element.id())), 0, traversal);
            TraversalHelper.insertStep(new TinkerGraphStep<>(traversal, element.getClass()), 0, traversal);
        }
View Full Code Here
21
22
23
24
25
26
27
28
29
30
31
    public void apply(final Traversal<?, ?> traversal, final TraversalEngine engine) {
        if(engine.equals(TraversalEngine.STANDARD))
            return;

        if (TraversalHelper.hasStepOfAssignableClass(Comparing.class, traversal)) {
            final Step endStep = TraversalHelper.getEnd(traversal);
            TraversalHelper.getStepsOfAssignableClass(Comparing.class, traversal)
                    .stream()
                    .filter(step -> step != endStep)
                    .forEach(step -> TraversalHelper.removeStep(step, traversal));
        }
View Full Code Here
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
        this.firstKey = null;
        this.secondKey = null;
        this.biPredicate = null;
        this.constraint = constraint;

        final Step startStep = TraversalHelper.getStart(constraint);
        final Step endStep = TraversalHelper.getEnd(constraint);

        this.setPredicate(traverser -> {
            final Map<String, E> map = traverser.get();
            if (!map.containsKey(startStep.getLabel()))
                throw new IllegalArgumentException("The provided key is not in the current map: " + startStep.getLabel());
            final Object startObject = map.get(startStep.getLabel());
            final Object endObject;
            if (TraversalHelper.isLabeled(endStep)) {
                if (!map.containsKey(endStep.getLabel()))
                    throw new IllegalArgumentException("The provided key is not in the current map: " + endStep.getLabel());
                endObject = map.get(endStep.getLabel());
            } else
                endObject = null;

            startStep.addStart(TraversalStrategies.GlobalCache.getStrategies(constraint.getClass()).getTraverserGenerator(constraint, TraversalEngine.STANDARD).generate(startObject, startStep));
            if (null == endObject) {
View Full Code Here
156
157
158
159
160
161
162
163
164
165
166
167
    }

    private static void reLinkSteps(final Traversal<?, ?> traversal) {
        final List<Step> steps = traversal.getSteps();
        for (int i = 0; i < steps.size(); i++) {
            final Step previousStep = i > 0 ? steps.get(i - 1) : null;
            final Step currentStep = steps.get(i);
            final Step nextStep = i < steps.size() - 1 ? steps.get(i + 1) : null;
            currentStep.setPreviousStep(null != previousStep ? previousStep : EmptyStep.instance());
            currentStep.setNextStep(null != nextStep ? nextStep : EmptyStep.instance());
        }
    }
View Full Code Here
181
182
183
184
185
186
187
188
189
190
191
192
        return builder.toString();
    }

    public static String makeTraversalString(final Traversal<?, ?> traversal) {
        final List<Step> temp = new ArrayList<>();
        Step currentStep = TraversalHelper.getStart(traversal);
        while (!(currentStep instanceof EmptyStep)) {
            temp.add(currentStep);
            currentStep = currentStep.getNextStep();
        }
        return temp.toString();
    }
View Full Code Here
198
199
200
201
202
203
204
205
206
207
208
209
210
211
                .isPresent();
    }

    public static List<Step> isolateSteps(final Step<?, ?> from, final Step<?, ?> to) {
        final List<Step> steps = new ArrayList<>();
        Step step = from.getNextStep();
        while (step != to && !(step instanceof EmptyStep)) {
            steps.add(step);
            step = step.getNextStep();
        }
        if (step instanceof EmptyStep)
            steps.clear();
        return steps;
    }
View Full Code Here
44
45
46
47
48
49
50
51
52
    }

    @Override
    public void loadState(final Configuration configuration) {
        final Step step = TraversalHelper.getEnd(TraversalVertexProgram.getTraversalSupplier(configuration).get());
        this.comparator = Optional.ofNullable(step instanceof Comparing ? GraphComputerHelper.chainComparators(((Comparing) step).getComparators()) : null);
        this.reducer = Optional.ofNullable(step instanceof Reducing ? ((Reducing) step).getReducer() : null);
    }
View Full Code Here
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
        int counter = 0;
        for (final UntilStep untilStep : TraversalHelper.getStepsOfClass(UntilStep.class, traversal)) {
            final IdentityStep leftEndStep = new IdentityStep(traversal);
            leftEndStep.setLabel(UNTIL_PREFIX + counter++);
            TraversalHelper.insertBeforeStep(leftEndStep, untilStep, traversal);
            final Step rightEndStep = TraversalHelper.getStep(untilStep.getBreakLabel(), traversal);
            final String rightEndLabel = rightEndStep.getLabel();

            final JumpStep leftEndJumpStep = untilStep.createLeftJumpStep(traversal, rightEndLabel);
            leftEndJumpStep.setLabel(untilStep.getLabel());
            leftEndJumpStep.doWhile = false;
            TraversalHelper.removeStep(untilStep, traversal);
            TraversalHelper.insertAfterStep(leftEndJumpStep, leftEndStep, traversal);

            final JumpStep rightEndJumpStep = untilStep.createRightJumpStep(traversal, leftEndStep.getLabel());
            //new JumpStep(traversal, leftEndStep.getLabel());
            rightEndJumpStep.setLabel(rightEndLabel);
            rightEndStep.setLabel(Graph.System.system(UUID.randomUUID().toString()));
            TraversalHelper.insertAfterStep(rightEndJumpStep, rightEndStep, traversal);
        }
    }
View Full Code Here
22
23
24
25
26
27
28
29
30
31
32
33
34
    }

    @Override
    public void apply(final Traversal<?, ?> traversal, final TraversalEngine engine) {
        TraversalHelper.getStepsOfClass(LocalRangeStep.class, traversal).forEach(localRangeStep -> {
            Step previousStep = localRangeStep.getPreviousStep();
            while (!previousStep.equals(EmptyStep.instance()) && !(previousStep instanceof PropertiesStep) && !(previousStep instanceof VertexStep)) {
                previousStep = previousStep.getPreviousStep();
                // TODO: check for not filtering/sideEffect steps and throw an exception?
            }
            if (previousStep instanceof VertexStep) {
                VertexStep vertexStep = (VertexStep) previousStep;
                if (vertexStep.getReturnClass().equals(Edge.class)) {
View Full Code Here
34
35
36
37
38
39
40
41
42
43
44
        this.memory = result.memory();
        this.attachElements = attachElements;
        this.memory.keys().forEach(key -> traversal.sideEffects().set(key, this.memory.get(key)));
        this.computerTraversal = traversalVertexProgram.getTraversal();

        final Step endStep = TraversalHelper.getEnd(this.computerTraversal);
        this.traversers = endStep instanceof SideEffectCapStep ?
                new SingleIterator<>(new SimpleTraverser<>((S) this.memory.get(((SideEffectCapStep) endStep).getSideEffectKey()), this.traversal.sideEffects())) :
                (Iterator<Traverser.Admin<S>>) this.memory.get(TraverserMapReduce.TRAVERSERS);

    }
View Full Code Here
TOP

Related Classes of com.tinkerpop.gremlin.process.Step

  • com.tinkerpop.gremlin.giraph.process.graph.strategy.GiraphElementStepStrategy
  • com.tinkerpop.gremlin.neo4j.process.graph.strategy.Neo4jGraphStepStrategy
  • com.tinkerpop.gremlin.process.computer.traversal.step.map.ComputerResultStep
  • com.tinkerpop.gremlin.process.computer.traversal.step.sideEffect.mapreduce.TraverserMapReduce
  • com.tinkerpop.gremlin.process.graph.step.filter.WhereStep
  • com.tinkerpop.gremlin.process.graph.strategy.ChooseLinearStrategy
  • com.tinkerpop.gremlin.process.graph.strategy.ComparingRemovalStrategy
  • com.tinkerpop.gremlin.process.graph.strategy.DedupOptimizerStrategy
  • com.tinkerpop.gremlin.process.graph.strategy.LocalRangeStrategy
  • com.tinkerpop.gremlin.process.graph.strategy.MatchWhereStrategy
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.