Examples with Order org.apache.tinkerpop.gremlin.process.traversal.Order used on opensource projects

Example 11 with Order

use of org.apache.tinkerpop.gremlin.process.traversal.Order in project unipop by unipop-graph.

the class AbstractDocSchema method createSearch.

protected SearchSourceBuilder createSearch(SearchQuery<E> query, QueryBuilder queryBuilder) {
    if (queryBuilder == null)
        return null;
    SearchSourceBuilder searchSourceBuilder = new SearchSourceBuilder().query(queryBuilder).size(query.getLimit() == -1 ? 10000 : query.getLimit());
    if (query.getPropertyKeys() == null)
        searchSourceBuilder.fetchSource(true);
    else {
        Set<String> fields = toFields(query.getPropertyKeys());
        if (fields.size() == 0)
            searchSourceBuilder.fetchSource(false);
        else
            searchSourceBuilder.fetchSource(fields.toArray(new String[fields.size()]), null);
    }
    List<Pair<String, Order>> orders = query.getOrders();
    if (orders != null) {
        orders.forEach(order -> {
            Order orderValue = order.getValue1();
            switch(orderValue) {
                case decr:
                    searchSourceBuilder.sort(getFieldByPropertyKey(order.getValue0()), SortOrder.DESC);
                    break;
                case incr:
                    searchSourceBuilder.sort(getFieldByPropertyKey(order.getValue0()), SortOrder.ASC);
                    break;
                case shuffle:
                    break;
            }
        });
    }
    return searchSourceBuilder;
}

Example 12 with Order

use of org.apache.tinkerpop.gremlin.process.traversal.Order in project unipop by unipop-graph.

the class AbstractRowSchema method getSearch.

@Override
public Select getSearch(SearchQuery<E> query, PredicatesHolder predicatesHolder) {
    if (predicatesHolder.isAborted()) {
        return null;
    }
    Condition conditions = new JdbcPredicatesTranslator().translate(predicatesHolder);
    int finalLimit = query.getLimit() < 0 ? Integer.MAX_VALUE : query.getLimit();
    SelectConditionStep<Record> where = createSqlQuery(query.getPropertyKeys()).where(conditions);
    List<Pair<String, Order>> orders = query.getOrders();
    if (orders != null) {
        List<SortField<Object>> orderValues = orders.stream().filter(order -> !order.getValue1().equals(Order.shuffle)).filter(order -> getFieldByPropertyKey(order.getValue0()) != null).map(order -> order.getValue1().equals(Order.incr) ? field(getFieldByPropertyKey(order.getValue0())).asc() : field(getFieldByPropertyKey(order.getValue0())).desc()).collect(Collectors.toList());
        if (orderValues.size() > 0)
            return where.orderBy(orderValues).limit(finalLimit);
    }
    return where.limit(finalLimit);
}

Example 13 with Order

use of org.apache.tinkerpop.gremlin.process.traversal.Order in project janusgraph by JanusGraph.

the class HasStepFolder method validJanusGraphOrder.

static boolean validJanusGraphOrder(OrderGlobalStep orderGlobalStep, Traversal rootTraversal, boolean isVertexOrder) {
    final List<Pair<Traversal.Admin, Object>> comparators = orderGlobalStep.getComparators();
    for (final Pair<Traversal.Admin, Object> comp : comparators) {
        final String key;
        if (comp.getValue0() instanceof ValueTraversal && comp.getValue1() instanceof Order) {
            key = ((ValueTraversal) comp.getValue0()).getPropertyKey();
        } else if (comp.getValue1() instanceof ElementValueComparator) {
            final ElementValueComparator evc = (ElementValueComparator) comp.getValue1();
            if (!(evc.getValueComparator() instanceof Order))
                return false;
            key = evc.getPropertyKey();
        } else {
            // do not fold comparators that include nested traversals that are not simple ElementValues
            return false;
        }
        final JanusGraphTransaction tx = JanusGraphTraversalUtil.getTx(rootTraversal.asAdmin());
        final PropertyKey pKey = tx.getPropertyKey(key);
        if (pKey == null || !(Comparable.class.isAssignableFrom(pKey.dataType())) || (isVertexOrder && pKey.cardinality() != Cardinality.SINGLE)) {
            return false;
        }
    }
    return true;
}

Example 14 with Order

use of org.apache.tinkerpop.gremlin.process.traversal.Order in project janusgraph by JanusGraph.

