Package de.danielbechler.diff.node

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

58
59
60
61
62
63
64
65
66
67
68
69
    assertThat(root).child("directReference", "value").hasState(DiffNode.State.CHANGED).hasNoChildren();
  }

  private static DiffNode compareAndPrint(final GraphNode modified, final GraphNode base)
  {
    final DiffNode root = ObjectDifferBuilder.buildDefault().compare(modified, base);
    if (PRINT_ENABLED)
    {
      root.visit(new PrintingVisitor(modified, base));
    }
    return root;
  }
View Full Code Here
77
78
79
80
81
82
83
84
85
86
    final GraphNode modified = new GraphNode(1);
    final GraphNode modifiedA = new GraphNode(2, "ax");
    modified.setDirectReference(modifiedA);

    final DiffNode root = compareAndPrint(modified, base);

    assertThat(root).root().hasChildren(1);
    assertThat(root).child("directReference", "value").hasState(DiffNode.State.CHANGED).hasNoChildren();
  }
View Full Code Here
98
99
100
101
102
103
104
105
106
107
108
    final GraphNode modifiedA = new GraphNode(2, "ax");
    final GraphNode modifiedB = new GraphNode(3, "by");
    modified.addChildren(modifiedA, modifiedB);
    establishCircularDirectReference(modifiedA, modifiedB);

    final DiffNode root = compareAndPrint(modified, base);

    assertThat(root).root().hasChildren(1);
    assertThat(root).child("children").hasChildren(2);
    assertThat(root).child(startBuilding()
        .propertyName("children")
View Full Code Here
141
142
143
144
145
146
147
148
149
150
151
    modified.addChild(modifiedB);
    establishCircularDirectReference(modifiedA, modifiedB);
    modifiedA.getMap().put("node-b", modifiedB);
    modifiedB.getMap().put("node-a", modifiedA);

    final DiffNode root = compareAndPrint(modified, base);

    /*
     * one could assume that this node would be marked as removed, but since the instance it represents
     * is a parent of it, we cannot reliably test, whether the node has been changed. (added or removed
     * is easier, but since changed is not yet possible, that would be inconsistent)
View Full Code Here
199
200
201
202
203
204
205
206
207
208
    final GraphNode modifiedA = new GraphNode(1, "ax");
    final GraphNode modifiedB = new GraphNode(2, "by");
    establishCircularDirectReference(modifiedA, modifiedB);

    final DiffNode root = compareAndPrint(modifiedA, a);

    assertThat(root).child("directReference", "value").hasState(DiffNode.State.CHANGED).hasNoChildren();
    assertThat(root).child("value").hasState(DiffNode.State.CHANGED).hasNoChildren();
  }
View Full Code Here
216
217
218
219
220
221
222
223
224
225
    final GraphNode modified = new GraphNode("modified");
    final GraphNode modifiedA = new GraphNode("ax");
    modified.setDirectReference(modifiedA);

    final DiffNode root = compareAndPrint(modified, base);

    assertThat(root).child("directReference", "value").hasState(DiffNode.State.CHANGED).hasNoChildren();
    assertThat(root).child("value").hasState(DiffNode.State.CHANGED).hasNoChildren();
  }
View Full Code Here
240
241
242
243
244
245
246
247
248
249
250
    final GraphNode modifiedA = new GraphNode("a");
    final GraphNode modifiedB = new GraphNode("bx");
    modified.getChildren().add(modifiedA);
    modified.getChildren().add(modifiedB);

    final DiffNode root = compareAndPrint(modified, base);

    NodeAssertions.assertThat(root).root().hasState(DiffNode.State.UNTOUCHED); // not a bug!

    // NOTE: This is expected, since Collections (and java-object-diff) rely heavily on the proper
    // implementation of hashCode and equals. The GraphNode uses the ID as sole criteria in it's
View Full Code Here
273
274
275
276
277
278
279
280
281
282
283
    final GraphNode modifiedB = new GraphNode(3, "by");
    final GraphNode modified = new GraphNode(1);
    modified.addChild(modifiedA);
    modified.addChild(modifiedB);

    final DiffNode root = compareAndPrint(modified, base);

    NodeAssertions.assertThat(root).child(startBuilding()
        .propertyName("children")
        .collectionItem(a))
        .hasState(DiffNode.State.CHANGED)
View Full Code Here
298
299
300
301
302
303
304
305
306
307
308
    establishParentChildRelationship(base, a);
    final GraphNode modified = new GraphNode(1);
    final GraphNode modifiedA = new GraphNode(2, "ax");
    establishParentChildRelationship(modified, modifiedA);

    final DiffNode root = compareAndPrint(modified, base);

    NodeAssertions.assertThat(root).child(startBuilding()
        .propertyName("children")
        .collectionItem(modifiedA)
        .propertyName("value"))
View Full Code Here
323
324
325
326
327
328
329
330
331
    establishParentChildRelationship(base, a);
    final GraphNode modified = new GraphNode(1);
    final GraphNode modifiedA = new GraphNode(2, "a");
    establishParentChildRelationship(modified, modifiedA);

    final DiffNode root = compareAndPrint(modified, base);

    assertThat(root).root().hasState(DiffNode.State.UNTOUCHED);
  }
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.