Source: ruby-diff-lcs
Section: ruby
Maintainer: Debian Ruby Team <pkg-ruby-extras-maintainers@lists.alioth.debian.org>
Uploaders: Lucas Nussbaum <lucas@debian.org>,
           Cédric Boutillier <boutil@debian.org>
Build-Depends: debhelper-compat (= 14),
               gem2deb (>= 1),
               rake,
               ruby,
               ruby-rspec
Standards-Version: 4.7.4
Vcs-Git: https://salsa.debian.org/ruby-team/ruby-diff-lcs.git
Vcs-Browser: https://salsa.debian.org/ruby-team/ruby-diff-lcs
Homepage: https://github.com/halostatue/diff-lcs
Testsuite: autopkgtest-pkg-ruby

Package: ruby-diff-lcs
Architecture: all
Description: McIlroy-Hunt longest common subsequence algorithm implementation
 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,
 and Ned Konz's Perl version (Algorithm::Diff).