Expand description
Histogram diff algorithm (Patience / low-occurrence anchor based diff).
Ported to match the behavior of JGit / java-diff-utils HistogramDiff.
This algorithm selects elements with low occurrence counts as anchors to split sequences
recursively, falling back to Myers’ algorithm when no low-occurrence anchors remain.
Structs§
- Histogram
Diff - Histogram diff algorithm implementation.
- Histogram
Diff Factory - Factory for creating
HistogramDiffalgorithm instances.
Constants§
- DEFAULT_
MAX_ CHAIN_ LENGTH - Default maximum occurrence count for an element to be considered as a pivot anchor.
Functions§
- compute_
diff - Computes the diff between two slices using HistogramDiff and default equality.
- compute_
diff_ full - Full histogram diff entry point with workspace and listener support.
- compute_
diff_ with - Computes the diff between two slices using HistogramDiff and a custom equalizer.