Package org.locationtech.geogig.api

Examples of org.locationtech.geogig.api.Node$TreeNode

104
105
106
107
108
109
110
111
112
113
114
115
        visitor.walk(consumer);

        when(consumer.tree(any(Node.class), any(Node.class))).thenReturn(false);

        final Node lNode = nodeFor(left);
        final Node rNode = nodeFor(right);

        ArgumentCaptor<Node> leftNode = ArgumentCaptor.forClass(Node.class);
        ArgumentCaptor<Node> rightNode = ArgumentCaptor.forClass(Node.class);

        verify(consumer, times(1)).tree(leftNode.capture(), rightNode.capture());
View Full Code Here
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
        // two leaf trees
        RevTree left = createFeaturesTree(leftSource, "f", 3).build();
        RevTree right = createFeaturesTree(rightSource, "f", 5).build();
        PreOrderDiffWalk visitor = new PreOrderDiffWalk(left, right, leftSource, rightSource);

        final Node lroot = nodeFor(left);
        final Node rroot = nodeFor(right);

        when(consumer.tree(eq(lroot), eq(rroot))).thenReturn(true);

        visitor.walk(consumer);

        verify(consumer, times(1)).tree(eq(lroot), eq(rroot));

        ArgumentCaptor<Node> larg = ArgumentCaptor.forClass(Node.class);
        ArgumentCaptor<Node> rarg = ArgumentCaptor.forClass(Node.class);

        verify(consumer, times(2)).feature(larg.capture(), rarg.capture());

        assertEquals(2, larg.getAllValues().size());
        assertNull(larg.getAllValues().get(0));
        assertNull(larg.getAllValues().get(1));

        Node n1 = featureNode("f", 3);// the two added nodes
        Node n2 = featureNode("f", 4);
        assertTrue(rarg.getAllValues().contains(n1));
        assertTrue(rarg.getAllValues().contains(n2));

        verify(consumer, times(1)).endTree(eq(lroot), eq(rroot));
        verifyNoMoreInteractions(consumer);
View Full Code Here
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
        // two leaf trees
        RevTree left = createFeaturesTree(leftSource, "f", 5).build();
        RevTree right = createFeaturesTree(rightSource, "f", 3).build();
        PreOrderDiffWalk visitor = new PreOrderDiffWalk(left, right, leftSource, rightSource);

        final Node lroot = nodeFor(left);
        final Node rroot = nodeFor(right);

        when(consumer.tree(eq(lroot), eq(rroot))).thenReturn(true);

        visitor.walk(consumer);

        verify(consumer, times(1)).tree(eq(lroot), eq(rroot));

        ArgumentCaptor<Node> larg = ArgumentCaptor.forClass(Node.class);
        ArgumentCaptor<Node> rarg = ArgumentCaptor.forClass(Node.class);

        verify(consumer, times(2)).feature(larg.capture(), rarg.capture());

        assertEquals(2, larg.getAllValues().size());
        assertNull(rarg.getAllValues().get(0));
        assertNull(rarg.getAllValues().get(1));

        Node n1 = featureNode("f", 3);// the two added nodes
        Node n2 = featureNode("f", 4);
        assertTrue(larg.getAllValues().contains(n1));
        assertTrue(larg.getAllValues().contains(n2));

        verify(consumer, times(1)).endTree(eq(lroot), eq(rroot));
        verifyNoMoreInteractions(consumer);
View Full Code Here
195
196
197
198
199
200
201
202
203
204
205
206
        ObjectId metadataId = ObjectId.forString("fake");
        RevTree left = createTreesTree(leftSource, 2, 100, metadataId).build();
        RevTree right = createTreesTree(rightSource, 3, 100, metadataId).build();
        PreOrderDiffWalk visitor = new PreOrderDiffWalk(left, right, leftSource, rightSource);

        final Node lroot = nodeFor(left);
        final Node rroot = nodeFor(right);

        // consume any tree diff
        when(consumer.tree(any(Node.class), any(Node.class))).thenReturn(true);

        visitor.walk(consumer);
View Full Code Here
233
234
235
236
237
238
239
240
241
242
243
244
        ObjectId metadataId = ObjectId.forString("fake");
        RevTree left = createTreesTree(leftSource, 2, 10, metadataId).build();
        RevTree right = createTreesTree(rightSource, 3, 10, metadataId).build();
        PreOrderDiffWalk visitor = new PreOrderDiffWalk(left, right, leftSource, rightSource);

        final Node lroot = nodeFor(left);
        final Node rroot = nodeFor(right);

        // consume the root tree
        when(consumer.tree(eq(lroot), eq(rroot))).thenReturn(true);
        // but skip the added tree
        when(consumer.tree((Node) isNull(), any(Node.class))).thenReturn(false);
