summaryrefslogtreecommitdiff
path: root/lib/diff
diff options
context:
space:
mode:
authorAustin Ziegler <austin@zieglers.ca>2013-02-09 10:36:45 -0500
committerAustin Ziegler <austin@zieglers.ca>2013-02-09 10:36:45 -0500
commit485027b970665b39d51dac91a5e0c2f580cd3bf1 (patch)
tree3e79c0ffc015c8ce451e3bfcf892be00b08ba4d8 /lib/diff
parent554fc733222a33abf7e5e919a9c293ff77d38aa8 (diff)
downloaddiff-lcs-485027b970665b39d51dac91a5e0c2f580cd3bf1.tar.gz
History update for release; version bump.
Diffstat (limited to 'lib/diff')
-rw-r--r--lib/diff/lcs.rb4
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/diff/lcs.rb b/lib/diff/lcs.rb
index 93ffac6..7a8b982 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.0
+# = Diff::LCS 1.2.1
#
# 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.0'
+ VERSION = '1.2.1'
end
require 'diff/lcs/callbacks'