Result for 871867B8A72437812681FD046BFEA854DC744978

Query result

Key Value
FileName./usr/share/man/man3/Text::Levenshtein::Flexible.3pm.gz
FileSize4040
MD59BE73875E01403CEB0463F2399389374
SHA-1871867B8A72437812681FD046BFEA854DC744978
SHA-256C7151A5CAF8DA7A3DF97E9624CD2FA0C79446AACC8172369E47A80D44F13F842
SSDEEP96:4HBcLQ5JiLbNStgkgNCcDAFCUrl8vxRnDxPEWhvKeseYC:4HBaQJiLbNSxgNCJHl85tphvD
TLSHT196818D2C9CD597B02B6B8130AB69A84C3C655FDFE25CBAB18C0A4E445ECC113AA970C9
hashlookup:parent-total1
hashlookup:trust55

Network graph view

Parents (Total: 1)

The searched file hash is included in 1 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
MD50B88CFC040DAA494EEFCAC2614DD9755
PackageArchx86_64
PackageDescriptionYet another Levenshtein module written in C, but a tad more flexible than the rest. This module uses code from PostgreSQL's levenshtein distance function to provide the following features on top of plain distance calculation as it is done by Levenshtein::XS and others: * Distance-limited calculation: if a certain maximum distance is exceeded, the algorithm aborts without result. This helps performance in situations where it is clear that results over a certain maximum are not useful. * Configurable costs for insert, delete ans substitute operations. The traditional Levenshtein algorithm assumes equal cost for insertion and deletion but modifying these allows preferential correction of certain errors.
PackageNameperl-Text-Levenshtein-Flexible
PackageRelease1.83
PackageVersion0.09
SHA-1AC4E72B6DCC2033A42B1DE6C9A17D0D271138B97
SHA-2561570E2FA0E17812BBBAAADBCA072301FE54F5AE861F2F9536D46FD253E604541