| /* |
| * Licensed to the Apache Software Foundation (ASF) under one |
| * or more contributor license agreements. See the NOTICE file |
| * distributed with this work for additional information |
| * regarding copyright ownership. The ASF licenses this file |
| * to you under the Apache License, Version 2.0 (the |
| * "License"); you may not use this file except in compliance |
| * with the License. You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, |
| * software distributed under the License is distributed on an |
| * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY |
| * KIND, either express or implied. See the License for the |
| * specific language governing permissions and limitations |
| * under the License. |
| */ |
| |
| package org.apache.tinkerpop.gremlin.process.computer.traversal.step.map; |
| |
| import org.apache.tinkerpop.gremlin.process.computer.GraphFilter; |
| import org.apache.tinkerpop.gremlin.process.computer.Memory; |
| import org.apache.tinkerpop.gremlin.process.computer.traversal.MemoryTraversalSideEffects; |
| import org.apache.tinkerpop.gremlin.process.computer.traversal.TraversalVertexProgram; |
| import org.apache.tinkerpop.gremlin.process.traversal.Traversal; |
| import org.apache.tinkerpop.gremlin.process.traversal.TraversalStrategies; |
| import org.apache.tinkerpop.gremlin.process.traversal.TraversalStrategy; |
| import org.apache.tinkerpop.gremlin.process.traversal.step.TraversalParent; |
| import org.apache.tinkerpop.gremlin.process.traversal.traverser.TraverserRequirement; |
| import org.apache.tinkerpop.gremlin.process.traversal.util.PureTraversal; |
| import org.apache.tinkerpop.gremlin.structure.Graph; |
| import org.apache.tinkerpop.gremlin.structure.util.StringFactory; |
| import org.apache.tinkerpop.gremlin.util.iterator.IteratorUtils; |
| |
| import java.util.Collections; |
| import java.util.List; |
| import java.util.Set; |
| |
| /** |
| * @author Marko A. Rodriguez (http://markorodriguez.com) |
| */ |
| public final class TraversalVertexProgramStep extends VertexProgramStep implements TraversalParent { |
| |
| public PureTraversal<?, ?> computerTraversal; |
| |
| public TraversalVertexProgramStep(final Traversal.Admin traversal, final Traversal.Admin<?, ?> computerTraversal) { |
| super(traversal); |
| this.computerTraversal = new PureTraversal<>(computerTraversal); |
| this.integrateChild(this.computerTraversal.get()); |
| } |
| |
| public List<Traversal.Admin<?, ?>> getGlobalChildren() { |
| return Collections.singletonList(this.computerTraversal.get()); |
| } |
| |
| public void setComputerTraversal(final Traversal.Admin<?,?> computerTraversal) { |
| this.computerTraversal = new PureTraversal<>(computerTraversal); |
| this.integrateChild(this.computerTraversal.get()); |
| } |
| |
| @Override |
| public String toString() { |
| return StringFactory.stepString(this, this.computerTraversal.get(), new GraphFilter(this.computer)); |
| } |
| |
| @Override |
| public Set<TraverserRequirement> getRequirements() { |
| return TraversalParent.super.getSelfAndChildRequirements(TraverserRequirement.BULK); |
| } |
| |
| @Override |
| public TraversalVertexProgram generateProgram(final Graph graph, final Memory memory) { |
| final Traversal.Admin<?, ?> computerSpecificTraversal = this.computerTraversal.getPure(); |
| final TraversalStrategies computerSpecificStrategies = this.getTraversal().getStrategies().clone(); |
| |
| IteratorUtils.filter(TraversalStrategies.GlobalCache.getStrategies(graph.getClass()).toList(), |
| s -> s instanceof TraversalStrategy.ProviderOptimizationStrategy).forEach(computerSpecificStrategies::addStrategies); |
| |
| computerSpecificTraversal.setStrategies(computerSpecificStrategies); |
| computerSpecificTraversal.setSideEffects(new MemoryTraversalSideEffects(this.getTraversal().getSideEffects())); |
| computerSpecificTraversal.setParent(this); |
| final TraversalVertexProgram.Builder builder = TraversalVertexProgram.build().traversal(computerSpecificTraversal); |
| if (memory.exists(TraversalVertexProgram.HALTED_TRAVERSERS)) |
| builder.haltedTraversers(memory.get(TraversalVertexProgram.HALTED_TRAVERSERS)); |
| return builder.create(graph); |
| } |
| |
| @Override |
| public TraversalVertexProgramStep clone() { |
| final TraversalVertexProgramStep clone = (TraversalVertexProgramStep) super.clone(); |
| clone.computerTraversal = this.computerTraversal.clone(); |
| return clone; |
| } |
| |
| @Override |
| public void setTraversal(final Traversal.Admin<?, ?> parentTraversal) { |
| super.setTraversal(parentTraversal); |
| this.integrateChild(this.computerTraversal.get()); |
| } |
| |
| /*@Override |
| public int hashCode() { |
| return super.hashCode() ^ this.computerTraversal.hashCode(); |
| }*/ |
| |
| } |