A port of Algorithm::Diff to Ruby
http://rubyforge.org/projects/ruwiki/
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 (1.2, 1993) and Ned Konz's Perl version
(Algorithm::Diff).
- Sources inherited from project openSUSE:Leap:42.3:Rings:1-MinimalX
- Links to openSUSE:Leap:42.3 / rubygem-diff-lcs
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Leap:42.3:Staging:A/rubygem-diff-lcs && cd $_ - Create Badge
Refresh
Refresh
Source Files
| Filename | Size | Changed |
|---|---|---|
| diff-lcs-1.2.5.gem | 0000049152 48 KB | |
| fix-interpreter.diff | 0000000528 528 Bytes | |
| gem2rpm.yml | 0000001623 1.58 KB | |
| rubygem-diff-lcs.changes | 0000003961 3.87 KB | |
| rubygem-diff-lcs.spec | 0000002589 2.53 KB |
Revision 1 (latest revision is 3)
Ludwig Nussel (lnussel_factory)
committed
(revision 1)
Comments 0