Package org.apache.jackrabbit.commons.flat

Examples of org.apache.jackrabbit.commons.flat.TreeTraverser$InclusionPolicy

218
219
220
221
222
223
224
225
226
227
228
    private static void checkTreeProperty(Node root, int minChildren, int maxChildren, Comparator<String> order)
            throws RepositoryException {

        int depth = -1;

        for (Node node : new TreeTraverser(root)) {
            String parentName = node.getName();

            if (node.hasNodes()) {
                int childCount = 0;
                for (NodeIterator nodes = node.getNodes(); nodes.hasNext(); ) {
View Full Code Here
100
101
102
103
104
105
106
107
            leaves.add(node);
        }
    }

    public void testTraverseNodesEmpty() throws RepositoryException {
        TreeTraverser traverser = new TreeTraverser(testNode, errorHandler, TreeTraverser.InclusionPolicy.ALL);
        checkNodes(traverser, singleton(""), testNode.getPath());
    }
View Full Code Here
105
106
107
108
109
110
111
112
        TreeTraverser traverser = new TreeTraverser(testNode, errorHandler, TreeTraverser.InclusionPolicy.ALL);
        checkNodes(traverser, singleton(""), testNode.getPath());
    }

    public void testTraverseLeavesEmpty() throws RepositoryException {
        TreeTraverser traverser = new TreeTraverser(testNode, errorHandler, TreeTraverser.InclusionPolicy.LEAVES);
        checkNodes(traverser, singleton(""), testNode.getPath());
    }
View Full Code Here
111
112
113
114
115
116
117
118
        checkNodes(traverser, singleton(""), testNode.getPath());
    }

    public void testTraverseNodes() throws RepositoryException {
        addNodes(testNode, nodes);
        TreeTraverser traverser = new TreeTraverser(testNode, errorHandler, TreeTraverser.InclusionPolicy.ALL);
        checkNodes(traverser, nodes.iterator(), testNode.getPath());
    }
View Full Code Here
117
118
119
120
121
122
123
124
        checkNodes(traverser, nodes.iterator(), testNode.getPath());
    }

    public void testTraverseLeaves() throws RepositoryException {
        addNodes(testNode, nodes);
        TreeTraverser traverser = new TreeTraverser(testNode, errorHandler, TreeTraverser.InclusionPolicy.LEAVES);
        checkNodes(traverser, leaves.iterator(), testNode.getPath());
    }
View Full Code Here
TOP

Related Classes of org.apache.jackrabbit.commons.flat.TreeTraverser$InclusionPolicy

  • org.apache.jackrabbit.commons.predicate.Predicate
  • org.apache.jackrabbit.core.integration.ItemSequenceTest
  • org.apache.jackrabbit.core.integration.TreeTraverserTest
  • javax.jcr.NodeIterator
  • javax.jcr.Node
    • 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.