Module hunt 

Hunt-style diff algorithm.

This implementation follows the classic Hunt family approach by building match lists for the new sequence and then tracking k-candidates with a threshold array and backpointers.

In practice this is close to the Hunt–Szymanski variant (descending match list processing).

• time: O((N + R) log L) where R is the number of matching pairs
• space: O(N + M + R)

Heuristics

See crate::algorithms for shared heuristics and the diff_deadline_raw API.

Functions

diff

Hunt-style diff algorithm.

diff_deadline

Hunt-style diff algorithm with deadline.

diff_deadline_raw

Raw Hunt-style diff algorithm with deadline and without shared heuristics.