openKylin ruby-diff-lcs package

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

Changelog

ruby-diff-lcs (1.6.2-ok1) huanghe; urgency=medium

  * Build for openKylin.

 -- openKylinBot <email address hidden>  Wed, 03 Jun 2026 11:27:08 +0800

Upload details

Uploaded by:
openKylinBot
Sponsored by:
Cibot
Uploaded to:
Huanghe V3.0
Original maintainer:
Openkylin Developers
Architectures:
all
Section:
ruby
Urgency:
Medium Urgency

Publishing See full publishing history

Series Pocket Published Component Section
Huanghe V3.0 proposed main ruby

Downloads

File Size SHA-256 Checksum
ruby-diff-lcs_1.6.2.orig.tar.gz 55.7 KiB 4f084230423e91953983eac97ce9362dd5556ab836d224161654fa42bfeb7055
ruby-diff-lcs_1.6.2-ok1.debian.tar.xz 2.5 KiB d767a069ebbeae43408d64a47a5e2ede82aa350019cc3fd1b00528f2881e40b9
ruby-diff-lcs_1.6.2-ok1.dsc 1.8 KiB 49f5711f32d80ea592a03e663d9d946c36d23ae7c953a15ac3b8fb64d3047667

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