Package de.danielbechler.diff.node

Examples of de.danielbechler.diff.node.DiffNode$Visitor

264
265
266
267
268
269
270
271
272
    working.put("foo", "bar");

    final Map<String, String> base = new LinkedHashMap<String, String>(1);
    base.put("foo", "woot");

    final DiffNode node = ObjectDifferBuilder.buildDefault().compare(working, base);
    NodeAssertions.assertThat(node).self().hasChildren(1);
    NodeAssertions.assertThat(node).child(new MapKeyElementSelector("foo")).hasState(DiffNode.State.CHANGED);
  }
View Full Code Here
275
276
277
278
279
280
281
282
283
  public void testCompareWithDifferentMapImplementationsSucceeds() throws Exception
  {
    final Map<String, String> base = new LinkedHashMap<String, String>(Collections.singletonMap("test", "foo"));
    final Map<String, String> working = new TreeMap<String, String>(Collections.singletonMap("test", "bar"));

    final DiffNode node = ObjectDifferBuilder.buildDefault().compare(working, base);

    NodeAssertions.assertThat(node).self().hasState(DiffNode.State.CHANGED);
  }
View Full Code Here
283
284
285
286
287
288
289
290
291
  }

  @Test(groups = INTEGRATION)
  public void testCompareWithDifferentStrings() throws Exception
  {
    final DiffNode node = ObjectDifferBuilder.buildDefault().compare("foo", "bar");

    assertThat(node).self().hasState(DiffNode.State.CHANGED);
  }
View Full Code Here
305
306
307
308
309
310
311
312
313
        .filtering().returnNodesWithState(DiffNode.State.IGNORED).and()
        .build();

    final ObjectWithIdentityAndValue working = new ObjectWithIdentityAndValue("1", "foo");
    final ObjectWithIdentityAndValue base = new ObjectWithIdentityAndValue("1", "bar");
    final DiffNode node = objectDiffer.compare(working, base);

    NodeAssertions.assertThat(node).child("value").hasState(DiffNode.State.IGNORED);
  }
View Full Code Here
319
320
321
322
323
324
325
326
327
328
329
//    when(delegate.delegate(any(Node.class), any(Instances.class))).thenReturn(node);
//    when(configuration.isIntrospectible(any(Node.class))).thenReturn(true);
//    when(configuration.isReturnable(any(Node.class))).thenReturn(true);
//    when(node.hasChanges()).thenReturn(true);

    final DiffNode node = ObjectDifferBuilder.buildDefault().compare(
        new ObjectWithIdentityAndValue("a", "1"),
        new ObjectWithIdentityAndValue("a", "2"));

    assertThat(node).self().hasState(DiffNode.State.CHANGED);
  }
View Full Code Here
331
332
333
334
335
336
337
338
339
340
341
342
  @Test(enabled = false, description = "Currently this is simply not possible because of the way, the CollectionItemAccessor works. Would be great, to support this.")
  public void testCompareWithListContainingObjectTwiceDetectsIfOneGetsRemoved() throws Exception
  {
    final List<ObjectWithHashCodeAndEquals> base = asList(new ObjectWithHashCodeAndEquals("foo"), new ObjectWithHashCodeAndEquals("foo"));
    final List<ObjectWithHashCodeAndEquals> working = asList(new ObjectWithHashCodeAndEquals("foo"));
    final DiffNode node = ObjectDifferBuilder.buildDefault().compare(working, base);
    node.visit(new NodeHierarchyVisitor());
    assertThat(node)
        .child(NodePath.startBuilding()
            .collectionItem(new ObjectWithHashCodeAndEquals("foo"))
            .build())
        .hasState(DiffNode.State.REMOVED);
View Full Code Here
345
346
347
348
349
350
351
352
353
354
355
  @Test(enabled = false, description = "Currently this is simply not possible because of the way, the CollectionItemAccessor works. Would be great, to support this.")
  public void testCompareWithListContainingObjectOnceDetectsIfAnotherInstanceOfItGetsAdded() throws Exception
  {
    final List<ObjectWithHashCodeAndEquals> base = asList(new ObjectWithHashCodeAndEquals("foo"));
    final List<ObjectWithHashCodeAndEquals> working = asList(new ObjectWithHashCodeAndEquals("foo"), new ObjectWithHashCodeAndEquals("foo"));
    final DiffNode node = ObjectDifferBuilder.buildDefault().compare(working, base);
    node.visit(new NodeHierarchyVisitor());
    assertThat(node).child(NodePath.startBuilding()
        .collectionItem(new ObjectWithHashCodeAndEquals("foo"))
        .build()).hasState(DiffNode.State.ADDED);
  }
View Full Code Here
361
362
363
364
365
366
367
368
369
370
    final List<String> forBase = new ArrayList<String>();
    forBase.add("uno");
    final ObjectWithMethodEqualsOnlyValueProviderMethodOnGetCollection working = new ObjectWithMethodEqualsOnlyValueProviderMethodOnGetCollection(forWorking);
    final ObjectWithMethodEqualsOnlyValueProviderMethodOnGetCollection base = new ObjectWithMethodEqualsOnlyValueProviderMethodOnGetCollection(forBase);

    final DiffNode node = objectDiffer.compare(working, base);

    NodeAssertions.assertThat(node).self().hasState(DiffNode.State.UNTOUCHED);
    NodeAssertions.assertThat(node).self().hasNoChildren();
  }
View Full Code Here
377
378
379
380
381
382
383
384
385
386
387
    final List<String> forBase = new ArrayList<String>();
    forBase.add("uno");
    final ObjectWithMethodEqualsOnlyValueProviderMethodOnGetCollection working = new ObjectWithMethodEqualsOnlyValueProviderMethodOnGetCollection(forWorking);
    final ObjectWithMethodEqualsOnlyValueProviderMethodOnGetCollection base = new ObjectWithMethodEqualsOnlyValueProviderMethodOnGetCollection(forBase);

    final DiffNode node = objectDiffer.compare(working, base);

    NodeAssertions.assertThat(node).self().hasState(DiffNode.State.CHANGED);
    assertThat(node)
        .child(NodePath.with("collection"))
        .hasState(DiffNode.State.CHANGED);
View Full Code Here
394
395
396
397
398
399
400
401
402
403
    final ObjectWithNestedObject forBase = new ObjectWithNestedObject("childid");
    forBase.setObject(new ObjectWithNestedObject("differentgrandchildid"));
    final ObjectWithMethodEqualsOnlyValueProviderMethodOnGetNestedObject working = new ObjectWithMethodEqualsOnlyValueProviderMethodOnGetNestedObject("id", forWorking);
    final ObjectWithMethodEqualsOnlyValueProviderMethodOnGetNestedObject base = new ObjectWithMethodEqualsOnlyValueProviderMethodOnGetNestedObject("id", forBase);

    final DiffNode node = objectDiffer.compare(working, base);

    NodeAssertions.assertThat(node).self().hasState(DiffNode.State.UNTOUCHED);
    NodeAssertions.assertThat(node).self().hasNoChildren();
  }
View Full Code Here
TOP

Related Classes of de.danielbechler.diff.node.DiffNode$Visitor

  • com.facebook.presto.execution.DataSource
  • com.facebook.presto.execution.SplitSource
  • com.facebook.presto.metadata.FunctionInfo
  • com.facebook.presto.metadata.OutputTableHandle
  • com.facebook.presto.metadata.Signature
  • com.facebook.presto.operator.DriverFactory
  • com.facebook.presto.operator.ExchangeOperator.ExchangeOperatorFactory
  • com.facebook.presto.operator.FilterAndProjectOperator.FilterAndProjectOperatorFactory
  • com.facebook.presto.operator.FilterFunction
  • com.facebook.presto.operator.GenericPageProcessor
    • 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.