Michael Eischer 24d56fe2a6 diff: switch to efficient DualTreeIterator ... The previous implementation stored the whole tree in a map and used it for checking overlap between trees. This is now replaced with the DualTreeIterator, which iterates over two trees in parallel and returns the merge stream in order. In case of overlap between both trees, it returns both nodes at the same time. Otherwise, only a single node is returned.		2026-01-31 20:03:38 +01:00
..
restic	diff: switch to efficient DualTreeIterator	2026-01-31 20:03:38 +01:00