ruby-diff-lcs 1.3-1 source package in Ubuntu


ruby-diff-lcs (1.3-1) unstable; urgency=medium

  [ C├ędric Boutillier ]
  * Bump debhelper compatibility level to 9
  * Use https:// in Vcs-* fields
  * Use https:// in Vcs-* fields
  * Bump Standards-Version to 3.9.7 (no changes needed)
  * Run wrap-and-sort on packaging files

  [ Lucas Nussbaum ]
  * New upstream version 1.3
  * Bump Standards-Version. No changes needed.
  * Refresh packaging
  * Refresh patches

 -- Lucas Nussbaum <email address hidden>  Thu, 06 Jul 2017 22:34:19 +0200

Upload details

Uploaded by:
Debian Ruby Extras Maintainers on 2017-07-07
Uploaded to:
Original maintainer:
Debian Ruby Extras Maintainers
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Groovy release on 2020-04-24 universe ruby
Focal release on 2019-10-18 universe ruby
Eoan release on 2019-04-18 universe ruby
Disco release on 2018-10-30 universe ruby
Cosmic release on 2018-05-01 universe ruby
Bionic release on 2017-10-24 universe ruby
Artful release on 2017-07-07 universe ruby


Artful: [FULLYBUILT] amd64


File Size SHA-256 Checksum
ruby-diff-lcs_1.3-1.dsc 2.1 KiB ad734a7cb58cf8036d726c037510fe29472cb20aca6bc6f2c5ad2647ed1d2d44
ruby-diff-lcs_1.3.orig.tar.gz 41.9 KiB 14e5c07af5efa9a4d16ec145a2e9d7e01c755d445441bfe87dd5bd68b597213a
ruby-diff-lcs_1.3-1.debian.tar.xz 3.9 KiB 6e71cc058329fcc39566d9e5d71d09aff6c36097c8d39103510a4f6259f3aab3

No changes file available.

Binary packages built by this source

ruby-diff-lcs: 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).