That's exactly the problem addressed by this issue: https://github.com/josephburnett/jd/issues/50. And I've created a new v2 format to address this and other usecases. The v2 API will compute the longest common subsequence of two arrays and structure the diff around that (a standard way of producing a minimum diff).
I've just released jd 1.9.1 with the `-v2` flag. Would you mind trying one of your use cases to see if the diff looks any better? I should say something exactly like that "@ (some path) - (some element)".
# diff -u <(echo '[{"a": "b"}, {"c": "d"}, {"e": "f"}]' | jq) <(echo '[{"a": "b"}, {"e": "f"}]' | jq)
--- /dev/fd/63 2024-09-09 16:31:23.376841575 +0200
+++ /dev/fd/62 2024-09-09 16:31:23.376841575 +0200
@@ -3,9 +3,6 @@
"a": "b"
},
{
- "c": "d"
- },
- {
"e": "f"
}
]