summaryrefslogtreecommitdiff
path: root/README.rdoc
diff options
context:
space:
mode:
authorAustin Ziegler <austin@zieglers.ca>2013-03-30 17:12:43 -0400
committerAustin Ziegler <austin@zieglers.ca>2013-03-30 17:14:19 -0400
commit4122e0b9e52fd6fc659dd5f1fc9f844a43ff02cf (patch)
treec97177a9dd6f3c3f84a09dcf87947908480177e4 /README.rdoc
parenta72fbdc67d2be6937fd94baf9372bbb994b01be1 (diff)
downloaddiff-lcs-4122e0b9e52fd6fc659dd5f1fc9f844a43ff02cf.tar.gz
Finalizing encoding-aware diff fixes.
* Diff::LCS::Hunk could not properly generate a difference for comparison sets that are not US-ASCII-compatible because of the use of literal regular expressions and strings. Jon Rowe (JonRowe) found this in rspec/rspec-expectations#219 and provided a first pass implementation in diff-lcs#15. I've reworked it because of test failures in Rubinius when running in Ruby 1.9 mode. This coerces the added values to the encoding of the old dataset (as determined by the first piece of the old dataset). https://github.com/rspec/rspec-expectations/issues/219 https://github.com/halostatue/diff-lcs/pull/15 * Adding Travis CI testing for Ruby 2.0.
Diffstat (limited to 'README.rdoc')
-rw-r--r--README.rdoc6
1 files changed, 3 insertions, 3 deletions
diff --git a/README.rdoc b/README.rdoc
index f7758eb..afb421e 100644
--- a/README.rdoc
+++ b/README.rdoc
@@ -11,9 +11,9 @@ Diff::LCS computes the difference between two Enumerable sequences using the
McIlroy-Hunt longest common subsequence (LCS) algorithm. It includes utilities
to create a simple HTML diff output format and a standard diff-like tool.
-This is release 1.2.1, restoring the public API to what existed in Diff::LCS
-1.1.x. Everyone is strongly encouraged to upgrade to this version as it fixes
-all known outstanding issues.
+This is release 1.2.2, fixing a bug that prevented comparison of values that
+are not US-ASCII-compatible. Thanks to Jon Rowe for finding and providing most
+of the work behind this issue. This is a recommended release.
== Synopsis