- Test:
- Verify properties of a special collection type shaped for external representation of object-like data.
- GenNode elements can be created "right away", picking up the given type, assumed that the payload is one of the supported basic types.
- optionally, GenNode elements can be named
- unnamed elements get a marker ID plus unique number extension
- object-like elements can be represented by using a diff:Record<GenNode> as payload. Obviously, the resulting data structure type is recursive.
- a shortcut is provided to simplify defining empty baseline objects
- a special notation is provided to create "id references", which can be used to stand-in for an "object" (Record). This shortcut notation is relevant for the tree diff language – used within Lumiera as "External Tree Description" of object networks.
- See also
- IndexTable
-
DiffListApplication_test
Definition at line 82 of file gen-node-test.cpp.
|
void | convenienceRecAccess () |
|
void | equalityMatch () |
|
void | objectShortcut () |
|
virtual void | run (Arg) |
|
void | sequenceIteration () |
|
void | simpleUsage () |
|
void | symbolReference () |
|
◆ convenienceRecAccess()
void convenienceRecAccess |
( |
| ) |
|
|
inlineprivate |
- Test:
- simplified notation for access to nested record properties.
This is a somewhat questionable shorthand, insofar it allows to "probe" the contents of a GenNode to some limited extent. Generally speaking, we'd prefer if the code using GenNode operates based on precise structural knowledge, instead of peeking into the data.
Definition at line 958 of file gen-node-test.cpp.
The documentation for this class was generated from the following file: