ruby-diff-lcs 1.5.0-1 source package in Ubuntu
Changelog
ruby-diff-lcs (1.5.0-1) unstable; urgency=medium * Team upload * New upstream version 1.5.0 * Bump Standards-Version to 4.6.0, no changes needed * debian/upstream/metadata: refresh from template * Drop local patch, not necessary anymore -- Antonio Terceiro <email address hidden> Sun, 24 Apr 2022 20:10:05 -0300
Upload details
- Uploaded by:
- Debian Ruby Extras Maintainers
- Uploaded to:
- Sid
- Original maintainer:
- Debian Ruby Extras Maintainers
- Architectures:
- all
- Section:
- ruby
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Mantic | release | universe | ruby | |
| Lunar | release | universe | ruby |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| ruby-diff-lcs_1.5.0-1.dsc | 2.0 KiB | 85f05fd9748b028268ae013b2fa8345fbbeca60f932f5763e33d09748fa7cfdc |
| ruby-diff-lcs_1.5.0.orig.tar.gz | 49.3 KiB | 7f8fcfcefdc6adbe0d66b5a96946e0f8b87d4b4ad58159524a7dffe916187b36 |
| ruby-diff-lcs_1.5.0-1.debian.tar.xz | 3.9 KiB | 5bb4fbe6742ff0d804c79467e105d8ecca41395cc08dbcd3fb38432dbdf846c4 |
Available diffs
- diff from 1.4.4-1 to 1.5.0-1 (12.4 KiB)
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).
