(This feature was released in v1.1.0)
JSON Pointer is a standardized (RFC6901) way to select a value inside a JSON Document (DOM). This can be analogous to XPath for XML document. However, JSON Pointer is much simpler, and a single JSON Pointer only pointed to a single value.
Using RapidJSON's implementation of JSON Pointer can simplify some manipulations of the DOM.
A JSON Pointer is a list of zero-to-many tokens, each prefixed by
/. Each token can be a string or a number. For example, given a JSON:
The following JSON Pointers resolve this JSON as:
[ "bar", "baz" ]
Note that, an empty JSON Pointer
"" (zero token) resolves to the whole JSON.
The following example code is self-explanatory.
Since object-oriented calling convention may be non-intuitive, RapidJSON also provides helper functions, which just wrap the member functions with free-functions.
The following example does exactly the same as the above one.
The conventions are shown here for comparison:
<Method>ValueByPointer(root, Pointer(source), ...)
<Method>ValueByPointer(root, source, ...)
GetValueByPointer() function does not modify the DOM. If the tokens cannot match a value in the DOM, it returns
nullptr. User can use this to check whether a value exists.
Note that, numerical tokens can represent an array index or member name. The resolving process will match the values according to the types of value.
"0" is treated as member name in the first pointer. It is treated as an array index in the second pointer.
The other functions, including
Swap(), will change the DOM. These functions will always succeed. They will create the parent values if they do not exist. If the parent values do not match the tokens, they will also be forced to change their type. Changing the type also mean fully removal of that DOM subtree.
Parsing the above JSON into
Besides, RFC6901 defines a special token
- (single minus sign), which represents the pass-the-end element of an array.
Get() only treats this token as a member name '"-"'. Yet the other functions can resolve this for array, equivalent to calling
Value::PushBack() to the array.
root is a (const)
Value&. That means, it can be a subtree of the DOM.
The other functions have two groups of signature. One group uses
Document& document as parameter, another one uses
Value& root. The first group uses
document.GetAllocator() for creating values. And the second group needs user to supply an allocator, like the functions in DOM.
All examples above do not require an allocator parameter, because the first parameter is a
Document&. But if you want to resolve a pointer to a subtree, you need to supply the allocator as in the following example:
EraseValueByPointer() does not need allocator. And they return
true if the value is erased successfully.
Pointer parses a source string in its constructor. If there is parsing error,
false. And you can use
GetParseErrorOffset() to retrieve the error information.
Note that, all resolving functions assumes valid pointer. Resolving with an invalid pointer causes assertion failure.
In addition to the string representation of JSON pointer that we are using till now, RFC6901 also defines the URI fragment representation of JSON pointer. URI fragment is specified in RFC3986 "Uniform Resource Identifier (URI): Generic Syntax".
The main differences are that a the URI fragment always has a
# (pound sign) in the beginning, and some characters are encoded by percent-encoding in UTF-8 sequence. For example, the following table shows different C/C++ string literals of different representations.
|String Representation||URI Fragment Representation||Pointer Tokens (UTF-8)|
RapidJSON fully support URI fragment representation. It automatically detects the pound sign during parsing.
You may also stringify a
Pointer to a string or other output streams. This can be done by:
It can also stringify to URI fragment reprsentation by
If a pointer will be resolved multiple times, it should be constructed once, and then apply it to different DOMs or in different times. This reduce time and memory allocation for constructing
Pointer multiple times.
We can go one step further, to completely eliminate the parsing process and dynamic memory allocation, we can establish the token array directly:
This may be useful for memory constrained systems.