haskell-text-metrics 0.3.0-5 source package in Ubuntu
Changelog
haskell-text-metrics (0.3.0-5) unstable; urgency=medium * Bump containers bounds -- Gianfranco Costamagna <email address hidden> Tue, 06 Aug 2019 09:05:46 +0200
Upload details
- Uploaded by:
- Debian Haskell Group
- Uploaded to:
- Sid
- Original maintainer:
- Debian Haskell Group
- Architectures:
- any all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Focal | release | universe | misc |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
haskell-text-metrics_0.3.0-5.dsc | 2.5 KiB | ecf4c5f7da75dd41c2580491e7ae127daf92892f781e8bd6cda3da71707be655 |
haskell-text-metrics_0.3.0.orig.tar.gz | 8.1 KiB | 3874af74060e35f01702640b353ac2180d93bb5d292a204e0ee3cadd26efbfa2 |
haskell-text-metrics_0.3.0-5.debian.tar.xz | 2.8 KiB | 92f2f589b48c4e32242b79c655f2dcfdd8ea5b7658f16199cb8e3b8045929814 |
Available diffs
- diff from 0.3.0-4 to 0.3.0-5 (580 bytes)
- diff from 0.3.0-4build2 (in Ubuntu) to 0.3.0-5 (248 bytes)
No changes file available.
Binary packages built by this source
- libghc-text-metrics-dev: No summary available for libghc-text-metrics-dev in ubuntu eoan.
No description available for libghc-
text-metrics- dev in ubuntu eoan.
- libghc-text-metrics-doc: Calculate various string metrics efficiently; documentation
This library provides efficient implementations of various strings metric
algorithms. It works with strict Text values.
.
The current version implements the following algorithms:
.
* Levenshtein distance
* Normalized Levenshtein distance
* Damerau-Levenshtein distance
* Normalized Damerau-Levenshtein distance
* Hamming distance
* Jaro distance
* Jaro-Winkler distance
* Overlap coefficient
* Jaccard similarity coefficient
.
This package provides the documentation for a library for the Haskell
programming language.
See http://www.haskell. org/ for more information on Haskell.
- libghc-text-metrics-prof: Calculate various string metrics efficiently; profiling libraries
This library provides efficient implementations of various strings metric
algorithms. It works with strict Text values.
.
The current version implements the following algorithms:
.
* Levenshtein distance
* Normalized Levenshtein distance
* Damerau-Levenshtein distance
* Normalized Damerau-Levenshtein distance
* Hamming distance
* Jaro distance
* Jaro-Winkler distance
* Overlap coefficient
* Jaccard similarity coefficient
.
This package provides a library for the Haskell programming language, compiled
for profiling. See http://www.haskell. org/ for more information on Haskell.