ror40-rubygem-diff-lcs - Provide a list of changes between two sequenced collections
| Website: | http://rubyforge.org/projects/ruwiki/ |
|---|---|
| License: | (GPLv2+ or Artistic or MIT) and (GPLv2+ or Artistic or Ruby or BSD) and (Artistic or Ruby or BSD) |
| Vendor: | Red Hat, Inc. |
- Description:
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).
Packages
| ror40-rubygem-diff-lcs-1.1.3-5.el6.src [44 KiB] |
Changelog
by Vít Ondruch (2014-03-21):
- Rebuid against new scl-utils to depend on -runtime package. Resolves: rhbz#1069109 |