the class HasStepFolder method foldInOrder.

static Step<?, ?> foldInOrder(final HasStepFolder janusgraphStep, final Step<?, ?> tinkerpopStep, final Traversal.Admin<?, ?> traversal, final Traversal<?, ?> rootTraversal, boolean isVertexOrder, final List<HasContainer> hasContainers) {
    Step<?, ?> currentStep = tinkerpopStep;
    OrderGlobalStep<?, ?> lastOrder = null;
    while (true) {
        if (currentStep instanceof OrderGlobalStep) {
            if (lastOrder != null) {
                // Previous orders are rendered irrelevant by next order (since re-ordered)
                lastOrder.getLabels().forEach(janusgraphStep::addLabel);
                traversal.removeStep(lastOrder);
            }
            lastOrder = (OrderGlobalStep) currentStep;
        } else if (!(currentStep instanceof IdentityStep) && !(currentStep instanceof HasStep) && !(currentStep instanceof NoOpBarrierStep)) {
            break;
        }
        currentStep = currentStep.getNextStep();
    }
    if (lastOrder != null && validJanusGraphOrder(lastOrder, rootTraversal, isVertexOrder)) {
        // Add orders to HasStepFolder
        for (final Pair<Traversal.Admin<Object, Comparable>, Comparator<Object>> comp : (List<Pair<Traversal.Admin<Object, Comparable>, Comparator<Object>>>) ((OrderGlobalStep) lastOrder).getComparators()) {
            final String key;
            final Order order;
            if (comp.getValue0() instanceof ValueTraversal) {
                final ValueTraversal evt = (ValueTraversal) comp.getValue0();
                key = evt.getPropertyKey();
                order = (Order) comp.getValue1();
            } else {
                final ElementValueComparator evc = (ElementValueComparator) comp.getValue1();
                key = evc.getPropertyKey();
                order = (Order) evc.getValueComparator();
            }
            if (hasContainers == null) {
                janusgraphStep.orderBy(key, order);
            } else {
                janusgraphStep.localOrderBy(traversal.getParent(), hasContainers, key, order);
            }
        }
        lastOrder.getLabels().forEach(janusgraphStep::addLabel);
        traversal.removeStep(lastOrder);
    }
    return currentStep;
}

Example 15 with Order

use of org.apache.tinkerpop.gremlin.process.traversal.Order in project sqlg by pietermartin.

the class TestReplacedStepEmitComparator method testOptionalWithOrder.

