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:15.2:Rings:1-MinimalX
- Links to openSUSE:Leap:15.2 / rubygem-diff-lcs
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Leap:15.2:Staging:A/rubygem-diff-lcs && cd $_ - Create Badge
Refresh
Refresh
Source Files (show unmerged sources)
| Filename | Size | Changed |
|---|---|---|
| diff-lcs-1.3.gem | 0000046080 45 KB | |
| fix-interpreter.patch | 0000000528 528 Bytes | |
| gem2rpm.yml | 0000000083 83 Bytes | |
| rubygem-diff-lcs.changes | 0000004368 4.27 KB | |
| rubygem-diff-lcs.spec | 0000002484 2.43 KB |
Comments 0