This package contains classes associated with the implementation of the
This instruction uses a special implementation of maps in which navigation through a tree of maps maintains information about the route by which the leaf maps were reached. This information is referred to as a pedigree. The data structure used is analogous to the concept of a "zipper" found in some functional programming languages. By maintaining the connection between the root of a tree and the leaves, it becomes possible for an update to the leaves of the tree to be propagated upwards, resulting in a new version of the object at the root of the tree.
Interface Summary Interface Description PedigreeValueA
PedigreeValueis a map or array together with a
Pedigreeindicating how that map or array was selected within a JSON-like tree structure.
Class Summary Class Description DelegatingArrayItemA
DelegatingArrayItemis an abstract class representing an array that is implemented by delegating all array-related functionality to a base class.
DelegatingMapItemis an abstract class representing a map that is implemented by delegating all map-related functionality to another map.
Pedigreeis transient information relating to a map or array indicating the route by which it was reached; it thus compensates for the absence of parent pointers in a JSON-like tree, by allowing the steps used to reach a map or array in such a structure to be retraced.
PedigreeArrayItemA PedigreeArrayItem represents an XDM array together with a
Pedigree: that is, retained information about how the array was selected with a JSON-like tree.
PedigreeMapItemA PedigreeMapItem represents an XDM map together with a
Pedigree: that is, retained information about how the map was selected within a JSON-like tree.