• Home
• com.github.unipop-graph
• unipop-core
• 0.2
• source code
• UniGraphVertexStepStrategy.java

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

org.unipop.process.vertex.UniGraphVertexStepStrategy Maven / Gradle / Ivy

package org.unipop.process.vertex;

import org.apache.tinkerpop.gremlin.process.traversal.Traversal;
import org.apache.tinkerpop.gremlin.process.traversal.TraversalStrategy;
import org.apache.tinkerpop.gremlin.process.traversal.step.TraversalParent;
import org.apache.tinkerpop.gremlin.process.traversal.step.map.VertexStep;
import org.apache.tinkerpop.gremlin.process.traversal.strategy.AbstractTraversalStrategy;
import org.apache.tinkerpop.gremlin.process.traversal.util.TraversalHelper;
import org.apache.tinkerpop.gremlin.structure.Graph;
import org.unipop.process.predicate.PredicatesUtil;
import org.unipop.structure.UniGraph;


public class UniGraphVertexStepStrategy extends AbstractTraversalStrategy implements TraversalStrategy.ProviderOptimizationStrategy {

    @Override
    public void apply(Traversal.Admin traversal) {
        if(TraversalHelper.onGraphComputer(traversal)) return;

        Graph graph = traversal.getGraph().get();
        if(!(graph instanceof UniGraph)) {
            return;
        }

        UniGraph uniGraph = (UniGraph) graph;

        TraversalHelper.getStepsOfAssignableClassRecursively(VertexStep.class, traversal).forEach(vertexStep -> {
            if(TraversalHelper.stepIndex(vertexStep, traversal) != -1) {
                UniGraphVertexStep uniGraphVertexStep = new UniGraphVertexStep<>(vertexStep, uniGraph, uniGraph.getControllerManager());
                TraversalHelper.replaceStep(vertexStep, uniGraphVertexStep, traversal);
                if (vertexStep.returnsEdge()) PredicatesUtil.collectPredicates(uniGraphVertexStep, traversal);
            }
            else{
                TraversalHelper.getStepsOfAssignableClass(TraversalParent.class, traversal).forEach(traversalParent -> {
                    traversalParent.getLocalChildren().forEach(child -> {
                        if(TraversalHelper.stepIndex(vertexStep, child) != -1) {
                            UniGraphVertexStep uniGraphVertexStep = new UniGraphVertexStep<>(vertexStep, uniGraph, uniGraph.getControllerManager());
                            TraversalHelper.replaceStep(vertexStep, uniGraphVertexStep, child);
                            if (vertexStep.returnsEdge()) PredicatesUtil.collectPredicates(uniGraphVertexStep, child);
                        }
                    });
                    traversalParent.getGlobalChildren().forEach(child -> {
                        if(TraversalHelper.stepIndex(vertexStep, child) != -1) {
                            UniGraphVertexStep uniGraphVertexStep = new UniGraphVertexStep<>(vertexStep, uniGraph, uniGraph.getControllerManager());
                            TraversalHelper.replaceStep(vertexStep, uniGraphVertexStep, child);
                            if (vertexStep.returnsEdge()) PredicatesUtil.collectPredicates(uniGraphVertexStep, child);
                        }
                        else if (TraversalHelper.hasStepOfAssignableClass(TraversalParent.class, child)){
                            TraversalHelper.getStepsOfAssignableClass(TraversalParent.class, child).forEach(traversalParent1 -> {
                                traversalParent.getLocalChildren().forEach(child1 -> {
                                    if(TraversalHelper.stepIndex(vertexStep, child1) != -1) {
                                        UniGraphVertexStep uniGraphVertexStep = new UniGraphVertexStep<>(vertexStep, uniGraph, uniGraph.getControllerManager());
                                        TraversalHelper.replaceStep(vertexStep, uniGraphVertexStep, child1);
                                        if (vertexStep.returnsEdge()) PredicatesUtil.collectPredicates(uniGraphVertexStep, child1);
                                    }
                                });
                                traversalParent.getGlobalChildren().forEach(child1 -> {
                                    if(TraversalHelper.stepIndex(vertexStep, child1) != -1) {
                                        UniGraphVertexStep uniGraphVertexStep = new UniGraphVertexStep<>(vertexStep, uniGraph, uniGraph.getControllerManager());
                                        TraversalHelper.replaceStep(vertexStep, uniGraphVertexStep, child1);
                                        if (vertexStep.returnsEdge()) PredicatesUtil.collectPredicates(uniGraphVertexStep, child1);
                                    }
                                });
                            });
                        }
                    });
                });
            }
        });
    }
}