Result for 59B38424F23E45D9585B94BD3CFE43BB79242078

Query result

Key Value
FileNamesnap-hashlookup-import/usr/share/doc-base/python-levenshtein3
FileSize310
MD5A3CCBEEDE5ED446ED9C50379C54843D3
SHA-159B38424F23E45D9585B94BD3CFE43BB79242078
SHA-256CE73E12610D96FCE853386FF23A869BD8FCD67EA935B000ED85D62DC3201EDE4
SHA-512C561F8E3C9CE7859ACEFCD39A206B79F42A2FCC15D04DA114D58911FA913C5D36E4C85230DB9C1C18766010D12325F5EC18AFEF8E2350935E1A370DE0BF56C6E
SSDEEP6:sK/c6vSb7u7WSMkLNAFn8JZREpiN3vOfPfj4fli2HIuMWw2HIu2:kaSW0kLSV8DRE04MflVHgaHC
TLSHT172E0C204149D9AB6E8878C4C3FADA476673A48B079C210D97C2EC5170A2F916B62B3CC
insert-timestamp1727055042.9064412
mimetypetext/plain
sourcesnap:wBEQd0pf939OMkQxQzjc5edUUJ7UTdoO_33
hashlookup:parent-total28
hashlookup:trust100

Network graph view

Parents (Total: 28)

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

