| Key | Value |
|---|---|
| FileName | ./usr/lib/python3.10/site-packages/__pycache__/pytrie.cpython-310.pyc |
| FileSize | 14121 |
| MD5 | 97EEAD8D77FDF04A52086796A6090F98 |
| SHA-1 | 49EA75951C470CD8E3563E13E3F30740B684E32F |
| SHA-256 | 234DDD3207FEC4B5B94F7C3459D1E7B7B2159B9C7BBC9C03CE223FAC8A5C44FC |
| SSDEEP | 384:Uz6nSxo45nz/4k9ufiy3+E87XvHpadbpYrZTF4U:O6nSeQnz/4k9Xy3+T/pmpYtp4U |
| TLSH | T1335293B762452ADFFD58F0B68DEA02107212D13FFA3EB042B11CC0A91F4675D9A3569E |
| hashlookup:parent-total | 4 |
| hashlookup:trust | 70 |
The searched file hash is included in 4 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| MD5 | C3EAD1BE0A448C05A5F5D036404B2E0A |
| PackageArch | noarch |
| PackageDescription | pytrie 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. |
| PackageName | python310-PyTrie |
| PackageRelease | 15.19 |
| PackageVersion | 0.4.0 |
| SHA-1 | 37901B85118A5DC8A9405411C09B7CD3AA0EF33C |
| SHA-256 | B4AC8DAD10792B377A3E0256C35521DEBDFA75D8C1AABD1B4BD1CFF6B1DD5063 |
| Key | Value |
|---|---|
| MD5 | B53E9D116C4C749F0F1A82EFFECF66F8 |
| PackageArch | noarch |
| PackageDescription | pytrie 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. |
| PackageMaintainer | https://bugs.opensuse.org |
| PackageName | python310-PyTrie |
| PackageRelease | 1.7 |
| PackageVersion | 0.4.0 |
| SHA-1 | CF9AC5B6019C1C3F6232BCB6804E74CF7DCF494B |
| SHA-256 | 16A265BEA3AC33A20143106D89BD490998D8BDFA179E3A362E9C36E6851BDBF6 |
| Key | Value |
|---|---|
| MD5 | 52EFCD37BA42BE8374A6EAF309FBD11F |
| PackageArch | noarch |
| PackageDescription | pytrie 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. |
| PackageName | python310-PyTrie |
| PackageRelease | 15.16 |
| PackageVersion | 0.4.0 |
| SHA-1 | 1BA5BC99CA19D864C25B59D72F0FE799529D1401 |
| SHA-256 | F8C18910E72AB219F0DD67E2F9565853245B929AFFE2AAD823E3E4ED18F5CFBB |
| Key | Value |
|---|---|
| MD5 | EAA98FD4EA86BCFF0E66CE8028EC2831 |
| PackageArch | noarch |
| PackageDescription | pytrie 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. |
| PackageName | python310-PyTrie |
| PackageRelease | 15.30 |
| PackageVersion | 0.4.0 |
| SHA-1 | 0B863BA9ADA1FC53B77A39B88B7750B130EA9DA0 |
| SHA-256 | B0413E138AF1F56783EF68ED7FD8896B34C9400064C90B7B3949E26B40C59340 |