Key | Value |
---|---|
FileName | ./usr/lib/python3.6/site-packages/PyTrie-0.3.1-py3.6.egg-info/PKG-INFO |
FileSize | 1884 |
MD5 | A9E7EE627832B7629FAF2C6C1B40D759 |
SHA-1 | C948F9D236F3E4A98E23DE0070F993E37F6D8E03 |
SHA-256 | 153931D44112319A1E1653752C881FB7EF092F636DB31F4C36B252666E95EFBD |
SHA-512 | 1BC55C84B0E3A838550C1B4EC17DF62174D77644A5B94C6B92F38962A987F0F31AA6F6A14B1E3FADEFFB3D224175CE6F93AE64DCFA43D6F11CB4AC2D6776DB1A |
SSDEEP | 48:DF6UKR4V8cjAmLXKLQQ+eXBO1hqaQI/jP13g:DF6UKaV5LLFexmEaQI/jP13g |
TLSH | T16041765631D038B95A63089396485045C65210BBA7EE2CCC78BD803D2F02FB6973D279 |
insert-timestamp | 1727062123.561265 |
mimetype | text/plain |
source | snap:z7Fj3dqELnjuRnk1B2ttX9VZq97Y2leR_46 |
hashlookup:parent-total | 11 |
hashlookup:trust | 100 |
The searched file hash is included in 11 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 |
---|---|
SHA-1 | 1EF1B8615C09C26175CA120AC3EE82AF362B7BB0 |
snap-authority | canonical |
snap-filename | z7Fj3dqELnjuRnk1B2ttX9VZq97Y2leR_46.snap |
snap-id | z7Fj3dqELnjuRnk1B2ttX9VZq97Y2leR_46 |
snap-name | crossbar-pypy |
snap-publisher-id | 1DBv20aOLyTs5mrv6snw3qqXYjEGt9JC |
snap-signkey | BWDEoaqyr25nF5SNCvEv2v7QnM9QsfCc0PBMYD_i2NGSQ32EF2d4D0hqUel3m8ul |
snap-timestamp | 2021-02-16T21:10:23.484945Z |
source-url | https://api.snapcraft.io/api/v1/snaps/download/z7Fj3dqELnjuRnk1B2ttX9VZq97Y2leR_46.snap |
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 | 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 |
Key | Value |
---|---|
MD5 | 26C0664238B408319A328D051086BA5C |
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 | 4.3 |
PackageVersion | 0.3.1 |
SHA-1 | 7E1B723DE9C9F7F9D49FD32445F59F71BF67AAC4 |
SHA-256 | 70B3CE7487AA01726CC97D4C1835F0F15A70ADFD64C8694FEB06EF2916C8F73F |
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 | 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 | 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 |