Examples with SqlgOptionalStepBarrier org.umlg.sqlg.step.barrier.SqlgOptionalStepBarrier used on opensource projects

Example 1 with SqlgOptionalStepBarrier

use of org.umlg.sqlg.step.barrier.SqlgOptionalStepBarrier in project sqlg by pietermartin.

the class SqlgOptionalStepStrategy method apply.

@Override
public void apply(final Traversal.Admin<?, ?> traversal) {
    // noinspection OptionalGetWithoutIsPresent
    if (!(traversal.getGraph().get() instanceof SqlgGraph)) {
        return;
    }
    List<OptionalStep> optionalSteps = TraversalHelper.getStepsOfAssignableClass(OptionalStep.class, traversal);
    for (OptionalStep<S> optionalStep : optionalSteps) {
        // The predicate branch step is a local traversal.
        // As such if it contains a ReducingBarrierStep the SqlgBranchStepBarrier will not work.
        Traversal.Admin<S, S> optionalTraversal = optionalStep.getLocalChildren().get(0);
        List<ReducingBarrierStep> reducingBarrierSteps = TraversalHelper.getStepsOfAssignableClass(ReducingBarrierStep.class, optionalTraversal);
        if (!reducingBarrierSteps.isEmpty()) {
            continue;
        }
        SqlgOptionalStepBarrier sqlgOptionalStepBarrier = new SqlgOptionalStepBarrier<>(traversal, optionalTraversal);
        for (String label : optionalStep.getLabels()) {
            sqlgOptionalStepBarrier.addLabel(label);
        }
        TraversalHelper.replaceStep(optionalStep, sqlgOptionalStepBarrier, optionalStep.getTraversal());
    }
}

Example 2 with SqlgOptionalStepBarrier

use of org.umlg.sqlg.step.barrier.SqlgOptionalStepBarrier in project sqlg by pietermartin.

the class TestLocalVertexStepOptionalWithOrder method testUmlgRequirementWithRange.

@Test
public void testUmlgRequirementWithRange() {
    Vertex a1 = this.sqlgGraph.addVertex(T.label, "A", "name", "a1");
    Vertex a2 = this.sqlgGraph.addVertex(T.label, "A", "name", "a2");
    Vertex b1 = this.sqlgGraph.addVertex(T.label, "B", "name", "b1");
    Vertex b2 = this.sqlgGraph.addVertex(T.label, "B", "name", "b2");
    Vertex b3 = this.sqlgGraph.addVertex(T.label, "B", "name", "b3");
    Vertex bb1 = this.sqlgGraph.addVertex(T.label, "BB", "name", "bb1");
    Vertex bb2 = this.sqlgGraph.addVertex(T.label, "BB", "name", "bb2");
    Vertex bb3 = this.sqlgGraph.addVertex(T.label, "BB", "name", "bb3");
    a1.addEdge("ab", b1, "order", 3);
    a1.addEdge("ab", b2, "order", 2);
    a1.addEdge("ab", b3, "order", 1);
    a1.addEdge("abb", bb1, "order", 3);
    a1.addEdge("abb", bb2, "order", 2);
    a1.addEdge("abb", bb3, "order", 1);
    Vertex c1 = this.sqlgGraph.addVertex(T.label, "C", "name", "c1");
    Vertex c2 = this.sqlgGraph.addVertex(T.label, "C", "name", "c2");
    Vertex c3 = this.sqlgGraph.addVertex(T.label, "C", "name", "c3");
    b1.addEdge("bc", c1, "order", 1);
    b1.addEdge("bc", c2, "order", 2);
    b1.addEdge("bc", c3, "order", 3);
    Vertex cc1 = this.sqlgGraph.addVertex(T.label, "CC", "name", "cc1");
    Vertex cc2 = this.sqlgGraph.addVertex(T.label, "CC", "name", "cc2");
    Vertex cc3 = this.sqlgGraph.addVertex(T.label, "CC", "name", "cc3");
    b1.addEdge("bcc", cc1, "order", 3);
    b1.addEdge("bcc", cc2, "order", 2);
    b1.addEdge("bcc", cc3, "order", 1);
    DefaultGraphTraversal<Vertex, Path> traversal = (DefaultGraphTraversal<Vertex, Path>) sqlgGraph.traversal().V().hasLabel("A").as("a").order().by("name", Order.decr).local(__.optional(__.outE().as("e1").inV().as("b").order().by(__.select("a").by(T.id)).by(T.label).by(__.select("e1").by("order")).limit(1).local(__.optional(__.outE().as("e2").inV().order().by(__.select("b").by(T.id)).by(T.label).by(__.select("e2").by("order")))))).path();
    Assert.assertEquals(5, traversal.getSteps().size());
    List<Path> paths = traversal.toList();
    Assert.assertEquals(4, traversal.getSteps().size());
    Assert.assertTrue(traversal.getSteps().get(2) instanceof LocalStep);
    LocalStep localStep = (LocalStep) traversal.getSteps().get(2);
    DefaultGraphTraversal<Vertex, Vertex> t = (DefaultGraphTraversal<Vertex, Vertex>) localStep.getLocalChildren().get(0);
    // First optional is a non optimized, optimized SqlgChooseBarrierStep
    Assert.assertEquals(1, t.getSteps().size());
    Assert.assertTrue(t.getSteps().get(0) instanceof SqlgOptionalStepBarrier);
    SqlgOptionalStepBarrier sqlgOptionalStepBarrier = (SqlgOptionalStepBarrier) t.getSteps().get(0);
    Traversal.Admin<?, ?> optionalTraversal = (Traversal.Admin<?, ?>) sqlgOptionalStepBarrier.getLocalChildren().get(0);
    Assert.assertEquals(2, optionalTraversal.getSteps().size());
    Assert.assertTrue(optionalTraversal.getSteps().get(0) instanceof SqlgVertexStep);
    Assert.assertTrue(optionalTraversal.getSteps().get(1) instanceof SqlgLocalStepBarrier);
    SqlgLocalStepBarrier sqlgLocalStepBarrier1 = (SqlgLocalStepBarrier) optionalTraversal.getSteps().get(1);
    t = (DefaultGraphTraversal<Vertex, Vertex>) sqlgLocalStepBarrier1.getLocalChildren().get(0);
    // Second optional is a optimized
    Assert.assertEquals(1, t.getSteps().size());
    Assert.assertEquals(2, paths.size());
    Path pathX = paths.get(0);
    Assert.assertEquals(1, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a2));
    pathX = paths.get(1);
    Assert.assertEquals(3, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a1));
    Assert.assertTrue(pathX.get(2).equals(b3));
}

