Package org.apache.jackrabbit.oak.plugins.mongomk.Node

Examples of org.apache.jackrabbit.oak.plugins.mongomk.Node.Children

377
378
379
380
381
382
383
384
385
386
387
        } else {
            // use long to avoid overflows
            long m = ((long) maxChildNodes) + offset;
            max = (int) Math.min(m, Integer.MAX_VALUE);
        }
        Children c = nodeStore.getChildren(path, rev, max);
        for (long i = offset; i < c.children.size(); i++) {
            if (maxChildNodes-- <= 0) {
                break;
            }
            String name = PathUtils.getName(c.children.get((int) i));
View Full Code Here
518
519
520
521
522
523
524
525
526
527
528
    }

    public Children getChildren(final String path, final Revision rev, final int limit)  throws MicroKernelException {
        checkRevisionAge(rev, path);
        String key = path + "@" + rev;
        Children children;
        try {
            children = nodeChildrenCache.get(key, new Callable<Children>() {
                @Override
                public Children call() throws Exception {
                    return readChildren(path, rev, limit);
View Full Code Here
550
551
552
553
554
555
556
557
558
559
560
        // to do that, use the *name* of the last entry of the previous batch of children
        // as the starting point
        String from = Utils.getKeyLowerLimit(path);
        String to = Utils.getKeyUpperLimit(path);
        List<NodeDocument> list;
        Children c = new Children();
        int rawLimit = limit;
        do {
            c.children.clear();
            c.hasMore = true;
            list = store.query(Collection.NODES,
View Full Code Here
688
689
690
691
692
693
694
695
696
697
698
            }
        }
        // TODO this does not work well for large child node lists
        // use a MongoDB index instead
        int max = MANY_CHILDREN_THRESHOLD;
        Children fromChildren, toChildren;
        fromChildren = getChildren(path, fromRev, max);
        toChildren = getChildren(path, toRev, max);
        if (!fromChildren.hasMore && !toChildren.hasMore) {
            diffFewChildren(w, fromChildren, fromRev, toChildren, toRev);
        } else {
View Full Code Here
819
820
821
822
823
824
825
826
827
828
829
        if (offset > 0) {
            // TODO workaround for missing offset
            // support in getChildren
            max = Integer.MAX_VALUE;
        }
        Children c = getChildren(path, rev, max);
        for (long i = offset; i < c.children.size(); i++) {
            if (maxChildNodes-- <= 0) {
                break;
            }
            String name = PathUtils.getName(c.children.get((int) i));
View Full Code Here
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
        } else {
            // the document was updated:
            // we no longer need to update it in a background process
            unsaved.remove(path);
        }
        Children c = nodeChildrenCache.getIfPresent(path + "@" + rev);
        if (isNew || (!isDelete && c != null)) {
            String key = path + "@" + rev;
            Children c2 = new Children();
            TreeSet<String> set = new TreeSet<String>();
            if (c != null) {
                set.addAll(c.children);
            }
            set.removeAll(removed);
View Full Code Here
220
221
222
223
224
225
226
227
228
229
230
            }
        }
        // TODO this does not work well for large child node lists
        // use a MongoDB index instead
        int max = MANY_CHILDREN_THRESHOLD;
        Children fromChildren, toChildren;
        fromChildren = nodeStore.getChildren(path, fromRev, max);
        toChildren = nodeStore.getChildren(path, toRev, max);
        if (!fromChildren.hasMore && !toChildren.hasMore) {
            diffFewChildren(w, fromChildren, fromRev, toChildren, toRev);
        } else {
View Full Code Here
375
376
377
378
379
380
381
382
383
384
385
        } else {
            // use long to avoid overflows
            long m = ((long) maxChildNodes) + offset;
            max = (int) Math.min(m, Integer.MAX_VALUE);
        }
        Children c = nodeStore.getChildren(path, rev, max);
        for (long i = offset; i < c.children.size(); i++) {
            if (maxChildNodes-- <= 0) {
                break;
            }
            String name = PathUtils.getName(c.children.get((int) i));
View Full Code Here
93
94
95
96
97
98
99
100
101
102
    @Test
    public void nodeChildManyChildren() throws Exception {
        measureMemory(new Callable<Object[]>() {
            @Override
            public Object[] call() {
                Children n = generateNodeChild(100);
                return new Object[]{n, n.getMemory() + OVERHEAD};
            }
        });
    }
View Full Code Here
104
105
106
107
108
109
110
111
112
113
    @Test
    public void nodeChild() throws Exception {
        measureMemory(new Callable<Object[]>() {
            @Override
            public Object[] call() {
                Children n = generateNodeChild(5);
                return new Object[]{n, n.getMemory() + OVERHEAD};
            }
        });
    }
View Full Code Here
TOP

Related Classes of org.apache.jackrabbit.oak.plugins.mongomk.Node.Children

  • org.apache.jackrabbit.oak.plugins.mongomk.MeasureMemory
  • org.apache.jackrabbit.oak.plugins.mongomk.MongoMK
  • org.apache.jackrabbit.oak.plugins.mongomk.SimpleTest
    • 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.