Package de.danielbechler.diff.node

Examples of de.danielbechler.diff.node.NodeHierarchyVisitor

33
34
35
36
37
38
39
40
41
42
43
  public static void main(final String[] args)
  {
    final Person bruceWayne = new Person("Bruce", "Wayne");
    final Person batman = new Person("Batman", null);
    final DiffNode rootNode = ObjectDifferBuilder.buildDefault().compare(batman, bruceWayne);
    rootNode.visit(new NodeHierarchyVisitor(10));
    rootNode.visit(new PrintingVisitor(batman, bruceWayne)
    {
      @Override
      protected boolean filter(final DiffNode node)
      {
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
        .compare(workingAddressBook, baseAddressBook);
    final DiffNode contactsNode = rootNode.getChild("contacts");
    final DiffNode contactNode = contactsNode.getChild(new CollectionItemElementSelector(baseContact));
    final DiffNode nicknameNode = contactNode.getChild("nickname");

    rootNode.visit(new NodeHierarchyVisitor());

    /*

    Output:

 
View Full Code Here
135
136
137
138
139
140
141
142
143
144
    final ObjectDifferBuilder objectDifferBuilder = ObjectDifferBuilder.startBuilding();
    // final Configuration2 objectDifferBuilder = new Configuration2().withChildrenOfAddedNodes();

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

    node.visit(new NodeHierarchyVisitor());
    NodeAssertions.assertThat(node).root().hasState(DiffNode.State.CHANGED);
    NodeAssertions.assertThat(node).child("object").hasState(DiffNode.State.ADDED);
    NodeAssertions.assertThat(node).child("object", "object").hasState(DiffNode.State.ADDED);
  }
View Full Code Here
332
333
334
335
336
337
338
339
340
341
342
  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
346
347
348
349
350
351
352
353
354
355
  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
44
45
46
47
48
49
50
51
52
53
54
    final ObjectDifferBuilder objectDifferBuilder = ObjectDifferBuilder.startBuilding();
    final ObjectDiffer differ = objectDifferBuilder.build();

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

    node.visit(new NodeHierarchyVisitor());

    assertThat(node).child(NodePath.startBuilding()
        .mapKey("foo")).hasState(DiffNode.State.ADDED);

    assertThat(node).child(NodePath.startBuilding()
View Full Code Here
505
506
507
508
509
510
511
512
513
514
515
    establishCircularDirectReference(base1, base2);

    final ObjectDifferBuilder objectDifferBuilder = ObjectDifferBuilder.startBuilding();
    objectDifferBuilder.filtering().returnNodesWithState(DiffNode.State.CIRCULAR);
    final DiffNode node = objectDifferBuilder.build().compare(working1, base1);
    node.visit(new NodeHierarchyVisitor());

    assertThat(node).child("value").hasState(DiffNode.State.ADDED);
    assertThat(node).child("directReference").hasState(DiffNode.State.CHANGED);
    assertThat(node).child("directReference", "value").hasState(DiffNode.State.ADDED);
    assertThat(node).child("directReference", "directReference").isCircular();
View Full Code Here
531
532
533
534
535
536
537
538
539
540
541
    final ObjectDifferBuilder objectDifferBuilder = ObjectDifferBuilder.startBuilding();
    objectDifferBuilder.filtering().returnNodesWithState(DiffNode.State.CIRCULAR);
    final ObjectDiffer differ = objectDifferBuilder.build();

    final DiffNode node = differ.compare(working1, base1);
    node.visit(new NodeHierarchyVisitor());

    NodeAssertions.assertThat(node)
        .child(startBuilding()
            .propertyName("map")
            .mapKey("foo")
View Full Code Here
TOP

Related Classes of de.danielbechler.diff.node.NodeHierarchyVisitor

  • de.danielbechler.diff.example.CanonicalAccessorExample
  • de.danielbechler.diff.example.SimpleNodeExample
  • de.danielbechler.diff.integration.DeepDiffingCollectionItemChangeIT
  • de.danielbechler.diff.issues.issue15.GraphIT
  • de.danielbechler.diff.ObjectDifferIT
    • 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.