Key | Value |
---|---|
FileName | ./usr/lib/python3.6/site-packages/__pycache__/pytrie.cpython-36.pyc |
FileSize | 14031 |
MD5 | EAC976C6D0BC8BA7275899885619B11B |
SHA-1 | 88CAD09E19AA565CB96AE3B6F40607EC63D8F972 |
SHA-256 | 8327BABFC971A6162D3388470984C12E3CF7A6931059ADC93AC65A31BF9A991F |
SSDEEP | 384:G6nSPaGTX2PfZGwPA6c2j8jnKD/JaXHZhFWvs:G6nSS2X2PfZGGjcrKDxaX57WE |
TLSH | T12952B7A337452EDFFD69F1B55DE902102316E13FF65E7052B50C80AA2F427489E346AE |
hashlookup:parent-total | 22 |
hashlookup:trust | 100 |
The searched file hash is included in 22 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
MD5 | 6318EC279A0B6740F26F87E8DF4A5478 |
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://www.suse.com/ |
PackageName | python3-PyTrie |
PackageRelease | lp154.15.1 |
PackageVersion | 0.4.0 |
SHA-1 | 11BD49C35B2F65B5D21B2A67A9687B9E5748408B |
SHA-256 | 6B45CC2FFEC11E969B39052882A0E0B7280BEC70AB0080F53FC39A50603F81F0 |
Key | Value |
---|---|
MD5 | B30DF6AA78D2E1EE1145FD1C52937F6A |
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 | python3-PyTrie |
PackageRelease | lp153.2.12 |
PackageVersion | 0.4.0 |
SHA-1 | 2859BADFFA464FC5981A293F43BFFD8E0892AF45 |
SHA-256 | 456163B62CAC5D2DC963FA1B244766EBEE049E984E3DA8F956DE3BB3C5313445 |
Key | Value |
---|---|
MD5 | 6EE3ECE7A2DAF16FD27C14E403A30288 |
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 | python36-PyTrie |
PackageRelease | 1.3 |
PackageVersion | 0.4.0 |
SHA-1 | 286BBDD0C91EB75DD56BFD96F25BD7F251B0793C |
SHA-256 | 61118B4D63F99A3AEFB9F2B635FF8CB50FA3710664BD4B20FD0B60CEFF29F8F4 |
Key | Value |
---|---|
MD5 | CBF9B12AEE69E240C9B844AF3B96F764 |
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 | python3-PyTrie |
PackageRelease | lp153.15.15 |
PackageVersion | 0.4.0 |
SHA-1 | 2AA395CE384C7B88536A372D6339C1A856FA150A |
SHA-256 | 50BD41CE269B4F0A2B2C2B5D7975AC4E9785D38484721E964143CB2F85D4D92D |
Key | Value |
---|---|
MD5 | 6DB287133C21254E61F1B3983A33DAFE |
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 | python36-PyTrie |
PackageRelease | 15.13 |
PackageVersion | 0.4.0 |
SHA-1 | 2ABBA47675682B10F2CEB22746DE4C8DF93436D8 |
SHA-256 | F9EE693C16FFE25450C8328EA033AEEBAEDFFDD77C72DB2E57B6A05DDD2EDABA |
Key | Value |
---|---|
MD5 | 37B1F6E3BB72B5D37858718EE827F708 |
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 | python3-PyTrie |
PackageRelease | lp152.2.2 |
PackageVersion | 0.4.0 |
SHA-1 | 2C575392E94C6DC14C208527413C988EA0BDAB93 |
SHA-256 | EE656F7BCF74DF1378515C77FC881B6AD9D588808D0CF08DD505B4E6AF7DD167 |
Key | Value |
---|---|
MD5 | 323F88C1B33DA1B856E3E4C5E3F7D210 |
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 | python3-PyTrie |
PackageRelease | lp154.2.1 |
PackageVersion | 0.4.0 |
SHA-1 | 2FC460B557EB257614CA684B0B0CE6C3256D5839 |
SHA-256 | 5B2479E18A9F373F66BB75AF6221375943036F17893419BC51FA8DD914BC17B6 |
Key | Value |
---|---|
MD5 | 6EC4868894C0984F1A68202245AE85B3 |
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 | python3-PyTrie |
PackageRelease | 2.3 |
PackageVersion | 0.4.0 |
SHA-1 | 3F830BF5C1DBB3AA1730C567C3A75789CCAFDF20 |
SHA-256 | B6AB5E74083F5B29B64F6682CDE1CCC36DF2FD5365C7F8A67BCED8D99D95CEF2 |
Key | Value |
---|---|
MD5 | 91CDA82E17119C7F0D4CE0500EC18C92 |
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 | python3-PyTrie |
PackageRelease | 15.4 |
PackageVersion | 0.4.0 |
SHA-1 | 43D13CA4FFD07752CA9D90902ADCB7607860E68B |
SHA-256 | BD9B110797098B0974D2F0C99EDF2D10E6000DFC0D0DABC7F81F4BD5075A71B5 |
Key | Value |
---|---|
MD5 | F0B486894EB64666E75022533FC6460B |
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 | python3-PyTrie |
PackageRelease | lp151.2.1 |
PackageVersion | 0.4.0 |
SHA-1 | 57651022ECEEEB98E0451091E814D6A1C86CD411 |
SHA-256 | AC2475E4ED54F3F2E5D53CB330EE1E49A3BD621D53EAA9C32D5CCEF07C001612 |