Finalizing the 1.2.4 update release.v1.2.4

4 files changed, 24 insertions, 15 deletions

diff --git a/History.rdoc b/History.rdoc
index 4b1beae..0512dc3 100644
--- a/History.rdoc
+++ b/History.rdoc
@@ -1,3 +1,14 @@
+=== 1.2.4 / 2013-04-20
+
+* Bugs fixed:
+  * A bug was introduced after 1.1.3 when pruning common sequences at the start
+    of comparison. Paul Kunysch (@pck) fixed this in pull request 18. Thanks!
+    https://github.com/halostatue/diff-lcs/pull/18
+* The Rubinius (1.9 mode) bug in rubinius/rubinius#2268 has been fixed by the
+  Rubinius team two days after it was filed. Thanks for fixing this so quickly!
+  https://github.com/rubinius/rubinius/issues/2268
+* Switching to Raggi's hoe-gemspec2 for gemspec generation.
+
 == 1.2.3 / 2013-04-11
 
 * Bugs Fixed:
diff --git a/README.rdoc b/README.rdoc
index f2d86db..fcb0998 100644
--- a/README.rdoc
+++ b/README.rdoc
@@ -11,16 +11,14 @@ 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.3, fixing a bug in value comparison where the left side of
-the comparison was the empty set, preventing the detection of encoding. Thanks
-to Jon Rowe for fixing this issue. This is a strongly recommended release.
-
-*Note*: There is a known issue with Rubinius in 1.9 mode reported in
-{rubinius/rubinius#2268}[https://github.com/rubinius/rubinius/issues/2268] and
-demonstrated in the Travis CI builds. For all other tested platforms, diff-lcs
-is considered stable. As soon as a suitably small test-case can be created for
-the Rubinius team to examine, this will be added to the Rubinius issue around
-this.
+This is release 1.2.4, fixing a bug introduced after diff-lcs 1.1.3 that did
+not properly prune common sequences at the beginning of a comparison set.
+Thanks to Paul Kunysch for fixing this issue.
+
+Coincident with the release of diff-lcs 1.2.3, we reported an issue with
+Rubinius in 1.9 mode
+({rubinius/rubinius#2268}[https://github.com/rubinius/rubinius/issues/2268]).
+We are happy to report that this issue has been resolved.
 
 == Synopsis
 
diff --git a/diff-lcs.gemspec b/diff-lcs.gemspec
index dc9de40..dd83f35 100644
--- a/diff-lcs.gemspec
+++ b/diff-lcs.gemspec
@@ -2,13 +2,13 @@
 
 Gem::Specification.new do |s|
   s.name = "diff-lcs"
-  s.version = "1.2.3"
+  s.version = "1.2.4"
 
   s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
   s.authors = ["Austin Ziegler"]
   s.cert_chain = ["/Users/AZiegler/.gem/gem-public_cert.pem"]
-  s.date = "2013-04-20"
-  s.description = "Diff::LCS computes the difference between two Enumerable sequences using the\nMcIlroy-Hunt longest common subsequence (LCS) algorithm. It includes utilities\nto create a simple HTML diff output format and a standard diff-like tool.\n\nThis is release 1.2.3, fixing a bug in value comparison where the left side of\nthe comparison was the empty set, preventing the detection of encoding. Thanks\nto Jon Rowe for fixing this issue. This is a strongly recommended release.\n\n*Note*: There is a known issue with Rubinius in 1.9 mode reported in\n{rubinius/rubinius#2268}[https://github.com/rubinius/rubinius/issues/2268] and\ndemonstrated in the Travis CI builds. For all other tested platforms, diff-lcs\nis considered stable. As soon as a suitably small test-case can be created for\nthe Rubinius team to examine, this will be added to the Rubinius issue around\nthis."
+  s.date = "2013-04-21"
+  s.description = "Diff::LCS computes the difference between two Enumerable sequences using the\nMcIlroy-Hunt longest common subsequence (LCS) algorithm. It includes utilities\nto create a simple HTML diff output format and a standard diff-like tool.\n\nThis is release 1.2.4, fixing a bug introduced after diff-lcs 1.1.3 that did\nnot properly prune common sequences at the beginning of a comparison set.\nThanks to Paul Kunysch for fixing this issue.\n\nCoincident with the release of diff-lcs 1.2.3, we reported an issue with\nRubinius in 1.9 mode\n({rubinius/rubinius#2268}[https://github.com/rubinius/rubinius/issues/2268]).\nWe are happy to report that this issue has been resolved."
   s.email = ["austin@rubyforge.org"]
   s.executables = ["htmldiff", "ldiff"]
   s.extra_rdoc_files = ["Contributing.rdoc", "History.rdoc", "License.rdoc", "Manifest.txt", "README.rdoc", "docs/COPYING.txt", "docs/artistic.txt", "Contributing.rdoc", "History.rdoc", "License.rdoc", "README.rdoc"]
diff --git a/lib/diff/lcs.rb b/lib/diff/lcs.rb
index 33d9fc1..fcc5cc5 100644
--- a/lib/diff/lcs.rb
+++ b/lib/diff/lcs.rb
@@ -1,7 +1,7 @@
 # -*- ruby encoding: utf-8 -*-
 
 module Diff; end unless defined? Diff
-# = Diff::LCS 1.2.3
+# = Diff::LCS 1.2.4
 #
 # Computes "intelligent" differences between two sequenced Enumerables. This
 # is an implementation of the McIlroy-Hunt "diff" algorithm for Enumerable
@@ -129,7 +129,7 @@ module Diff; end unless defined? Diff
 # Common Subsequences</em>, CACM, vol.20, no.5, pp.350-353, May
 # 1977, with a few minor improvements to improve the speed."
 module Diff::LCS
-  VERSION = '1.2.3'
+  VERSION = '1.2.4'
 end
 
 require 'diff/lcs/callbacks'