View Full Code Here
264
265
266
267
268
269
270
271
272
273
274
275
        assertDepth(left, leftSource, 2);
        assertDepth(right, rightSource, 2);

        PreOrderDiffWalk visitor = new PreOrderDiffWalk(left, right, leftSource, rightSource);

        final Node lroot = nodeFor(left);
        final Node rroot = nodeFor(right);
        // consume the root tree
        when(consumer.tree(eq(lroot), eq(rroot))).thenReturn(true);

        // skip all buckets of depth 0
        when(consumer.bucket(anyInt(), eq(0), any(Bucket.class), any(Bucket.class))).thenReturn(
View Full Code Here
297
298
299
300
301
302
303
304
305
306
307
308
        ObjectId metadataId = ObjectId.forString("fake");
        RevTree left = createTreesTree(leftSource, 3, 10, metadataId).build();
        RevTree right = createTreesTree(rightSource, 2, 10, metadataId).build();
        PreOrderDiffWalk visitor = new PreOrderDiffWalk(left, right, leftSource, rightSource);

        final Node lroot = nodeFor(left);
        final Node rroot = nodeFor(right);

        // consume the root tree
        when(consumer.tree(eq(lroot), eq(rroot))).thenReturn(true);
        // but skip the removed tree
        when(consumer.tree(any(Node.class), (Node) isNull())).thenReturn(false);
View Full Code Here
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
    @Test
    public void testLeafLeafChanged() {
        // two leaf trees
        final RevTree left;
        final RevTree right;
        final Node nodeChange1 = Node.create("f2", ObjectId.forString("forcechange"),
                ObjectId.NULL, TYPE.FEATURE, null);
        final Node nodeChange2 = Node.create("f3", ObjectId.forString("fakefake"), ObjectId.NULL,
                TYPE.FEATURE, null);
        {
            left = createFeaturesTree(leftSource, "f", 5).build();
            // change two nodes
            RevTreeBuilder builder = createFeaturesTree(rightSource, "f", 5);
            builder.put(nodeChange1);
            builder.put(nodeChange2);

            right = builder.build();
        }
        PreOrderDiffWalk visitor = new PreOrderDiffWalk(left, right, leftSource, rightSource);

        when(consumer.tree(any(Node.class), any(Node.class))).thenReturn(true);
        visitor.walk(consumer);
        // call of the root tree nodes
        verify(consumer, times(1)).tree(any(Node.class), any(Node.class));

        ArgumentCaptor<Node> larg = ArgumentCaptor.forClass(Node.class);
        ArgumentCaptor<Node> rarg = ArgumentCaptor.forClass(Node.class);

        verify(consumer, times(2)).feature(larg.capture(), rarg.capture());

        assertEquals(2, larg.getAllValues().size());
        assertEquals(2, rarg.getAllValues().size());

        Node n1 = featureNode("f", 2);// the two added nodes
        Node n2 = featureNode("f", 3);

        assertTrue(larg.getAllValues().contains(n1));
        assertTrue(larg.getAllValues().contains(n2));

        assertTrue(rarg.getAllValues().contains(nodeChange1));
View Full Code Here
78
79
80
81
82
83
84
85
    private void createFeatureTypesTree(RevTreeBuilder rootBuilder, String treePath,
            RevTreeBuilder childBuilder) {
        RevTree childTree = childBuilder.build();
        odb.put(childTree);
        Node childRef = Node.create(treePath, childTree.getId(), ObjectId.NULL, TYPE.TREE, null);
        rootBuilder.put(childRef);
    }
View Full Code Here
309
310
311
312
313
314
315
316
        return tree;
    }

    private Node featureRef(String parentPath, int i) {
        String path = NodeRef.appendChild(parentPath, String.valueOf(i));
        Node ref = Node.create(path, FAKE_FEATURE_ID, ObjectId.NULL, TYPE.FEATURE, null);
        return ref;
    }
View Full Code Here
TOP

Related Classes of org.locationtech.geogig.api.Node$TreeNode

  • com.google.gwt.core.client.Scheduler.ScheduledCommand
  • com.google.gwt.dom.client.Element
  • com.google.gwt.user.client.Element
  • com.google.gwt.user.client.ui.FlowPanel
  • com.google.gwt.user.client.ui.Widget
  • com.sun.jmx.snmp.agent.SnmpMibAgent
  • com.sun.sgs.app.DataManager
  • com.vaadin.client.ui.dd.VDragEvent
  • com.vaadin.client.ui.dd.VTransferable
  • com.vaadin.shared.MouseEventDetails
    • 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.