summaryrefslogtreecommitdiffstats
path: root/ruby
diff options
context:
space:
mode:
author B. Watson <yalhcru@gmail.com>2022-03-14 11:49:13 -0400
committer B. Watson <yalhcru@gmail.com>2022-03-17 12:38:01 -0400
commitcb97d0c454567ba03a05f6406a24e20b8211785e (patch)
tree65f0177c916017fc1988ef197773f8d20bd75ae5 /ruby
parentb10a39279e7a2fe4bb488781f8805e52a700840f (diff)
downloadslackbuilds-cb97d0c454567ba03a05f6406a24e20b8211785e.tar.gz
slackbuilds-cb97d0c454567ba03a05f6406a24e20b8211785e.tar.xz
ruby/rubygem-diff-lcs: Wrap README at 72 columns.
Signed-off-by: B. Watson <yalhcru@gmail.com>
Diffstat (limited to 'ruby')
-rw-r--r--ruby/rubygem-diff-lcs/README7
1 files changed, 4 insertions, 3 deletions
diff --git a/ruby/rubygem-diff-lcs/README b/ruby/rubygem-diff-lcs/README
index 37422f7619..027315d6f6 100644
--- a/ruby/rubygem-diff-lcs/README
+++ b/ruby/rubygem-diff-lcs/README
@@ -1,3 +1,4 @@
-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.
+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.