Package org.locationtech.geogig.api

Examples of org.locationtech.geogig.api.RevTreeBuilder.build()

155
156
157
158
159
160
161
162
163
164
165
        final int added = 1 + 2 * RevTree.NORMALIZED_SIZE_LIMIT;
        for (int i = initialSize; i < (initialSize + added); i++) {
            builder.put(featureRef("", i));
        }

        RevTree changed = builder.build();
        assertEquals(initialSize + added, changed.size());

        assertEquals(added, count(bucketsFeatureTree, changed).featureCount());
        assertEquals(added, count(changed, bucketsFeatureTree).featureCount());

View Full Code Here
183
184
185
186
187
188
189
190
191
192
193
        assertEquals(1, count(changed, bucketsFeatureTree).featureCount());

        for (int i = 0; i < RevTree.NORMALIZED_SIZE_LIMIT - 1; i++) {
            builder.remove(String.valueOf(i));
        }
        changed = builder.build();
        assertEquals(RevTree.NORMALIZED_SIZE_LIMIT + 1, changed.size());
        assertTrue(changed.buckets().isPresent());

        assertEquals(RevTree.NORMALIZED_SIZE_LIMIT - 1, count(bucketsFeatureTree, changed)
                .featureCount());
View Full Code Here
194
195
196
197
198
199
200
201
202
203
204
        assertEquals(RevTree.NORMALIZED_SIZE_LIMIT - 1, count(changed, bucketsFeatureTree)
                .featureCount());

        builder.remove(String.valueOf(RevTree.NORMALIZED_SIZE_LIMIT + 1));

        changed = builder.build();
        assertEquals(RevTree.NORMALIZED_SIZE_LIMIT, changed.size());
        assertFalse(changed.buckets().isPresent());
    }

    @Test
View Full Code Here
224
225
226
227
228
229
230
231
232
233
234
            changed = builder.put(
                    Node.create(String.valueOf(i), FAKE_FEATURE_ID_CHANGED, ObjectId.NULL,
                            TYPE.FEATURE, null)).build();
            expected++;
        }
        changed = builder.build();
        assertEquals(expected, count(bucketsFeatureTree, changed).featureCount());
        assertEquals(expected, count(changed, bucketsFeatureTree).featureCount());

        assertEquals(expected, count(bucketsFeatureTree, changed).getFeaturesChanged());
        assertEquals(expected, count(changed, bucketsFeatureTree).getFeaturesChanged());
View Full Code Here
241
242
243
244
245
246
247
248
249
250
251
        RevTreeBuilder builder = new RevTreeBuilder(odb, bucketsFeatureTree);
        RevTree changed;
        for (int i = 0; i < RevTree.NORMALIZED_SIZE_LIMIT; i++) {
            builder.remove(String.valueOf(i));
        }
        changed = builder.build();
        assertEquals(RevTree.NORMALIZED_SIZE_LIMIT, changed.size());
        assertFalse(changed.buckets().isPresent());

        assertEquals(RevTree.NORMALIZED_SIZE_LIMIT, count(bucketsFeatureTree, changed)
                .featureCount());
View Full Code Here
273
274
275
276
277
278
279
280
281
282
283
            for (int i = 0; i < count; i++) {
                String path = String.valueOf(i);
                builder.remove(path);
            }
        }
        RevTree changed = builder.build();
        assertEquals(RevTree.NORMALIZED_SIZE_LIMIT, changed.size());
        // sanity check
        assertTrue(changed.features().isPresent());
        assertFalse(changed.buckets().isPresent());
View Full Code Here
60
61
62
63
64
65
66
67
68
69
70
        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();
    }

    @Test
View Full Code Here
106
107
108
109
110
111
112
113
114
115
116
        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());
    }

    @Test
    public void testRecursive() {
View Full Code Here
127
128
129
130
131
132
133
134
135
136
137
        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());
    }

    @Test
View Full Code Here
149
150
151
152
153
154
155
156
157
158
159
        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());
    }

    @Test
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.