summaryrefslogtreecommitdiff
path: root/README.rdoc
diff options
context:
space:
mode:
authorAustin Ziegler <austin@halostatue.ca>2011-07-31 03:39:42 -0400
committerAustin Ziegler <austin@halostatue.ca>2011-07-31 03:39:42 -0400
commit2276593be732e5c91cac144d1fad0310e072613b (patch)
treeecb9e96942c3cf0990b8ff288c0af2f0b02e1653 /README.rdoc
parent743cff65ed6826c48b967c3064783809da7bc1b7 (diff)
downloaddiff-lcs-2276593be732e5c91cac144d1fad0310e072613b.tar.gz
Convert to RSpec
Diffstat (limited to 'README.rdoc')
-rw-r--r--README.rdoc2
1 files changed, 1 insertions, 1 deletions
diff --git a/README.rdoc b/README.rdoc
index 889142b..a887b16 100644
--- a/README.rdoc
+++ b/README.rdoc
@@ -6,7 +6,7 @@ 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}[ftp://st.cs.uiuc.edu/pub/Smalltalk/MANCHESTER/manchester/4.0/diff.st]
(1993) and Ned Konz's Perl version
-{Algorithm::Diff}[http://search.cpan.org/~nedkonz/Algorithm-Diff-1.15/].
+{Algorithm::Diff 1.15}[http://search.cpan.org/~nedkonz/Algorithm-Diff-1.15/].
This is release 1.1.3, fixing several small bugs found over the years. Version
1.1.0 added new features, including the ability to #patch and #unpatch changes