Examples with ShortestPathVertexProgramStep org.apache.tinkerpop.gremlin.process.computer.traversal.step.map.ShortestPathVertexProgramStep used on opensource projects

Example 1 with ShortestPathVertexProgramStep

use of org.apache.tinkerpop.gremlin.process.computer.traversal.step.map.ShortestPathVertexProgramStep in project GraphScope by alibaba.

the class TreeBuilder method visitShortestPathStep.

private TreeNode visitShortestPathStep(ShortestPathVertexProgramStep step, TreeNode prev) {
    Traversal.Admin<?, ?> targetVertexFilter = step.getLocalChildren().get(0);
    Step targetStep = targetVertexFilter.getSteps().get(0);
    if (targetStep instanceof HasStep) {
        List<HasContainer> targetHasContainerList = ((HasStep) targetStep).getHasContainers();
        List<HasContainer> convertContainerList = targetHasContainerList.stream().map(v -> convertHasContainer(v.getKey(), v.getPredicate(), prev.getOutputValueType())).collect(Collectors.toList());
        HasContainer targetHascontainer = convertContainerList.get(0);
        if (prev instanceof SourceTreeNode) {
            List<HasContainer> sourceHasContainerList = ((SourceTreeNode) prev).hasContainerList;
            int idx = sourceHasContainerList.size() - 1;
            if (idx >= 0) {
                HasContainer sourceHasContainer = sourceHasContainerList.get(idx);
                if (targetHascontainer.getKey().equals(sourceHasContainer.getKey())) {
                    HasContainer targetContainer = new HasContainer(targetHascontainer.getKey(), P.within(Lists.newArrayList(sourceHasContainer.getPredicate().getValue(), targetHascontainer.getPredicate().getValue())));
                    ((SourceTreeNode) prev).hasContainerList.set(idx, targetContainer);
                } else {
                    throw new UnsupportedOperationException(targetStep.toString());
                }
            } else {
                // do not support target vertex exists without source vertex
                throw new UnsupportedOperationException(targetStep.toString());
            }
        }
    } else if (targetStep instanceof IdentityStep) {
    } else {
        throw new UnsupportedOperationException(targetStep.toString());
    }
    return new ShortestPathVertexProgramTreeNode(prev, schema, step);
}