Package org.apache.jackrabbit.spi.commons.query

Examples of org.apache.jackrabbit.spi.commons.query.QueryRootNode

78
79
80
81
82
83
84
85
    public void testRepSimilar() throws Exception {
        checkStatement("//element(*, foo)[rep:similar(foo, '/some/path')]");
    }

    protected void checkStatement(String stmt) throws InvalidQueryException {
        QueryRootNode root = QueryParser.parse(stmt, Query.XPATH, RESOLVER, FACTORY);
        assertEquals(stmt, QueryFormat.toString(root, RESOLVER));
    }
View Full Code Here
44
45
46
47
48
49
50
51
52
53
54
55
    private static final QueryNodeFactory FACTORY = new DefaultQueryNodeFactory(Collections.EMPTY_LIST);

    public void testSimpleOrderBy() throws Exception {
        String stmt = "//* order by @bar";
        QueryRootNode root = QueryParser.parse(stmt, Query.XPATH, RESOLVER, FACTORY);
        OrderQueryNode.OrderSpec[] specs = root.getOrderNode().getOrderSpecs();
        assertEquals(1, specs.length);
        assertTrue(specs[0].isAscending());
        checkName(Name.NS_DEFAULT_URI, "bar", specs[0].getProperty());
        Path propPath = specs[0].getPropertyPath();
        assertEquals(1, propPath.getLength());
View Full Code Here
56
57
58
59
60
61
62
63
64
65
        checkName(Name.NS_DEFAULT_URI, "bar", propPath.getName());
    }

    public void testAscending() throws Exception {
        String stmt = "//* order by @bar ascending";
        QueryRootNode root = QueryParser.parse(stmt, Query.XPATH, RESOLVER, FACTORY);
        OrderQueryNode.OrderSpec[] specs = root.getOrderNode().getOrderSpecs();
        assertEquals(1, specs.length);
        assertTrue(specs[0].isAscending());
    }
View Full Code Here
64
65
66
67
68
69
70
71
72
73
        assertTrue(specs[0].isAscending());
    }

    public void testDescending() throws Exception {
        String stmt = "//* order by @bar descending";
        QueryRootNode root = QueryParser.parse(stmt, Query.XPATH, RESOLVER, FACTORY);
        OrderQueryNode.OrderSpec[] specs = root.getOrderNode().getOrderSpecs();
        assertEquals(1, specs.length);
        assertFalse(specs[0].isAscending());
    }
View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
83
84
        assertFalse(specs[0].isAscending());
    }

    public void testChildAxis() throws Exception {
        String stmt = "//* order by foo_x0020_bar/@bar";
        QueryRootNode root = QueryParser.parse(stmt, Query.XPATH, RESOLVER, FACTORY);
        assertEquals(1, root.getOrderNode().getOrderSpecs().length);
        OrderQueryNode.OrderSpec[] specs = root.getOrderNode().getOrderSpecs();
        assertEquals(1, specs.length);
        assertTrue(specs[0].isAscending());
        checkName(Name.NS_DEFAULT_URI, "bar", specs[0].getProperty());
        Path propPath = specs[0].getPropertyPath();
        Path.Element[] elements = propPath.getElements();
View Full Code Here
87
88
89
90
91
92
93
94
        checkName(Name.NS_DEFAULT_URI, "bar", elements[1].getName());
    }

    public void testRoundTrip() throws Exception {
        String stmt = "//* order by foo_x0020_bar/@bar";
        QueryRootNode root = QueryParser.parse(stmt, Query.XPATH, RESOLVER, FACTORY);
        assertEquals(stmt, QueryFormat.toString(root, RESOLVER));
    }
View Full Code Here
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
        return root;
    }

    public Object visit(ASTSelectList node, Object data) {
        final QueryRootNode root = (QueryRootNode) data;

        node.childrenAccept(new DefaultParserVisitor() {
            public Object visit(ASTIdentifier node, Object data) {
                root.addSelectProperty(node.getName());
                return data;
            }

            public Object visit(ASTExcerptFunction node, Object data) {
                root.addSelectProperty(NameFactoryImpl.getInstance().create(Name.NS_REP_URI, "excerpt(.)"));
                return data;
            }
        }, root);

        return data;
View Full Code Here
297
298
299
300
301
302
303
304
305
306
307
        return data;
    }

    public Object visit(ASTFromClause node, Object data) {
        QueryRootNode root = (QueryRootNode) data;

        return node.childrenAccept(new DefaultParserVisitor() {
            public Object visit(ASTIdentifier node, Object data) {
                if (!node.getName().equals(NameConstants.NT_BASE)) {
                    // node is either primary or mixin node type
View Full Code Here
505
506
507
508
509
510
511
512
513
514
515
516
        // do nothing
        return data;
    }

    public Object visit(ASTOrderByClause node, Object data) {
        QueryRootNode root = (QueryRootNode) data;

        OrderQueryNode order = factory.createOrderQueryNode(root);
        root.setOrderNode(order);
        node.childrenAccept(this, order);
        return root;
    }
View Full Code Here
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
        return root;
    }

    public Object visit(ASTSelectList node, Object data) {
        final QueryRootNode root = (QueryRootNode) data;

        node.childrenAccept(new DefaultParserVisitor() {
            public Object visit(ASTIdentifier node, Object data) {
                root.addSelectProperty(node.getName());
                return data;
            }

            public Object visit(ASTExcerptFunction node, Object data) {
                root.addSelectProperty(NameFactoryImpl.getInstance().create(Name.NS_REP_URI, "excerpt(.)"));
                return data;
            }
        }, root);

        return data;
View Full Code Here
TOP

Related Classes of org.apache.jackrabbit.spi.commons.query.QueryRootNode

  • org.apache.jackrabbit.core.query.PathQueryNodeTest
  • org.apache.jackrabbit.spi.commons.query.sql.JCRSQLQueryBuilder
  • org.apache.jackrabbit.spi.commons.query.xpath.QueryFormatTest
  • org.apache.jackrabbit.spi.commons.query.xpath.XPathOrderByTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.