Key | Value |
---|---|
FileName | ./usr/lib/python3.6/site-packages/__pycache__/pytrie.cpython-36.pyc |
FileSize | 14382 |
MD5 | 6BB0B6836D8BB6CCC4B241D4E5DB7CA7 |
SHA-1 | BE761D1200E6CEB929D519068AB3E2C1FB230491 |
SHA-256 | CE7F8BFB8F7890CEA4177A058F2E6729FCE37EE938296AC83D4101199CB581FB |
SSDEEP | 192:rVTRz+nSPs1tRWqC3wMDApWBz86Kh6LI8bGOmLV:Jt6nSPserApWZ8Rh6LmOmJ |
TLSH | T19852A46273416F9BFD58F2F58DE502107712E23BFA5D70A2B00C909A3F463484A356AF |
hashlookup:parent-total | 6 |
hashlookup:trust | 80 |
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 |
---|---|
MD5 | 0794C0A0023BE927C8CB57EDA8B16492 |
PackageArch | noarch |
PackageDescription | pytrie 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. |
PackageMaintainer | https://bugs.opensuse.org |
PackageName | python3-PyTrie |
PackageRelease | lp152.1.1 |
PackageVersion | 0.3.1 |
SHA-1 | 2989FC8590E5E30556E42E9F4B38C0D6090687A9 |
SHA-256 | FE219FF9A2761BA77E3B5F67191FC60EF05C60148A5FFE8F5FDEA6B0DF28CB3A |
Key | Value |
---|---|
MD5 | F3CA64833FA18FB2CB2D940B238077AD |
PackageArch | noarch |
PackageDescription | pytrie 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. |
PackageMaintainer | https://bugs.opensuse.org |
PackageName | python3-PyTrie |
PackageRelease | bp153.1.18 |
PackageVersion | 0.3.1 |
SHA-1 | 4BEFC4E6C98BE16FBC7A7F6AD97BDE5EE9591672 |
SHA-256 | B2ADC7E7A026734E910E7491302BDF6735BCAA3091C10BB63EA7ABCD50333B72 |
Key | Value |
---|---|
MD5 | E5B327B07C2EF0905A1EE5BB8DFB43FD |
PackageArch | noarch |
PackageDescription | pytrie 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. |
PackageName | python3-PyTrie |
PackageRelease | lp150.4.1 |
PackageVersion | 0.3.1 |
SHA-1 | 837ECCAADE2EBA57E3A77F8CC23AB626AF3001DC |
SHA-256 | 3605BAEB5831642A0740367B23536F99379834B0A829A8DA200E65B31189BDE3 |
Key | Value |
---|---|
MD5 | 622071FB0330A70675507864A56C5D16 |
PackageArch | noarch |
PackageDescription | pytrie 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. |
PackageMaintainer | https://bugs.opensuse.org |
PackageName | python3-PyTrie |
PackageRelease | bp155.2.10 |
PackageVersion | 0.3.1 |
SHA-1 | E488B6EF64BABE4D5CD30AD8FE8E50D0FBD155EB |
SHA-256 | ACDF75F5C55BFFC6CA276110C12667CA547BF2CCB69014961A1A04F51F0FE499 |
Key | Value |
---|---|
MD5 | 299206D181F505C4B49077E8EE6689BE |
PackageArch | noarch |
PackageDescription | pytrie 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. |
PackageMaintainer | https://bugs.opensuse.org |
PackageName | python3-PyTrie |
PackageRelease | bp154.1.27 |
PackageVersion | 0.3.1 |
SHA-1 | 02DF2A7F855E71FAAF4EDF0EC31CF38179ACA136 |
SHA-256 | 0E73B3203B72FAC28CCE9182FBA6533CB63F44F239896A4FD6C606011C7C5E21 |
Key | Value |
---|---|
MD5 | B1903D98B142FDBA6101203266BBB973 |
PackageArch | noarch |
PackageDescription | pytrie 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. |
PackageMaintainer | https://bugs.opensuse.org |
PackageName | python3-PyTrie |
PackageRelease | bp156.3.1 |
PackageVersion | 0.3.1 |
SHA-1 | 2333F0A36C6E31CCEB72B6E76F5A7354C321F109 |
SHA-256 | B0D910D7D47FF54B23FB58D156A1BAC968213976D81BB8EE10D692B674F81128 |