Example 3 with SqlgOptionalStepBarrier

use of org.umlg.sqlg.step.barrier.SqlgOptionalStepBarrier in project sqlg by pietermartin.

the class TestLocalVertexStepOptionalWithOrder method testUmlgRequirement.

/**
 * optionals wrapped in local steps.
 * The idea is that each traversed out/in edge needs to be sorted
 */
@Test
public void testUmlgRequirement() {
    Vertex a1 = this.sqlgGraph.addVertex(T.label, "A", "name", "a1");
    Vertex a2 = this.sqlgGraph.addVertex(T.label, "A", "name", "a2");
    Vertex b1 = this.sqlgGraph.addVertex(T.label, "B", "name", "b1");
    Vertex b2 = this.sqlgGraph.addVertex(T.label, "B", "name", "b2");
    Vertex b3 = this.sqlgGraph.addVertex(T.label, "B", "name", "b3");
    Vertex bb1 = this.sqlgGraph.addVertex(T.label, "BB", "name", "bb1");
    Vertex bb2 = this.sqlgGraph.addVertex(T.label, "BB", "name", "bb2");
    Vertex bb3 = this.sqlgGraph.addVertex(T.label, "BB", "name", "bb3");
    a1.addEdge("ab", b1, "order", 3);
    a1.addEdge("ab", b2, "order", 2);
    a1.addEdge("ab", b3, "order", 1);
    a1.addEdge("abb", bb1, "order", 3);
    a1.addEdge("abb", bb2, "order", 2);
    a1.addEdge("abb", bb3, "order", 1);
    Vertex c1 = this.sqlgGraph.addVertex(T.label, "C", "name", "c1");
    Vertex c2 = this.sqlgGraph.addVertex(T.label, "C", "name", "c2");
    Vertex c3 = this.sqlgGraph.addVertex(T.label, "C", "name", "c3");
    b1.addEdge("bc", c1, "order", 1);
    b1.addEdge("bc", c2, "order", 2);
    b1.addEdge("bc", c3, "order", 3);
    Vertex cc1 = this.sqlgGraph.addVertex(T.label, "CC", "name", "cc1");
    Vertex cc2 = this.sqlgGraph.addVertex(T.label, "CC", "name", "cc2");
    Vertex cc3 = this.sqlgGraph.addVertex(T.label, "CC", "name", "cc3");
    b1.addEdge("bcc", cc1, "order", 3);
    b1.addEdge("bcc", cc2, "order", 2);
    b1.addEdge("bcc", cc3, "order", 1);
    this.sqlgGraph.tx().commit();
    DefaultGraphTraversal<Vertex, Path> traversal = (DefaultGraphTraversal<Vertex, Path>) sqlgGraph.traversal().V().hasLabel("A").as("a").order().by("name", Order.decr).local(__.optional(__.outE().as("e1").inV().as("b").order().by(T.label).by(__.select("e1").by("order")).local(__.optional(__.outE().as("e2").inV().order().by(T.label).by(__.select("e2").by("order")))))).path();
    Assert.assertEquals(5, traversal.getSteps().size());
    List<Path> paths = traversal.toList();
    Assert.assertEquals(4, traversal.getSteps().size());
    Assert.assertTrue(traversal.getSteps().get(2) instanceof SqlgLocalStepBarrier);
    SqlgLocalStepBarrier sqlgLocalStepBarrier = (SqlgLocalStepBarrier) traversal.getSteps().get(2);
    DefaultGraphTraversal<Vertex, Vertex> t = (DefaultGraphTraversal<Vertex, Vertex>) sqlgLocalStepBarrier.getLocalChildren().get(0);
    // First optional is a non optimized, optimized SqlgOptionalBarrierStep
    Assert.assertEquals(1, t.getSteps().size());
    Assert.assertTrue(t.getSteps().get(0) instanceof SqlgOptionalStepBarrier);
    SqlgOptionalStepBarrier sqlgOptionalStepBarrier = (SqlgOptionalStepBarrier) t.getSteps().get(0);
    Traversal.Admin<?, ?> optionalTraversal = (Traversal.Admin<?, ?>) sqlgOptionalStepBarrier.getLocalChildren().get(0);
    Assert.assertEquals(2, optionalTraversal.getSteps().size());
    Assert.assertTrue(optionalTraversal.getSteps().get(0) instanceof SqlgVertexStep);
    Assert.assertTrue(optionalTraversal.getSteps().get(1) instanceof SqlgLocalStepBarrier);
    SqlgLocalStepBarrier sqlgLocalStepBarrier1 = (SqlgLocalStepBarrier) optionalTraversal.getSteps().get(1);
    t = (DefaultGraphTraversal<Vertex, Vertex>) sqlgLocalStepBarrier.getLocalChildren().get(0);
    // Second optional is a optimized
    Assert.assertEquals(1, t.getSteps().size());
    Assert.assertEquals(12, paths.size());
    Path pathX = paths.get(0);
    Assert.assertEquals(1, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a2));
    pathX = paths.get(1);
    Assert.assertEquals(3, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a1));
    Assert.assertTrue(pathX.get(2).equals(b3));
    pathX = paths.get(2);
    Assert.assertEquals(3, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a1));
    Assert.assertTrue(pathX.get(2).equals(b2));
    pathX = paths.get(3);
    Assert.assertEquals(5, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a1));
    Assert.assertTrue(pathX.get(2).equals(b1));
    Assert.assertTrue(pathX.get(4).equals(c1));
    pathX = paths.get(4);
    Assert.assertEquals(5, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a1));
    Assert.assertTrue(pathX.get(2).equals(b1));
    Assert.assertTrue(pathX.get(4).equals(c2));
    pathX = paths.get(5);
    Assert.assertEquals(5, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a1));
    Assert.assertTrue(pathX.get(2).equals(b1));
    Assert.assertTrue(pathX.get(4).equals(c3));
    pathX = paths.get(6);
    Assert.assertEquals(5, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a1));
    Assert.assertTrue(pathX.get(2).equals(b1));
    Assert.assertTrue(pathX.get(4).equals(cc3));
    pathX = paths.get(7);
    Assert.assertEquals(5, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a1));
    Assert.assertTrue(pathX.get(2).equals(b1));
    Assert.assertTrue(pathX.get(4).equals(cc2));
    pathX = paths.get(8);
    Assert.assertEquals(5, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a1));
    Assert.assertTrue(pathX.get(2).equals(b1));
    Assert.assertTrue(pathX.get(4).equals(cc1));
    pathX = paths.get(9);
    Assert.assertEquals(3, pathX.size());
    Assert.assertTrue(pathX.get(0).equals(a1));
    for (Path path : paths) {
        for (Object v : path.objects()) {
            Element vertex = (Element) v;
            if (vertex instanceof Vertex) {
                System.out.print(vertex.<String>value("name"));
                System.out.print(" - ");
            }
        }
    }
}

