the second element being the sequence of edits to effect this transformation.
Allocates GC memory for the returned EditOp[] array.
Tuple!(size_t, EditOp[]) levenshteinDistanceAndPath(alias equals = (a, b) => a == b, Range1, Range2)(Range1 s, Range2 t) if (isForwardRange!(Range1) && isForwardRange!(Range2))Returns the Levenshtein distance and the edit path between s and t.
equals | The binary predicate to compare the elements of the two ranges. |
s | The original range. |
t | The transformation target |
the second element being the sequence of edits to effect this transformation.
Allocates GC memory for the returned EditOp[] array.