openKylin libtext-levenshteinxs-perl package

libtext-levenshteinxs-perl 0.03-ok2 source package in openKylin

Changelog

libtext-levenshteinxs-perl (0.03-ok2) nile; urgency=medium

  * No change rebuild against perl-5.36

 -- CI Bot <email address hidden>  Mon, 15 Apr 2024 07:11:21 +0000

Upload details

Uploaded by:
Cibot
Uploaded to:
Nile V2.0
Original maintainer:
Openkylin Developers
Architectures:
any
Section:
perl
Urgency:
Medium Urgency

Publishing See full publishing history

Series Pocket Published Component Section
Huanghe V3.0 proposed main perl
Huanghe V3.0 release main perl
Nile V2.0 release main perl
Nile V2.0 proposed main perl

Downloads

File Size SHA-256 Checksum
libtext-levenshteinxs-perl_0.03.orig.tar.gz 3.0 KiB 5c98659aff21b892a0c4270df5d8997c53be9bbec3c1580c6ffa8fc6711f7715
libtext-levenshteinxs-perl_0.03-ok2.debian.tar.xz 1.5 KiB 0ab0c794031c7a4c9c208cd02ac8007e90c596fd59d80c0148efe2623193b96a
libtext-levenshteinxs-perl_0.03-ok2.dsc 1.9 KiB 8a6b0983c2ed79b6e7e20a12a2666944857f3ba66c67e341091b2d78e4fa5b48

Available diffs

View changes file

Binary packages built by this source

libtext-levenshteinxs-perl: XS implementation of the Levenshtein edit distance

 Text::LevenshteinXS implements the Levenshtein edit distance in a XS way; this
 should be much faster than the pure Perl implementation.
 .
 The Levenshtein edit distance is a measure of the degree of proximity between
 two strings. This distance is the number of substitutions, deletions or
 insertions ("edits") needed to transform one string into the other one (and
 vice versa). When two strings have distance 0, they are the same.

libtext-levenshteinxs-perl-dbgsym: debug symbols for libtext-levenshteinxs-perl