Result for FED7A9701D648BFB5B6F75F58A66A5E4070CBC1C

Query result

Key Value
FileName./usr/share/doc/perl-Text-Levenshtein-Flexible/README
FileSize1410
MD5DEA961A1A9A40C90133C0302718F7B40
SHA-1FED7A9701D648BFB5B6F75F58A66A5E4070CBC1C
SHA-2562158117387B8638D7B7C8522244F72900F22A27E7743BC32B6F529BEC1B17A99
SSDEEP24:3l+gxHAn6NJpjffVCKxDbZvhL/6Crd7yllXplIWgS9jdMAD9NL3qxOV:3fpBRj/nhQCrNyXZ+WPJb9NLoOV
TLSHT1E821747A17DCB6734C8713EC19BF02A1B7B1491575761AA07C6CC0C4232BB4D46BAACD
hashlookup:parent-total9
hashlookup:trust95

Network graph view

Parents (Total: 9)

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

Key Value
MD5C44E6CAE261B29DC6870DC9A46FB891D
PackageArcharmv7hl
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.
PackageMaintainerbcornec <bcornec>
PackageNameperl-Text-Levenshtein-Flexible
PackageRelease3.mga8
PackageVersion0.90.0
SHA-11FA1A056424D64C7788F766C3699DC5F377677A6
SHA-2561A864146344DA29DBC487E31186885501174251B3B2C59533D295911BBDC8054
Key Value
MD5C58E7F595E05971B8E86F32C7E0EA02A
PackageArchaarch64
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.
PackageMaintainerbcornec <bcornec>
PackageNameperl-Text-Levenshtein-Flexible
PackageRelease3.mga8
PackageVersion0.90.0
SHA-1547EB35AEDEA80E49750F7989882390E744E0A9B
SHA-256C0CE69945CE1F6B0A19AB952DB393FBC62C6D001CD8B59F7A129BE423CA75495
Key Value
MD5792FF8E90B40C3C586E7229F036CD7A6
PackageArchaarch64
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.
PackageMaintainerumeabot <umeabot>
PackageNameperl-Text-Levenshtein-Flexible
PackageRelease3.mga9
PackageVersion0.90.0
SHA-190D43EFDB83AC7BC77A6E7AAAEF8B70342A73493
SHA-256209E13AD9611CBBD4E48B74867D9BA0A99F9B185DB0AF18D6A877D69C040C13D
Key Value
MD501DB091E15A5F6B2D5C0A9313E4CB729
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.
PackageMaintainerumeabot <umeabot>
PackageNameperl-Text-Levenshtein-Flexible
PackageRelease3.mga9
PackageVersion0.90.0
SHA-1F1387D30A25C9CA1E10EF76D209C58247951683B
SHA-2562061F39807F9B54B2AF63485956A288E6E313DFE70B53F8F4F56621626ED6EAD
Key Value
MD54F2A21C93308530E7D8015F8AE8B706A
PackageArchi586
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.
PackageMaintainerbcornec <bcornec>
PackageNameperl-Text-Levenshtein-Flexible
PackageRelease3.mga8
PackageVersion0.90.0
SHA-12FF787F0FD1F1E1F2FD561D43B14D179539AA5D5
SHA-2560CF530346265DC031D05BE885DADABB0AB0440B5D3212E7F523007DA86B8D575
Key Value
MD5C3B640856580E38E006521076CD4F311
PackageArcharmv7hl
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.
PackageMaintainerumeabot <umeabot>
PackageNameperl-Text-Levenshtein-Flexible
PackageRelease3.mga9
PackageVersion0.90.0
SHA-1ECF664321EBE4EC15D7C562BC2C94F579FDF85A1
SHA-256332574E53F75BA5CDE15E0D43DC1F9260E1D7A462F50237C36D90F48618E4222
Key Value
MD57DC348382712E240841BE62B8F5B4654
PackageArchi586
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.
PackageMaintainerumeabot <umeabot>
PackageNameperl-Text-Levenshtein-Flexible
PackageRelease3.mga9
PackageVersion0.90.0
SHA-128233FE1580AD5037CFBFA5AB9E9D346A039F48C
SHA-256DA27D5160954B75D701075AC58837C43857FEDCB5EB161778A42C1CBD40D9174
Key Value
MD5E34241B1735B3C32BF8F596049AE43EF
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.
PackageMaintainerbcornec <bcornec>
PackageNameperl-Text-Levenshtein-Flexible
PackageRelease3.mga8
PackageVersion0.90.0
SHA-13210D63ECE6A3F9D5296EAAF0E6D5BF636EC5145
SHA-256D417D7626C38EEB80A214853B3370D32608AADCC24EFD0228D1B518497C5230C
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