Binary package “ruby-diff-lcs” in openkylin huanghe
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.5.1-ok1 in amd64 (Proposed)
- ruby-diff-lcs 1.5.1-ok1 in amd64 (Release)
- ruby-diff-lcs 1.6.2-ok1 in amd64 (Proposed)
- ruby-diff-lcs 1.5.1-ok1 in arm64 (Proposed)
- ruby-diff-lcs 1.5.1-ok1 in arm64 (Release)
- ruby-diff-lcs 1.6.2-ok1 in arm64 (Proposed)
- ruby-diff-lcs 1.5.1-ok1 in i386 (Proposed)
- ruby-diff-lcs 1.5.1-ok1 in i386 (Release)
- ruby-diff-lcs 1.6.2-ok1 in i386 (Proposed)
- ruby-diff-lcs 1.5.1-ok1 in loong64 (Proposed)
- ruby-diff-lcs 1.5.1-ok1 in loong64 (Release)
- ruby-diff-lcs 1.6.2-ok1 in loong64 (Proposed)
- ruby-diff-lcs 1.5.1-ok1 in riscv64 (Proposed)
- ruby-diff-lcs 1.5.1-ok1 in riscv64 (Release)
- ruby-diff-lcs 1.6.2-ok1 in riscv64 (Proposed)
- ruby-diff-lcs 1.5.1-ok1 in rv64g (Proposed)
- ruby-diff-lcs 1.5.1-ok1 in rv64g (Release)
- ruby-diff-lcs 1.6.2-ok1 in rv64g (Proposed)
