success 26613 Diff-LCS 2008-11-12T05:31:24Z 2009-02-28T09:46:33Z Diff::LCS README ================ Diff::LCS is a port of Algorithm::Diff[1] that uses the McIlroy-Hunt longest common subsequence (LCS) algorithm to compute intelligent differences between two sequenced enumerable containers[2]. The implementation is based on Mario I. Wolczko's[3] Smalltalk version (1.2, 1993)[4] and Ned Konz's[5] Perl version (Algorithm::Diff)[6]. This release is version 1.1.2, fixing an htmldiff bug in 1.1.1. Version 1.1.0 added new features, including the ability to #patch and #unpatch changes as well as a new contextual diff callback, Diff::LCS::ContextDiffCallbacks, that should improve the context sensitivity of patching. Using this module is quite simple. By default, Diff::LCS does not extend objects with the Diff::LCS interface, but will be called as if it wer http://raa.ruby-lang.org/project/diff-lcs/ http://rubyforge.org/frs/?group_id=84&release_id=975 diff-lcs 0 0 466719 466719 26613 2009-11-25T22:03:30Z 2009-11-25T22:03:22Z 2007-02-01T00:00:00Z 2007-02-01T00:00:00Z 0 1954 12 Ruby Ruby License Ruby License