nxt.lcs

Longest Common Subsequence, typically used as a base for writing diff/compare algorithms.

Members

Functions

lcs
const(T)[] lcs(T[] xs, T[] ys)

Longest Common Subsequence (LCS) using Hirschberg. Linear-Space Faster Dynamic Programming Version.

lcsDP
T[] lcsDP(T[] a, T[] b)

Longest Common Subsequence (LCS). Faster Dynamic Programming Version.

lcsLengths
uint[] lcsLengths(R xs, R ys)

Get LCS Lengths.

lcsR
T[] lcsR(T[] a, T[] b)

Longest Common Subsequence (LCS).

See Also

Meta