35 lines
1.8 KiB
Ruby
35 lines
1.8 KiB
Ruby
# -*- encoding: utf-8 -*-
|
|
|
|
Gem::Specification.new do |s|
|
|
s.name = %q{diff-lcs}
|
|
s.version = "1.1.2"
|
|
|
|
s.required_rubygems_version = nil if s.respond_to? :required_rubygems_version=
|
|
s.autorequire = %q{diff/lcs}
|
|
s.cert_chain = nil
|
|
s.date = %q{2004-10-20}
|
|
s.description = %q{Diff::LCS is a port of Algorithm::Diff that uses the McIlroy-Hunt 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, 1993) and Ned Konz's Perl version (Algorithm::Diff).}
|
|
s.email = %q{diff-lcs@halostatue.ca}
|
|
s.executables = ["ldiff", "htmldiff"]
|
|
s.extra_rdoc_files = ["README", "ChangeLog", "Install"]
|
|
s.files = ["bin", "ChangeLog", "Install", "lib", "Rakefile", "README", "tests", "bin/htmldiff", "bin/ldiff", "lib/diff", "lib/diff/lcs", "lib/diff/lcs.rb", "lib/diff/lcs/array.rb", "lib/diff/lcs/block.rb", "lib/diff/lcs/callbacks.rb", "lib/diff/lcs/change.rb", "lib/diff/lcs/hunk.rb", "lib/diff/lcs/ldiff.rb", "lib/diff/lcs/string.rb", "tests/00test.rb"]
|
|
s.homepage = %q{http://rubyforge.org/projects/ruwiki/}
|
|
s.rdoc_options = ["--title", "Diff::LCS -- A Diff Algorithm", "--main", "README", "--line-numbers"]
|
|
s.require_paths = ["lib"]
|
|
s.required_ruby_version = Gem::Requirement.new(">= 1.8.1")
|
|
s.rubyforge_project = %q{ruwiki}
|
|
s.rubygems_version = %q{1.3.5}
|
|
s.summary = %q{Provides a list of changes that represent the difference between two sequenced collections.}
|
|
s.test_files = ["tests/00test.rb"]
|
|
|
|
if s.respond_to? :specification_version then
|
|
current_version = Gem::Specification::CURRENT_SPECIFICATION_VERSION
|
|
s.specification_version = 1
|
|
|
|
if Gem::Version.new(Gem::RubyGemsVersion) >= Gem::Version.new('1.2.0') then
|
|
else
|
|
end
|
|
else
|
|
end
|
|
end
|