python-levenshtein 0.12.2-1build1 source package in Ubuntu

Changelog

python-levenshtein (0.12.2-1build1) hirsute; urgency=medium

  * No change rebuild with fixed ownership.

 -- Dimitri John Ledkov <email address hidden>  Tue, 16 Feb 2021 17:04:56 +0000

Upload details

Uploaded by:
Dimitri John Ledkov on 2021-02-16
Uploaded to:
Hirsute
Original maintainer:
Ubuntu Developers
Architectures:
any
Section:
python
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Impish release on 2021-04-23 universe python
Hirsute release on 2021-02-17 universe python

Downloads

File Size SHA-256 Checksum
python-levenshtein_0.12.2.orig.tar.xz 39.4 KiB 2749ecd2443fa33c486f4bd44d27069c79079f53dd8d4fcfaefa2a3a0ce462f2
python-levenshtein_0.12.2-1build1.debian.tar.xz 3.8 KiB 8a035f54d1e3f40ebf29c81e8c9e88ec9448c127cf9d63ba59c866021c91c85f
python-levenshtein_0.12.2-1build1.dsc 2.2 KiB 7ca4ad4c4101b7bf5bc96d4644e62ced8ca507c9aef8e54cb191196ce9bd5dd2

View changes file

Binary packages built by this source

python3-levenshtein: extension for computing string similarities and edit distances (Python 3)

 The Levenshtein module computes Levenshtein distances, similarity ratios,
 generalized medians and set medians of Unicode or non-Unicode strings.
 Because it's implemented in C, it's much faster than the corresponding
 Python library functions and methods.
 .
 The Levenshtein distance is the minimum number of single-character
 insertions, deletions, and substitutions to transform one string into
 another.
 .
 It is useful for spell checking, or fuzzy matching of gettext messages.
 .
 This package contains Levenshtein for Python 3.

python3-levenshtein-dbg: extension for computing string similarities and edit distances(py3k debug ext)

 The Levenshtein module computes Levenshtein distances, similarity ratios,
 generalized medians and set medians of Unicode or non-Unicode strings.
 Because it's implemented in C, it's much faster than the corresponding
 Python library functions and methods.
 .
 The Levenshtein distance is the minimum number of single-character
 insertions, deletions, and substitutions to transform one string into
 another.
 .
 It is useful for spell checking, or fuzzy matching of gettext messages.
 .
 This package contains the extensions built for the Python 3 debug interpreter.