Examples of RevTreeBuilder

Examples of org.locationtech.geogig.api.RevTreeBuilder

300
301
302
303
304
305
306
307
308
309
310
        return depth;
    }

    private RevTreeBuilder createFeaturesTree(final String parentPath, final int numEntries) {

        RevTreeBuilder tree = new RevTreeBuilder(odb);
        for (int i = 0; i < numEntries; i++) {
            tree.put(featureRef(parentPath, i));
        }
        return tree;
    }
View Full Code Here

Examples of org.locationtech.geogig.api.RevTreeBuilder

56
57
58
59
60
61
62
63
64
65
66
67
68
        assertTrue(featuresLeafTree.features().isPresent());

        treesLeafTree = createTreesTree(source, 100, 10, metadataId).build();
        assertTrue(treesLeafTree.trees().isPresent());

        RevTreeBuilder builder = createTreesTree(source, 10, 10, metadataId);
        for (int i = 0; i < 100; i++) {
            builder.put(featureNode("feature.", i));
        }
        mixedLeafTree = builder.build();

        featuresBucketsTree = createFeaturesTree(source, "feature.", 25000).build();
    }
View Full Code Here

Examples of org.locationtech.geogig.api.RevTreeBuilder

102
103
104
105
106
107
108
109
110
111
112
113
        assertEquals(10, list(mixedLeafTree, Strategy.TREES_ONLY).size());
        assertEquals(0, list(featuresBucketsTree, Strategy.TREES_ONLY).size());

        int numSubTrees = RevTree.NORMALIZED_SIZE_LIMIT + 1;
        int featuresPerTree = RevTree.NORMALIZED_SIZE_LIMIT + 1;
        RevTreeBuilder builder = createTreesTree(source, numSubTrees, featuresPerTree, metadataId);
        for (int i = 0; i < 25000; i++) {
            builder.put(featureNode("f", i));
        }
        RevTree mixedBucketsTree = builder.build();
        assertEquals(numSubTrees, list(mixedBucketsTree, Strategy.TREES_ONLY).size());
    }
View Full Code Here

Examples of org.locationtech.geogig.api.RevTreeBuilder

123
124
125
126
127
128
129
130
131
132
133
134
135
        assertEquals(featuresBucketsTree.size(), list(featuresBucketsTree, Strategy.RECURSIVE)
                .size());

        int numSubTrees = RevTree.NORMALIZED_SIZE_LIMIT + 1;
        int featuresPerTree = RevTree.NORMALIZED_SIZE_LIMIT + 1;
        RevTreeBuilder builder = createTreesTree(source, numSubTrees, featuresPerTree, metadataId);
        for (int i = 0; i < 25000; i++) {
            builder.put(featureNode("f", i));
        }
        RevTree mixedBucketsTree = builder.build();
        assertEquals(mixedBucketsTree.size() + mixedBucketsTree.numTrees(),
                list(mixedBucketsTree, Strategy.RECURSIVE).size());
    }
View Full Code Here

Examples of org.locationtech.geogig.api.RevTreeBuilder

145
146
147
148
149
150
151
152
153
154
155
156
157
        assertEquals(featuresBucketsTree.size(),
                list(featuresBucketsTree, Strategy.RECURSIVE_FEATURES_ONLY).size());

        int numSubTrees = RevTree.NORMALIZED_SIZE_LIMIT + 1;
        int featuresPerTree = RevTree.NORMALIZED_SIZE_LIMIT + 1;
        RevTreeBuilder builder = createTreesTree(source, numSubTrees, featuresPerTree, metadataId);
        for (int i = 0; i < 25000; i++) {
            builder.put(featureNode("f", i));
        }
        RevTree mixedBucketsTree = builder.build();
        assertEquals(mixedBucketsTree.size(),
                list(mixedBucketsTree, Strategy.RECURSIVE_FEATURES_ONLY).size());
    }
View Full Code Here

Examples of org.locationtech.geogig.api.RevTreeBuilder

166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
                .size());
        assertEquals(0, list(featuresBucketsTree, Strategy.RECURSIVE_TREES_ONLY).size());

        int numSubTrees = RevTree.NORMALIZED_SIZE_LIMIT + 1;
        int featuresPerTree = RevTree.NORMALIZED_SIZE_LIMIT + 1;
        RevTreeBuilder builder = createTreesTree(source, numSubTrees, featuresPerTree, metadataId);
        for (int i = 0; i < 25000; i++) {
            builder.put(featureNode("f", i));
        }
        RevTree mixedBucketsTree = builder.build();
        Stopwatch sw = Stopwatch.createStarted();
        assertEquals(numSubTrees, list(mixedBucketsTree, Strategy.RECURSIVE_TREES_ONLY).size());
        sw.stop();
        System.err.println(sw);
    }
View Full Code Here

Examples of org.locationtech.geogig.api.RevTreeBuilder

54
55
56
57
58
59
60
61
62
63
64
65
    }

    @Test
    public void testSimple() {

        RevTreeBuilder oldRoot = new RevTreeBuilder(odb);
        RevTree tree = new RevTreeBuilder(odb).put(blob("blob")).build();
        ObjectId newRootId = writeBack.setAncestor(oldRoot).setChildPath("subtree").setTree(tree)
                .call();

        Optional<NodeRef> ref = new DepthSearch(odb).find(newRootId, "subtree");
        assertTrue(ref.isPresent());
View Full Code Here

Examples of org.locationtech.geogig.api.RevTreeBuilder

66
67
68
69
70
71
72
73
74
75
76
77
78
    }

    @Test
    public void testSingleLevel() {

        RevTreeBuilder oldRoot = new RevTreeBuilder(odb);

        RevTree tree = new RevTreeBuilder(odb).put(blob("blob")).build();

        ObjectId newRootId = writeBack.setAncestor(oldRoot).setChildPath("level1").setTree(tree)
                .call();

        // created the intermediate tree node?
View Full Code Here

Examples of org.locationtech.geogig.api.RevTreeBuilder

86
87
88
89
90
91
92
93
94
95
96
97
98
    }

    @Test
    public void testSingleNested() {

        RevTreeBuilder oldRoot = new RevTreeBuilder(odb);

        RevTree tree = new RevTreeBuilder(odb).put(blob("blob")).build();

        ObjectId newRootId = writeBack.setAncestor(oldRoot).setChildPath("level1/level2")
                .setTree(tree).call();

        // created the intermediate tree node?
View Full Code Here

Examples of org.locationtech.geogig.api.RevTreeBuilder

109
110
111
112
113
114
115
116
117
118
119
120
121
122
    }

    @Test
    public void testSiblingsSingleLevel() {

        RevTreeBuilder ancestor = new RevTreeBuilder(odb);

        RevTree tree1 = new RevTreeBuilder(odb).put(blob("blob")).build();
        RevTree tree2 = new RevTreeBuilder(odb).put(blob("blob")).build();

        ObjectId newRootId1 = writeBack.setAncestor(ancestor).setChildPath("subtree1")
                .setTree(tree1).call();

        ancestor = odb.getTree(newRootId1).builder(odb);
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.