Changes in this release:
- Updated the
ordered_array_like
collection strategy (breaking change for diffs serialized before v0.7.0)- Hirschberg's algorithm used (instead of Levenshtein-only) for dramatically lower memory usage (quadratic -> linear)
- Optimized the Levenshtein implementation slightly
- Using a rope instead of a stdlib
vec
when applying changes for much lower memory usage + speedups
- The
unordered_map_like
collection strategy no longer sends the value when deleting an entry - Lots of updates to benchmarks