ruby-diff-lcs 1.5.1-ok1 source package in openKylin

Changelog

ruby-diff-lcs (1.5.1-ok1) nile; urgency=medium

  * update version info.

 -- liyang <email address hidden>  Mon, 17 Jun 2024 15:07:28 +0800

Upload details

Uploaded by:
liyang
Sponsored by:
Cibot
Uploaded to:
Nile V2.0
Original maintainer:
Openkylin Developers
Architectures:
all
Section:
ruby
Urgency:
Medium Urgency

Publishing See full publishing history

Series Pocket Published Component Section
Nile V2.0 release main ruby
Nile V2.0 proposed main ruby

Builds

Nile V2.0: [FULLYBUILT] amd64

Downloads

File Size SHA-256 Checksum
ruby-diff-lcs_1.5.1.orig.tar.gz 49.4 KiB 9f78e3ccba9d521ac1ba9cc621a7facdb4855f0e9e0509e4f41a80b5b9846586
ruby-diff-lcs_1.5.1-ok1.debian.tar.xz 2.5 KiB fa9a6547bf5bc8cc17082bfa55f5daabf27ef9b8f08b7969dd3110adc5aa56c5
ruby-diff-lcs_1.5.1-ok1.dsc 1.8 KiB a3850b693287532ade928518d40fb49c2bccbf9441e4287bd7032ad0b1d2f8c9

Available diffs

View changes file

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).