Example 4 with SqlgOptionalStepBarrier

use of org.umlg.sqlg.step.barrier.SqlgOptionalStepBarrier in project sqlg by pietermartin.

the class TestOptionalWithOrder method testOptionalWithOrderAndRange2.

@Test
public void testOptionalWithOrderAndRange2() {
    Vertex a1 = this.sqlgGraph.addVertex(T.label, "A", "name", "a");
    Vertex a2 = this.sqlgGraph.addVertex(T.label, "A", "name", "aa");
    Vertex a3 = this.sqlgGraph.addVertex(T.label, "A", "name", "aaa");
    Vertex b1 = this.sqlgGraph.addVertex(T.label, "B", "name", "d");
    Vertex b2 = this.sqlgGraph.addVertex(T.label, "B", "name", "c");
    Vertex b3 = this.sqlgGraph.addVertex(T.label, "B", "name", "b");
    Vertex bb1 = this.sqlgGraph.addVertex(T.label, "BB", "name", "g");
    Vertex bb2 = this.sqlgGraph.addVertex(T.label, "BB", "name", "f");
    Vertex bb3 = this.sqlgGraph.addVertex(T.label, "BB", "name", "e");
    Vertex c1 = this.sqlgGraph.addVertex(T.label, "C", "name", "h");
    Vertex c2 = this.sqlgGraph.addVertex(T.label, "C", "name", "i");
    Vertex c3 = this.sqlgGraph.addVertex(T.label, "C", "name", "j");
    Vertex cc1 = this.sqlgGraph.addVertex(T.label, "CC", "name", "k");
    Vertex cc2 = this.sqlgGraph.addVertex(T.label, "CC", "name", "l");
    Vertex cc3 = this.sqlgGraph.addVertex(T.label, "CC", "name", "m");
    a1.addEdge("ab", b1);
    a1.addEdge("ab", b2);
    a1.addEdge("ab", b3);
    a1.addEdge("abb", bb1);
    a1.addEdge("abb", bb2);
    a1.addEdge("abb", bb3);
    b1.addEdge("bc", c1);
    b1.addEdge("bc", c2);
    b1.addEdge("bc", c3);
    b2.addEdge("bcc", cc1);
    b2.addEdge("bcc", cc2);
    b2.addEdge("bcc", cc3);
    this.sqlgGraph.tx().commit();
    DefaultGraphTraversal<Vertex, Path> traversal = (DefaultGraphTraversal<Vertex, Path>) this.sqlgGraph.traversal().V().hasLabel("A").optional(__.out().order().by("name").range(1, 2).optional(__.out().order().by("name", Order.decr).range(2, 3))).path();
    Assert.assertEquals(4, traversal.getSteps().size());
    List<Path> paths = traversal.toList();
    // This query is no fully optimized.
    // The range messes it up, so it has a SqlgVertexStep
    assertStep(traversal.getSteps().get(0), true, false, false, true);
    Step<?, ?> step = traversal.getSteps().get(1);
    Assert.assertTrue(step instanceof SqlgOptionalStepBarrier);
    // SqlgOptionalStepBarrier<?,?,?> sqlgOptionalStepBarrier = (SqlgOptionalStepBarrier<?, ?, ?>) step;
    SqlgOptionalStepBarrier<?> sqlgOptionalStepBarrier = (SqlgOptionalStepBarrier<?>) step;
    Traversal.Admin<?, ?> traversal1 = sqlgOptionalStepBarrier.getLocalChildren().get(0);
    Assert.assertTrue(traversal1.getSteps().get(0) instanceof SqlgVertexStep);
    assertStep(traversal1.getSteps().get(0), false, true, true, true);
    // There is another SqlgVertexStep but it is not being asserted
    Assert.assertEquals(3, paths.size());
    List<Path> pathsOfLength1 = paths.stream().filter(p -> p.size() == 1).collect(Collectors.toList());
    Assert.assertEquals(2, pathsOfLength1.size());
    List<Path> pathsOfLength3 = paths.stream().filter(p -> p.size() == 3).collect(Collectors.toList());
    Assert.assertEquals(1, pathsOfLength3.size());
    Vertex v = (Vertex) pathsOfLength3.get(0).objects().get(2);
    Assert.assertEquals("k", v.value("name"));
}