Result for 50A9E1B92E623474B2AF55945B0D430369E6E743

Query result

Key Value
FileName./usr/lib/python3.6/site-packages/PyTrie-0.4.0-py3.6.egg-info/SOURCES.txt
FileSize1005
MD5B3FD9DEEB5AE837DB5E4406525A72E6A
SHA-150A9E1B92E623474B2AF55945B0D430369E6E743
SHA-256773433CB62E0AECBADA3F48BFFDD11A5ABF991602FC968230BFB0575DFD63B62
SSDEEP12:70Q1a1JomN8ne0Y63JNLzL7NLYgTd9mZ3hkO5JLRb08nJqmWiVelsPkVh:70Q1a7JN8neFoJN3dJr8ZXHWiVelssVh
TLSHT1F0116D6091AC937315A5ECD882FE1729EDBFE432B696D046928C026047D66CD037FF2B
tar:gnameroot
tar:unameroot
hashlookup:parent-total41
hashlookup:trust100

Network graph view

Parents (Total: 41)

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

Key Value
MD5B977AA1CC7F473B2E1FCC44870C028C9
PackageArchnoarch
PackageDescriptionpytrie is a pure Python 3 implementation of the trie data structure. A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamepython39-PyTrie
PackageRelease1.7
PackageVersion0.4.0
SHA-101EA910A3B3AE387324805492B960D84A18EF651
SHA-256E9AF35DE0BCC3C2FF243931532FB6A000EED1D55D82692297331887055F24190
Key Value
MD5EAA98FD4EA86BCFF0E66CE8028EC2831
PackageArchnoarch
PackageDescriptionpytrie is a pure Python 3 implementation of the trie data structure. A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
PackageNamepython310-PyTrie
PackageRelease15.30
PackageVersion0.4.0
SHA-10B863BA9ADA1FC53B77A39B88B7750B130EA9DA0
SHA-256B0413E138AF1F56783EF68ED7FD8896B34C9400064C90B7B3949E26B40C59340
Key Value
MD56318EC279A0B6740F26F87E8DF4A5478
PackageArchnoarch
PackageDescriptionpytrie is a pure Python 3 implementation of the trie data structure. A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
PackageMaintainerhttps://www.suse.com/
PackageNamepython3-PyTrie
PackageReleaselp154.15.1
PackageVersion0.4.0
SHA-111BD49C35B2F65B5D21B2A67A9687B9E5748408B
SHA-2566B45CC2FFEC11E969B39052882A0E0B7280BEC70AB0080F53FC39A50603F81F0
Key Value
MD552EFCD37BA42BE8374A6EAF309FBD11F
PackageArchnoarch
PackageDescriptionpytrie is a pure Python 3 implementation of the trie data structure. A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
PackageNamepython310-PyTrie
PackageRelease15.16
PackageVersion0.4.0
SHA-11BA5BC99CA19D864C25B59D72F0FE799529D1401
SHA-256F8C18910E72AB219F0DD67E2F9565853245B929AFFE2AAD823E3E4ED18F5CFBB
Key Value
MD5AE52542CB2A566A6F36F2F75A7BA4546
PackageArchnoarch
PackageDescriptionpytrie is a pure Python 3 implementation of the trie data structure. A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
PackageNamepython38-PyTrie
PackageRelease15.16
PackageVersion0.4.0
SHA-11EC387B62CD6BF9AABEEBD5BE204507653D36857
SHA-256630ED5B1F0D4E82C30FFE5AA6D0A6FD63FEDC73798E3A3EE1FD4B3784205CBAB
Key Value
FileNamehttp://archlinux.mirror.root.lu//pool//community//python-pytrie-0.4.0-3-any.pkg.tar.zst
MD5C9BB166DE7354A2B110E19CB902AF3D6
SHA-1264E635B6B717CC284583EBD5AE5A6DCBA674F00
SHA-256CE95B036E02B4D58052CB3762E2E5EBA6D49221A8CC05BAAAD9A930D90A9AF1B
SSDEEP192:6C70hfAmsbgz9T4Pxs07Tbz5XYzTf/VTbUWnd2OfM8jG8kv+HqSxPrlpxBsa6+fz:EhfPsb8Z4PxsYnzdYzR8Ad2B8igHdxP1
TLSHT16B42D0FC2FD06161E4CCB6A0B579F3499A8773ED81FBA07158C4A54116CC2F01D9E6E5
Key Value
MD5B30DF6AA78D2E1EE1145FD1C52937F6A
PackageArchnoarch
PackageDescriptionpytrie is a pure Python 3 implementation of the trie data structure. A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
PackageNamepython3-PyTrie
PackageReleaselp153.2.12
PackageVersion0.4.0
SHA-12859BADFFA464FC5981A293F43BFFD8E0892AF45
SHA-256456163B62CAC5D2DC963FA1B244766EBEE049E984E3DA8F956DE3BB3C5313445
Key Value
MD56EE3ECE7A2DAF16FD27C14E403A30288
PackageArchnoarch
PackageDescriptionpytrie is a pure Python 3 implementation of the trie data structure. A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
PackageNamepython36-PyTrie
PackageRelease1.3
PackageVersion0.4.0
SHA-1286BBDD0C91EB75DD56BFD96F25BD7F251B0793C
SHA-25661118B4D63F99A3AEFB9F2B635FF8CB50FA3710664BD4B20FD0B60CEFF29F8F4
Key Value
MD5CBF9B12AEE69E240C9B844AF3B96F764
PackageArchnoarch
PackageDescriptionpytrie is a pure Python 3 implementation of the trie data structure. A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
PackageNamepython3-PyTrie
PackageReleaselp153.15.15
PackageVersion0.4.0
SHA-12AA395CE384C7B88536A372D6339C1A856FA150A
SHA-25650BD41CE269B4F0A2B2C2B5D7975AC4E9785D38484721E964143CB2F85D4D92D
Key Value
MD56DB287133C21254E61F1B3983A33DAFE
PackageArchnoarch
PackageDescriptionpytrie is a pure Python 3 implementation of the trie data structure. A trie is an ordered tree data structure that is used to store a mapping where the keys are sequences, usually strings over an alphabet. In addition to implementing the mapping interface, tries allow finding the items for a given prefix, and vice versa, finding the items whose keys are prefixes of a given key.
PackageNamepython36-PyTrie
PackageRelease15.13
PackageVersion0.4.0
SHA-12ABBA47675682B10F2CEB22746DE4C8DF93436D8
SHA-256F9EE693C16FFE25450C8328EA033AEEBAEDFFDD77C72DB2E57B6A05DDD2EDABA