This is high performance string library which can manipulate JSON documents. It does so by performing simple string substitutions on regions of the document.
This library uses the fast jsonsl parser
to obtain regions of the document which should be replaced, and outputs a small,
fixed array of iovec like structures (buffer-length regions) which consist
of the new document.
Because the library does not actually build a JSON tree, the memory usage and CPU consumption is constant, regardless of the size of the actual JSON object being operated upon, and thus the only variable performance factor is the amount of actual time the library can seek to the location in the document to be modified.
On a single Xeon E5520 core, this library can process about 150MB/s-300MB/s of JSON. This processing includes the search logic as well as any replacement logic.
The above speed is rather misleading, as this is often quicker, since the document is only parsed until the relevant match sections have been found. This means that even for large inputs, only n bytes of the data is actually parsed, where n is the position in the file where the match itself ends.
Performance may also depend on how deep and/or long the path is (since string comparison must be done occasionally on the relevant path components).