Result for 461946C7179FF88BFAC12882256ABE85D587FAD2

Query result

Key Value
FileName./usr/lib/perl5/vendor_perl/5.34.0/x86_64-linux-thread-multi/Text/Levenshtein/benchmark.pl
FileSize1506
MD52EA4DFB91CE934EB99D62628EED4B026
SHA-1461946C7179FF88BFAC12882256ABE85D587FAD2
SHA-256D7CE9F3A8922C2E15088248AD5A788CAF575306F5231E1ADDF65031121362E86
SSDEEP24:H5V9ukSzrRC1ZorRC1Zo/1olfEEK6EkSEUN8KjOYwioOSiKXEoO9v:Hn9wCECy+1EEcqmOdROvKXjO9v
TLSHT1E831A7004AFD7F0BC15758AE3F5979325436A0B369E810793E2C8A5B072F0043AF86EE
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