Legend:
Library
Module
Module type
Parameter
Class
Class type
Library
Module
Module type
Parameter
Class
Class type
package patience_diff
Legend:
Library
Module
Module type
Parameter
Class
Class type
Library
Module
Module type
Parameter
Class
Class type
Basic Myers diff algorithm, translated from GNU diff. *
val iter_matches :
?cutoff:int ->
f:((int * int) -> unit) ->
hashable:(module Base.Hashtbl.Key with type t = 'a) ->
'a array ->
'a array ->
unititer_matches ?cutoff ~f ~hashable a b diffs the arrays a and b (as in /usr/bin/diff), and calls f on each element of the longest common subsequence in increasing order. The arguments of f are the indices in a and b, respectively, of that element.
The cutoff is an upper bound on the minimum edit distance between a and b. When cutoff is exceeded, iter_matches returns a correct, but not necessarily minimal diff. It defaults to about sqrt (Array.length a + Array.length b).