--- !ruby/object:Gem::Specification 
name: diff-lcs
version: !ruby/object:Gem::Version 
  hash: 21
  prerelease: 
  segments: 
  - 1
  - 1
  - 3
  version: 1.1.3
platform: ruby
authors: 
- Austin Ziegler
autorequire: 
bindir: bin
cert_chain: []

date: 2011-08-28 00:00:00 Z
dependencies: 
- !ruby/object:Gem::Dependency 
  name: rspec
  prerelease: false
  requirement: &id001 !ruby/object:Gem::Requirement 
    none: false
    requirements: 
    - - ~>
      - !ruby/object:Gem::Version 
        hash: 3
        segments: 
        - 2
        - 0
        version: "2.0"
  type: :development
  version_requirements: *id001
- !ruby/object:Gem::Dependency 
  name: hoe
  prerelease: false
  requirement: &id002 !ruby/object:Gem::Requirement 
    none: false
    requirements: 
    - - ~>
      - !ruby/object:Gem::Version 
        hash: 27
        segments: 
        - 2
        - 12
        version: "2.12"
  type: :development
  version_requirements: *id002
description: |-
  Diff::LCS is a port of Perl's 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}[ftp://st.cs.uiuc.edu/pub/Smalltalk/MANCHESTER/manchester/4.0/diff.st]
  (1993) and Ned Konz's Perl version
  {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
  as well as a new contextual diff callback, Diff::LCS::ContextDiffCallbacks,
  that should improve the context sensitivity of patching.
  
  This library is called Diff::LCS because of an early version of Algorithm::Diff
  which was restrictively licensed. This version has seen a minor license change:
  instead of being under Ruby's license as an option, the third optional license
  is the MIT license.
email: 
- austin@rubyforge.org
executables: 
- htmldiff
- ldiff
extensions: []

extra_rdoc_files: 
- Manifest.txt
- docs/COPYING.txt
- History.rdoc
- License.rdoc
- README.rdoc
files: 
- History.rdoc
- License.rdoc
- Manifest.txt
- README.rdoc
- Rakefile
- bin/htmldiff
- bin/ldiff
- diff-lcs.gemspec
- docs/COPYING.txt
- docs/artistic.html
- lib/diff-lcs.rb
- 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/htmldiff.rb
- lib/diff/lcs/hunk.rb
- lib/diff/lcs/ldiff.rb
- lib/diff/lcs/string.rb
- spec/diff_spec.rb
- spec/lcs_spec.rb
- spec/patch_spec.rb
- spec/sdiff_spec.rb
- spec/spec_helper.rb
- spec/traverse_balanced_spec.rb
- spec/traverse_sequences_spec.rb
- .gemtest
homepage: 
licenses: []

post_install_message: 
rdoc_options: 
- --main
- README.rdoc
require_paths: 
- lib
required_ruby_version: !ruby/object:Gem::Requirement 
  none: false
  requirements: 
  - - ">="
    - !ruby/object:Gem::Version 
      hash: 3
      segments: 
      - 0
      version: "0"
required_rubygems_version: !ruby/object:Gem::Requirement 
  none: false
  requirements: 
  - - ">="
    - !ruby/object:Gem::Version 
      hash: 3
      segments: 
      - 0
      version: "0"
requirements: []

rubyforge_project: ruwiki
rubygems_version: 1.8.10
signing_key: 
specification_version: 3
summary: Diff::LCS is a port of Perl's Algorithm::Diff that uses the McIlroy-Hunt longest common subsequence (LCS) algorithm to compute intelligent differences between two sequenced enumerable containers
test_files: []

