Package de.danielbechler.diff.node

Examples of de.danielbechler.diff.node.DiffNode

409
410
411
412
413
414
415
416
417
418
419
    final ObjectWithNestedObject forBase = new ObjectWithNestedObject("differentchildid");
    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.CHANGED);
    assertThat(node)
        .child(NodePath.with("object"))
        .hasState(DiffNode.State.CHANGED);
View Full Code Here
426
427
428
429
430
431
432
433
434
435
    final Map<String, String> forBase = new HashMap<String, String>();
    forBase.put("keyone", "valone");
    final ObjectWithMethodEqualsOnlyValueProviderMethodOnGetMap working = new ObjectWithMethodEqualsOnlyValueProviderMethodOnGetMap(forWorking);
    final ObjectWithMethodEqualsOnlyValueProviderMethodOnGetMap base = new ObjectWithMethodEqualsOnlyValueProviderMethodOnGetMap(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
442
443
444
445
446
447
448
449
450
451
452
    final Map<String, String> forBase = new HashMap<String, String>();
    forBase.put("keyone", "valone");
    final ObjectWithMethodEqualsOnlyValueProviderMethodOnGetMap working = new ObjectWithMethodEqualsOnlyValueProviderMethodOnGetMap(forWorking);
    final ObjectWithMethodEqualsOnlyValueProviderMethodOnGetMap base = new ObjectWithMethodEqualsOnlyValueProviderMethodOnGetMap(forBase);

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

    NodeAssertions.assertThat(node).self().hasState(DiffNode.State.CHANGED);
    assertThat(node)
        .child(NodePath.with("map"))
        .hasState(DiffNode.State.CHANGED);
View Full Code Here
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
    final NodePath nodePath = NodePath.with("reference", "reference");

    // verify that the node can be found when it's not excluded
    ObjectDiffer objectDiffer = ObjectDifferBuilder.startBuilding().build();
    final DiffNode verification = objectDiffer.compare(obj1, modifiedObj1);
    verification.visit(new PrintingVisitor(obj1, modifiedObj1));
    assertThat(verification).child(nodePath).hasState(DiffNode.State.CHANGED).hasChildren(1);

    // verify that the node can't be found, when it's excluded
    final ObjectDifferBuilder objectDifferBuilder = ObjectDifferBuilder.startBuilding();
    objectDifferBuilder.inclusion().exclude().node(nodePath);
    objectDiffer = objectDifferBuilder.build();
    final DiffNode node = objectDiffer.compare(obj1, modifiedObj1);
    node.visit(new PrintingVisitor(obj1, modifiedObj1));
    assertThat(node).child(nodePath).doesNotExist();
  }
View Full Code Here
42
43
44
45
46
47
48
49
50
51
52
53
54
    final Map<String, ObjectWithString> working = Collections.singletonMap("foo", new ObjectWithString("bar"));

    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
35
36
37
38
39
40
41
42
43
  public void detects_change_from_null_to_object_referenct_as_addition() throws Exception
  {
    final ObjectWithString base = new ObjectWithString();
    final ObjectWithString working = new ObjectWithString("foo");

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

    assertThat(node).child("value").hasState(DiffNode.State.ADDED);
  }
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
    final ObjectWithCircularReference baseA = new ObjectWithCircularReference("a");
    final ObjectWithCircularReference baseB = new ObjectWithCircularReference("c");
    baseA.setReference(baseB);
    baseB.setReference(baseA);

    final DiffNode root = ObjectDifferBuilder.buildDefault().compare(workingA, baseA);
    assertThat(root).child("reference", "reference").isCircular();
    assertThat(root).child("reference", "reference")
        .hasCircularStartPathEqualTo(NodePath.withRoot());

    Assertions.assertThat(root.canonicalGet(workingA))
        .isSameAs(root.getChild("reference").getChild("reference").canonicalGet(workingA));
    Assertions.assertThat(root.getChild("reference").getChild("reference").getCircleStartNode())
        .isSameAs(root);
  }
View Full Code Here
73
74
75
76
77
78
79
80
81
    baseB.setReference(baseC);
    baseC.setReference(baseA);

    final ObjectDiffer objectDiffer = ObjectDifferBuilder.buildDefault();
//    objectDiffer.getConfiguration().withoutCircularNodes();
    final DiffNode root = objectDiffer.compare(workingA, baseA);
    root.visit(new PrintingVisitor(workingA, baseA));
    assertThat(root).child("reference", "reference", "reference").isCircular();
  }
View Full Code Here
43
44
45
46
47
48
49
50
51
  {
    final ObjectDiffer objectDiffer = ObjectDifferBuilder.buildDefault();

    final String working = "Hello";
    final String base = "World";
    final DiffNode root = objectDiffer.compare(working, base);

    root.visit(new PrintingVisitor(working, base));
  }
View Full Code Here
66
67
68
69
70
71
72
73
74
    final PhoneBook modifiedPhoneBook = PhoneBook.from(phoneBook);
    modifiedPhoneBook.getContact("Jesse", "Pinkman").setMiddleName("Bruce");
    modifiedPhoneBook.getContact("Walter", "White").setMiddleName("Hartwell");

    final ObjectDiffer objectDiffer = ObjectDifferBuilder.buildDefault();
    final DiffNode root = objectDiffer.compare(modifiedPhoneBook, phoneBook);
    final DiffNode.Visitor visitor = new PrintingVisitor(modifiedPhoneBook, phoneBook);
    root.visit(visitor);
  }
View Full Code Here
TOP

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

  • de.danielbechler.diff.differ.BeanDiffer
  • de.danielbechler.diff.differ.BeanDifferShould
  • de.danielbechler.diff.differ.CollectionDiffer
  • de.danielbechler.diff.differ.DifferDispatcher
  • de.danielbechler.diff.differ.DifferDispatcherShould
  • de.danielbechler.diff.differ.MapDiffer
  • de.danielbechler.diff.differ.PrimitiveDiffer
  • de.danielbechler.diff.differ.PrimitiveDifferTest
  • de.danielbechler.diff.example.CanonicalAccessorExample
  • de.danielbechler.diff.example.EqualsOnlyValueProviderMethodExample
    • 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.