Calculates the Levenshtein distance between two byte strings
16.53 KB
built 2026-10-17 21:05:18 GMT
Description
Calculates the Levenshtein distance between two byte strings.
The Levenshtein distance is a metric for measuring the amount
of difference between two sequences (i.e., the so called edit
distance). The Levenshtein distance between two sequences is
given by the minimum number of operations needed to transform
one sequence into the other, where an operation is an
insertion, deletion, or substitution of a single element.
Dependencies
15 totalRequires11
- libc.so.6()(64bit)
- libc.so.6(GLIBC_2.27)(64bit)
- libruby.so.4.0()(64bit)
- rpmlib(CompressedFileNames) <= 3.0.4-1
- rpmlib(FileDigests) <= 4.6.0-1
- rpmlib(PayloadFilesHavePrefix) <= 4.0-1
- rpmlib(PayloadIsZstd) <= 5.4.18-1
- rtld(GNU_HASH)
- ruby(release)
- ruby(rubygems)
- ruby(rubygems)
Provides4
- rubygem(levenshtein) = 0.2.2
- rubygem(levenshtein) = 0.2.2
- rubygem-levenshtein = 0.2.2-44.fc45
- rubygem-levenshtein(riscv-64) = 0.2.2-44.fc45
ObsoletesNo Obsoletes
ConflictsNo Conflicts
RecommendsNo Recommends
SuggestsNo Suggests
SupplementsNo Supplements
EnhancesNo Enhances
Files
17
Files 1–17 of 17
Component of
buildroots that installed this RPMNo Buildroots