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.

lcs
string lcs(string a, string b)
Undocumented in source. Be warned that the author may not have intended to support it.
lcsDP
T[] lcsDP(T[] a, T[] b)

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

lcsDo
void lcsDo(T[] xs, T[] ys, bool[] xsInLCS, size_t idx)
Undocumented in source. Be warned that the author may not have intended to support it.
lcsLengths
uint[] lcsLengths(R xs, R ys)

Get LCS Lengths.

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

Longest Common Subsequence (LCS).

See Also

Meta