Match records by an explicit primitive key instead of their array position.
Each document is capped at 512 KiB; combined input is capped at 1 MiB.
The report states the algorithm, semantics, paths, counts, or conflicts used as proof.
Explicit, bounded structural semantics
The key pointer is resolved inside every item. Missing, object-valued, array-valued, or duplicate keys fail explicitly so records are never paired ambiguously.
The key pointer is resolved inside every item. Missing, object-valued, array-valued, or duplicate keys fail explicitly so records are never paired ambiguously.
Each document is capped at 512 KiB, combined input at 1 MiB, traversal at 100,000 values and 100 levels, reports at 10,000 entries, and output at 1 MiB. Source and results stay in the active browser tab.
Inputs use the browser's JSON parser. Duplicate object names therefore keep their last value, object member order is ignored, array order is preserved unless the selected tool explicitly says otherwise, and integers outside JavaScript's safe range are rejected instead of rounded silently.
