| Key | Value |
|---|---|
| FileName | ./usr/lib/python2.7/site-packages/pytrie.pyo |
| FileSize | 17050 |
| MD5 | 83A567DC744F32BAEA393DB838DF4BD1 |
| SHA-1 | 6391EAA5C2279D9C5F91C016D7417D66E9CB46DA |
| SHA-256 | 526798292A17B940329EC907EB28303D6B633BE2921C59C73D4D72D904A7C112 |
| SSDEEP | 192:q2Rz+nS6qr818QZJjma+cSQx/I9Qt7ksbq4UbbtYmU7Eix8d8pR0wUe9XadI9A6Y:qg6nSzr8x+czfk27EiUguw4dudif |
| TLSH | T1CE725090F3EA0527E2A26575A6F0010A9A6AF077F2067BD1757C94762F4C3AAC43F3C5 |
| hashlookup:parent-total | 3 |
| hashlookup:trust | 65 |
The searched file hash is included in 3 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| MD5 | F07D383D746A2B4D1A3CDE34EE0C33DE |
| 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 | python2-PyTrie |
| PackageRelease | bp153.1.18 |
| PackageVersion | 0.3.1 |
| SHA-1 | B5E589278E430A2F8F190A4DD6E6209190B90A88 |
| SHA-256 | 49D76ED38D377DFDFEA5D288C2121D39D9D1F718DA754E36FBA64FAA055B299A |
| Key | Value |
|---|---|
| MD5 | 3FC338CB0911231526251CEE9E8328D9 |
| 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 | python2-PyTrie |
| PackageRelease | lp152.1.1 |
| PackageVersion | 0.3.1 |
| SHA-1 | 48EE0E1382D52AF6F68328A1EDEEB7A7AF67D5EE |
| SHA-256 | B465065E40FF6B706DBB78B0ADED1CFCCC6A533CDCFAE16EF4E80527678D48F7 |
| Key | Value |
|---|---|
| MD5 | 06AF638FA810019CBDD7C34F1D08EE20 |
| 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 | python2-PyTrie |
| PackageRelease | lp150.4.1 |
| PackageVersion | 0.3.1 |
| SHA-1 | 96D4A850C9B062A5C869D92ACCB162F68AE1EEDA |
| SHA-256 | 814E61F0EF4860210DA53C558170A7D2257B4C84EDC645952CA0189A66928DD5 |