Group :: Development/Ruby
RPM: ruby-diff-lcs
Navigation
Main Changelog Spec Patches Sources Download Gear Bugs and FR Repocop
Current version: 1.1.2-alt1
Build date: 25 august 2008, 21:32 ( 817.3 weeks ago )
Size: 28.05 Kb
Home page: http://rubyforge.org/projects/ruwiki/
License: MIT
Summary: Port of Algorithm::Diff
Description:
List of contributors List of rpms provided by this srpm:
ACL:
Build date: 25 august 2008, 21:32 ( 817.3 weeks ago )
Size: 28.05 Kb
Home page: http://rubyforge.org/projects/ruwiki/
License: MIT
Summary: Port of Algorithm::Diff
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).
Current maintainer: Ruby Maintainers Team 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).
List of contributors List of rpms provided by this srpm:
- ruby-diff-lcs
- ruby-diff-lcs-doc