Result for BE761D1200E6CEB929D519068AB3E2C1FB230491

Query result

Key Value
FileName./usr/lib/python3.6/site-packages/__pycache__/pytrie.cpython-36.pyc
FileSize14382
MD56BB0B6836D8BB6CCC4B241D4E5DB7CA7
SHA-1BE761D1200E6CEB929D519068AB3E2C1FB230491
SHA-256CE7F8BFB8F7890CEA4177A058F2E6729FCE37EE938296AC83D4101199CB581FB
SSDEEP192:rVTRz+nSPs1tRWqC3wMDApWBz86Kh6LI8bGOmLV:Jt6nSPserApWZ8Rh6LmOmJ
TLSHT19852A46273416F9BFD58F2F58DE502107712E23BFA5D70A2B00C909A3F463484A356AF
hashlookup:parent-total6
hashlookup:trust80

Network graph view

Parents (Total: 6)

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

Key Value
MD50794C0A0023BE927C8CB57EDA8B16492
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.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamepython3-PyTrie
PackageReleaselp152.1.1
PackageVersion0.3.1
SHA-12989FC8590E5E30556E42E9F4B38C0D6090687A9
SHA-256FE219FF9A2761BA77E3B5F67191FC60EF05C60148A5FFE8F5FDEA6B0DF28CB3A
Key Value
MD5F3CA64833FA18FB2CB2D940B238077AD
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.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamepython3-PyTrie
PackageReleasebp153.1.18
PackageVersion0.3.1
SHA-14BEFC4E6C98BE16FBC7A7F6AD97BDE5EE9591672
SHA-256B2ADC7E7A026734E910E7491302BDF6735BCAA3091C10BB63EA7ABCD50333B72
Key Value
MD5E5B327B07C2EF0905A1EE5BB8DFB43FD
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
PackageReleaselp150.4.1
PackageVersion0.3.1
SHA-1837ECCAADE2EBA57E3A77F8CC23AB626AF3001DC
SHA-2563605BAEB5831642A0740367B23536F99379834B0A829A8DA200E65B31189BDE3
Key Value
MD5622071FB0330A70675507864A56C5D16
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.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamepython3-PyTrie
PackageReleasebp155.2.10
PackageVersion0.3.1
SHA-1E488B6EF64BABE4D5CD30AD8FE8E50D0FBD155EB
SHA-256ACDF75F5C55BFFC6CA276110C12667CA547BF2CCB69014961A1A04F51F0FE499
Key Value
MD5299206D181F505C4B49077E8EE6689BE
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.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamepython3-PyTrie
PackageReleasebp154.1.27
PackageVersion0.3.1
SHA-102DF2A7F855E71FAAF4EDF0EC31CF38179ACA136
SHA-2560E73B3203B72FAC28CCE9182FBA6533CB63F44F239896A4FD6C606011C7C5E21
Key Value
MD5B1903D98B142FDBA6101203266BBB973
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.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamepython3-PyTrie
PackageReleasebp156.3.1
PackageVersion0.3.1
SHA-12333F0A36C6E31CCEB72B6E76F5A7354C321F109
SHA-256B0D910D7D47FF54B23FB58D156A1BAC968213976D81BB8EE10D692B674F81128