Key Value
SHA-1193D4897A223717A11ACAB916F35D7F7421D95D1
snap-authoritycanonical
snap-filenamewBEQd0pf939OMkQxQzjc5edUUJ7UTdoO_22.snap
snap-idwBEQd0pf939OMkQxQzjc5edUUJ7UTdoO_22
snap-namerapunzel
snap-publisher-idiF39jGin6mL9yavM0mp1QbryMUfExcYE
snap-signkeyBWDEoaqyr25nF5SNCvEv2v7QnM9QsfCc0PBMYD_i2NGSQ32EF2d4D0hqUel3m8ul
snap-timestamp2021-03-04T12:32:37.365593Z
source-urlhttps://api.snapcraft.io/api/v1/snaps/download/wBEQd0pf939OMkQxQzjc5edUUJ7UTdoO_22.snap
Key Value
FileSize36736
MD5D15928AA514881E585ACDD5C62B28AE2
PackageDescriptionextension for computing string similarities and edit distances (Python 3) The Levenshtein module computes Levenshtein distances, similarity ratios, generalized medians and set medians of Unicode or non-Unicode strings. Because it's implemented in C, it's much faster than the corresponding Python library functions and methods. . The Levenshtein distance is the minimum number of single-character insertions, deletions, and substitutions to transform one string into another. . It is useful for spell checking, or fuzzy matching of gettext messages. . This package contains Levenshtein for Python 3.
PackageMaintainerSandro Tosi <morph@debian.org>
PackageNamepython3-levenshtein
PackageSectionpython
PackageVersion0.12.2-1
SHA-1267B46156D37EB81B019E4E0582890655BE640AF
SHA-2563151A1FAA17B08B68512831F820381F9A9941A1878F8ABF0C881809FB75C888B
Key Value
FileSize37180
MD506135EB9473837952629DF2AA25CF99F
PackageDescriptionextension for computing string similarities and edit distances (Python 3) The Levenshtein module computes Levenshtein distances, similarity ratios, generalized medians and set medians of Unicode or non-Unicode strings. Because it's implemented in C, it's much faster than the corresponding Python library functions and methods. . The Levenshtein distance is the minimum number of single-character insertions, deletions, and substitutions to transform one string into another. . It is useful for spell checking, or fuzzy matching of gettext messages. . This package contains Levenshtein for Python 3.
PackageMaintainerSandro Tosi <morph@debian.org>
PackageNamepython3-levenshtein
PackageSectionpython
PackageVersion0.12.2-1
SHA-12956FEB1636D149690EA508E18C6ADCC4F773C10
SHA-2564EF6A72839F3DE7944E23C8258359C9CBBE99D18CEE18D8C8B4FA303AC4444FC
Key Value
FileSize39092
MD584E6C5A8FFA4E92ADA49395E7B771414
PackageDescriptionextension for computing string similarities and edit distances (Python 3) The Levenshtein module computes Levenshtein distances, similarity ratios, generalized medians and set medians of Unicode or non-Unicode strings. Because it's implemented in C, it's much faster than the corresponding Python library functions and methods. . The Levenshtein distance is the minimum number of single-character insertions, deletions, and substitutions to transform one string into another. . It is useful for spell checking, or fuzzy matching of gettext messages. . This package contains Levenshtein for Python 3.
PackageMaintainerSandro Tosi <morph@debian.org>
PackageNamepython3-levenshtein
PackageSectionpython
PackageVersion0.12.2-1
SHA-1356D7968732A42544E91A6FF750BB4CE6330687B
SHA-256853C662EEF6C244AB035BEB4A657C047AD7DC0D81A28C62F48ECB477E2F549B1
Key Value
FileSize36292
MD5E5D5A259082B04BA22D2A581156EF52C
PackageDescriptionextension for computing string similarities and edit distances (Python 3) The Levenshtein module computes Levenshtein distances, similarity ratios, generalized medians and set medians of Unicode or non-Unicode strings. Because it's implemented in C, it's much faster than the corresponding Python library functions and methods. . The Levenshtein distance is the minimum number of single-character insertions, deletions, and substitutions to transform one string into another. . It is useful for spell checking, or fuzzy matching of gettext messages. . This package contains Levenshtein for Python 3.
PackageMaintainerSandro Tosi <morph@debian.org>
PackageNamepython3-levenshtein
PackageSectionpython
PackageVersion0.12.2-2
SHA-138D61261C4D80778C6AF56D5D575801DEDC44A00
SHA-256225A8205D338D082C62A606760015233C23FC99D3EC2BCCE33A60BFF0E46AC11
Key Value
FileSize36764
MD53AF69069A03E31FA81B067EA9ADEE83F
PackageDescriptionextension for computing string similarities and edit distances (Python 3) The Levenshtein module computes Levenshtein distances, similarity ratios, generalized medians and set medians of Unicode or non-Unicode strings. Because it's implemented in C, it's much faster than the corresponding Python library functions and methods. . The Levenshtein distance is the minimum number of single-character insertions, deletions, and substitutions to transform one string into another. . It is useful for spell checking, or fuzzy matching of gettext messages. . This package contains Levenshtein for Python 3.
PackageMaintainerSandro Tosi <morph@debian.org>
PackageNamepython3-levenshtein
PackageSectionpython
PackageVersion0.12.2-2
SHA-1393DAD6EA68DED5965921ACBB0D236831DEFB62C
SHA-25645AFB8A81DB7FC42A3D75A55E42C018936988CA5723DAE34D86565D1D3BBABCA
Key Value
SHA-14130FD6CC5A4AE461BE4C8022E2A0045CDDA2867
snap-authoritycanonical
snap-filenamewBEQd0pf939OMkQxQzjc5edUUJ7UTdoO_27.snap
snap-idwBEQd0pf939OMkQxQzjc5edUUJ7UTdoO_27
snap-namerapunzel
snap-publisher-idiF39jGin6mL9yavM0mp1QbryMUfExcYE
snap-signkeyBWDEoaqyr25nF5SNCvEv2v7QnM9QsfCc0PBMYD_i2NGSQ32EF2d4D0hqUel3m8ul
snap-timestamp2021-03-04T12:32:37.365593Z
source-urlhttps://api.snapcraft.io/api/v1/snaps/download/wBEQd0pf939OMkQxQzjc5edUUJ7UTdoO_27.snap
Key Value
FileSize37232
MD5404AA36468F3FC0F1F0999387202CEF6
PackageDescriptionextension for computing string similarities and edit distances (Python 3) The Levenshtein module computes Levenshtein distances, similarity ratios, generalized medians and set medians of Unicode or non-Unicode strings. Because it's implemented in C, it's much faster than the corresponding Python library functions and methods. . The Levenshtein distance is the minimum number of single-character insertions, deletions, and substitutions to transform one string into another. . It is useful for spell checking, or fuzzy matching of gettext messages. . This package contains Levenshtein for Python 3.
PackageMaintainerSandro Tosi <morph@debian.org>
PackageNamepython3-levenshtein
PackageSectionpython
PackageVersion0.12.2-2
SHA-1462E6E514DC2617D8ADF2DCE4E2F43D0136A6D7F
SHA-256DB31F2B5ADC1D112BA2C709B3661F98BC9B4E4D22FDC3606B98B791E2C17BC54
Key Value
SHA-155F70D15AC5B613F6B900923F0422546E11175D2
snap-authoritycanonical
snap-filenamewBEQd0pf939OMkQxQzjc5edUUJ7UTdoO_33.snap
snap-idwBEQd0pf939OMkQxQzjc5edUUJ7UTdoO_33
snap-namerapunzel
snap-publisher-idiF39jGin6mL9yavM0mp1QbryMUfExcYE
snap-signkeyBWDEoaqyr25nF5SNCvEv2v7QnM9QsfCc0PBMYD_i2NGSQ32EF2d4D0hqUel3m8ul
snap-timestamp2021-03-04T12:32:37.365593Z
source-urlhttps://api.snapcraft.io/api/v1/snaps/download/wBEQd0pf939OMkQxQzjc5edUUJ7UTdoO_33.snap
Key Value
FileSize39104
MD59B43BED6AC351DBDCFC7D44213022FC0
PackageDescriptionextension for computing string similarities and edit distances (Python 3) The Levenshtein module computes Levenshtein distances, similarity ratios, generalized medians and set medians of Unicode or non-Unicode strings. Because it's implemented in C, it's much faster than the corresponding Python library functions and methods. . The Levenshtein distance is the minimum number of single-character insertions, deletions, and substitutions to transform one string into another. . It is useful for spell checking, or fuzzy matching of gettext messages. . This package contains Levenshtein for Python 3.
PackageMaintainerSandro Tosi <morph@debian.org>
PackageNamepython3-levenshtein
PackageSectionpython
PackageVersion0.12.2-2
SHA-15F0D6254F9940E178061779A68E1FB04B553C41D
SHA-256CC7DE6E9506399E901D99F85F8D12B257B739CC9E7A46AE7A15AF3B684C99EAF