Result for E6C287E0420B8B41B5D81EB3CBB371F12ED79612

Query result

Key Value
FileName./usr/lib/python3.8/site-packages/__pycache__/pytrie.cpython-38.pyc
FileSize14417
MD59E72709B7599924FFC08E88B74793126
SHA-1E6C287E0420B8B41B5D81EB3CBB371F12ED79612
SHA-256DAE09B6F0117881ABDA28C8C0994D294FB4814FDD1086F6917AFC9D28EC637E2
SSDEEP192:rnRz+nSPd1bKsRhi+pF22TQYhlMOZO64tBuz5XCv2t9loPC:rR6nSPdPFjTQKlRA6gB8XCv2t9aPC
TLSHT1EA52B4E32B45295BF958F0B4DE7E0116B612D233F21E6052B80CD0AF1F4679CBA3469A
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
MD526C0664238B408319A328D051086BA5C
PackageArchnoarch
PackageDescriptionpytrie is a pure Python (2 and 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
PackageRelease4.3
PackageVersion0.3.1
SHA-17E1B723DE9C9F7F9D49FD32445F59F71BF67AAC4
SHA-25670B3CE7487AA01726CC97D4C1835F0F15A70ADFD64C8694FEB06EF2916C8F73F