@Test
public void testOptionalWithOrder() {
    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").optional(__.out().order().by("name", Order.decr))).path();
    Assert.assertEquals(4, traversal.getSteps().size());
    List<Path> paths = traversal.toList();
    for (Path next : paths) {
        for (Object o : next) {
            Vertex v = (Vertex) o;
            System.out.print("[");
            System.out.print(v.<String>value("name"));
            System.out.print("], ");
        }
        System.out.print("\n");
    }
    Assert.assertEquals(2, traversal.getSteps().size());
    Assert.assertEquals(12, paths.size());
    // assert the order
    // all the paths of length 2 and 3 must be sorted
    List<Path> pathsOfLength3 = paths.stream().filter(p -> p.size() == 3).collect(Collectors.toList());
    Vertex v = (Vertex) pathsOfLength3.get(5).objects().get(2);
    Assert.assertEquals("h", v.value("name"));
    v = (Vertex) pathsOfLength3.get(4).objects().get(2);
    Assert.assertEquals("i", v.value("name"));
    v = (Vertex) pathsOfLength3.get(3).objects().get(2);
    Assert.assertEquals("j", v.value("name"));
    v = (Vertex) pathsOfLength3.get(2).objects().get(2);
    Assert.assertEquals("k", v.value("name"));
    v = (Vertex) pathsOfLength3.get(1).objects().get(2);
    Assert.assertEquals("l", v.value("name"));
    v = (Vertex) pathsOfLength3.get(0).objects().get(2);
    Assert.assertEquals("m", v.value("name"));
    List<Path> pathsOfLength2 = paths.stream().filter(p -> p.size() == 2).collect(Collectors.toList());
    v = (Vertex) pathsOfLength2.get(0).objects().get(1);
    Assert.assertEquals("b", v.value("name"));
    v = (Vertex) pathsOfLength2.get(1).objects().get(1);
    Assert.assertEquals("e", v.value("name"));
    v = (Vertex) pathsOfLength2.get(2).objects().get(1);
    Assert.assertEquals("f", v.value("name"));
    v = (Vertex) pathsOfLength2.get(3).objects().get(1);
    Assert.assertEquals("g", v.value("name"));
    Assert.assertTrue(paths.stream().anyMatch(p -> p.size() == 3 && p.get(0).equals(a1) && p.get(1).equals(b1) && p.get(2).equals(c1)));
    paths.remove(paths.stream().filter(p -> p.size() == 3 && p.get(0).equals(a1) && p.get(1).equals(b1) && p.get(2).equals(c1)).findAny().get());
    Assert.assertTrue(paths.stream().anyMatch(p -> p.size() == 3 && p.get(0).equals(a1) && p.get(1).equals(b1) && p.get(2).equals(c2)));
    paths.remove(paths.stream().filter(p -> p.size() == 3 && p.get(0).equals(a1) && p.get(1).equals(b1) && p.get(2).equals(c2)).findAny().get());
    Assert.assertTrue(paths.stream().anyMatch(p -> p.size() == 3 && p.get(0).equals(a1) && p.get(1).equals(b1) && p.get(2).equals(c3)));
    paths.remove(paths.stream().filter(p -> p.size() == 3 && p.get(0).equals(a1) && p.get(1).equals(b1) && p.get(2).equals(c3)).findAny().get());
    Assert.assertTrue(paths.stream().anyMatch(p -> p.size() == 3 && p.get(0).equals(a1) && p.get(1).equals(b2) && p.get(2).equals(cc1)));
    paths.remove(paths.stream().filter(p -> p.size() == 3 && p.get(0).equals(a1) && p.get(1).equals(b2) && p.get(2).equals(cc1)).findAny().get());
    Assert.assertTrue(paths.stream().anyMatch(p -> p.size() == 3 && p.get(0).equals(a1) && p.get(1).equals(b2) && p.get(2).equals(cc2)));
    paths.remove(paths.stream().filter(p -> p.size() == 3 && p.get(0).equals(a1) && p.get(1).equals(b2) && p.get(2).equals(cc2)).findAny().get());
    Assert.assertTrue(paths.stream().anyMatch(p -> p.size() == 3 && p.get(0).equals(a1) && p.get(1).equals(b2) && p.get(2).equals(cc3)));
    paths.remove(paths.stream().filter(p -> p.size() == 3 && p.get(0).equals(a1) && p.get(1).equals(b2) && p.get(2).equals(cc3)).findAny().get());
    Assert.assertTrue(paths.stream().anyMatch(p -> p.size() == 2 && p.get(0).equals(a1) && p.get(1).equals(bb1)));
    paths.remove(paths.stream().filter(p -> p.size() == 2 && p.get(0).equals(a1) && p.get(1).equals(bb1)).findAny().get());
    Assert.assertTrue(paths.stream().anyMatch(p -> p.size() == 2 && p.get(0).equals(a1) && p.get(1).equals(bb2)));
    paths.remove(paths.stream().filter(p -> p.size() == 2 && p.get(0).equals(a1) && p.get(1).equals(bb2)).findAny().get());
    Assert.assertTrue(paths.stream().anyMatch(p -> p.size() == 2 && p.get(0).equals(a1) && p.get(1).equals(bb3)));
    paths.remove(paths.stream().filter(p -> p.size() == 2 && p.get(0).equals(a1) && p.get(1).equals(bb3)).findAny().get());
    Assert.assertTrue(paths.stream().anyMatch(p -> p.size() == 2 && p.get(0).equals(a1) && p.get(1).equals(b3)));
    paths.remove(paths.stream().filter(p -> p.size() == 2 && p.get(0).equals(a1) && p.get(1).equals(b3)).findAny().get());
    Assert.assertTrue(paths.stream().anyMatch(p -> p.size() == 1 && p.get(0).equals(a2)));
    paths.remove(paths.stream().filter(p -> p.size() == 1 && p.get(0).equals(a2)).findAny().get());
    Assert.assertTrue(paths.stream().anyMatch(p -> p.size() == 1 && p.get(0).equals(a3)));
    paths.remove(paths.stream().filter(p -> p.size() == 1 && p.get(0).equals(a3)).findAny().get());
    Assert.assertTrue(paths.isEmpty());
}