The root pointer
The number of entries, not counting the root
Check if the map contains value for a given pointer
the pointer to check
true
if this map has a value for pointer
Get the descendants of a given location.
The resulting map contains only the path segments of the pointer
together with all direct and indirect descendant entries of the
pointer
's last segment.
the pointer to check
a pointer map containing only the descendant nodes
Get the value at a given position
the pointer to the location that the value is stored
the element for pointer, or null if there is no value;
Returns the entry for pointer. Entries reflect the tree structure, and might not have a value.
the pointer to the location that the entry is stored
the entry for pointer, or null if there is no entry
Get the intersection of the pointer map with a given pointer
the pointer to check
a pointer map containing only the nodes along the segments specified by the argument
Return a pre-order iterator over the entries
a pre-order EntryIterator over the map's entries
Return a post-order iterator over the entries
a post-order EntryIterator over the map's entries
Add an entry.
By design, no constraints are applied to the supplied pointer. E.g. it is possible to add 'x/foo' followed by 'x/1', even though these cannot be valid paths in a single document. This supports the structural diff use case where we might 'add('x/foo', REMOVE)', then 'add('x/1', INSERT)'.
the pointer to the location that the value is stored
may not be null
the previous value
Convert the JSON pointer map to a string
a string representation of the pointer map
A hierarchical map of JSONPointers.