summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--diff-lcs.gemspec2
1 files changed, 0 insertions, 2 deletions
diff --git a/diff-lcs.gemspec b/diff-lcs.gemspec
index dd83f35..2c18b9e 100644
--- a/diff-lcs.gemspec
+++ b/diff-lcs.gemspec
@@ -6,7 +6,6 @@ Gem::Specification.new do |s|
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-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"]
@@ -18,7 +17,6 @@ Gem::Specification.new do |s|
s.require_paths = ["lib"]
s.rubyforge_project = "diff-lcs"
s.rubygems_version = "1.8.25"
- s.signing_key = "/Users/AZiegler/.gem/gem-private_key.pem"
s.summary = "Diff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm"
if s.respond_to? :specification_version then