- Test:
- Demonstration/Concept: a description language for tree differences. The representation is given as a linearised sequence of verb tokens. In addition to the verbs used for list diffing, here we additionally have to deal with nested scopes, which can be entered thorough a bracketing construct
mut(ID)...emu(ID). This test demonstrates the application of such diff sequences
- in the first step, an empty root #Record<GenNode> is populated with a type-ID, three named attribute values, three child values and a nested child-Record.
- the second step demonstrates various diff language constructs to alter, reshape and mutate this data structure After applying those two diff sequences, we verify that the mutated data is indeed in the reordered shape.
- Note
- literally the same test case is repeated in MutationMessage_test, just there the diff is transported in a MutationMessage capsule, as would be the case in the real application.
- See also
- DiffComplexApplication_test handling arbitrary data structures
-
DiffTreeApplicationSimple_test introductory example demonstration
-
GenericRecord_test
-
GenNode_test
-
DiffListApplication_test
-
tree-diff-application.hpp
-
tree-diff.hpp
Definition at line 104 of file diff-tree-application-test.cpp.