Binary package “ruby-diff-lcs” in ubuntu xenial
McIlroy-Hunt longest common subsequence algorithm implementation
Diff::LCS is a port of Algorithm::Diff that uses the McIlroy-Hunt
longest common subsequence (LCS) algorithm to compute intelligent
differences between two sequenced enumerable containers. The
implementation is based on Mario I. Wolczko's Smalltalk version,
and Ned Konz's Perl version (Algorithm::Diff).
Source package
Published versions
- ruby-diff-lcs 1.2.5-2build1 in amd64 (Release)
- ruby-diff-lcs 1.2.5-2build1 in amd64 (Release)
- ruby-diff-lcs 1.2.5-2build1 in arm64 (Release)
- ruby-diff-lcs 1.2.5-2build1 in arm64 (Release)
- ruby-diff-lcs 1.2.5-2build1 in armhf (Release)
- ruby-diff-lcs 1.2.5-2build1 in armhf (Release)
- ruby-diff-lcs 1.2.5-2build1 in i386 (Release)
- ruby-diff-lcs 1.2.5-2build1 in i386 (Release)
- ruby-diff-lcs 1.2.5-2build1 in powerpc (Release)
- ruby-diff-lcs 1.2.5-2build1 in powerpc (Release)
- ruby-diff-lcs 1.2.5-2build1 in ppc64el (Release)
- ruby-diff-lcs 1.2.5-2build1 in ppc64el (Release)
- ruby-diff-lcs 1.2.5-2build1 in s390x (Release)
- ruby-diff-lcs 1.2.5-2build1 in s390x (Release)