Result for A7202CDD832E4E2806E1F3474A86A6485DEDD84E

Query result

Key Value
FileName./usr/lib/perl5/vendor_perl/5.34.0/x86_64-linux-thread-multi/auto/Text/Levenshtein/Flexible/Flexible.so
FileSize29792
MD510DC6E1F500BAB42479FAE5EA227105A
SHA-1A7202CDD832E4E2806E1F3474A86A6485DEDD84E
SHA-2560CA94FAE63D6223B48D562BBC71BA6898F80160BD216919BF9E041CB9F124E6B
SSDEEP384:q/tNjqyfOeevL+BgsYSqZZn210BZWe/Up3+AGpI0x4YfQQ05w+m090:q/tDF2+j7qPn210ufpOAE4Yfj06+mE0
TLSHT149D20942EBF8CDB6C059B8348EE727117538A492437D832F255891371D6BB489F78BCA
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