Key | Value |
---|---|
FileName | ./usr/lib/python3.6/site-packages/PyTrie-0.4.0-py3.6.egg-info/SOURCES.txt |
FileSize | 1005 |
MD5 | B3FD9DEEB5AE837DB5E4406525A72E6A |
SHA-1 | 50A9E1B92E623474B2AF55945B0D430369E6E743 |
SHA-256 | 773433CB62E0AECBADA3F48BFFDD11A5ABF991602FC968230BFB0575DFD63B62 |
SSDEEP | 12:70Q1a1JomN8ne0Y63JNLzL7NLYgTd9mZ3hkO5JLRb08nJqmWiVelsPkVh:70Q1a7JN8neFoJN3dJr8ZXHWiVelssVh |
TLSH | T1F0116D6091AC937315A5ECD882FE1729EDBFE432B696D046928C026047D66CD037FF2B |
tar:gname | root |
tar:uname | root |
hashlookup:parent-total | 41 |
hashlookup:trust | 100 |
The searched file hash is included in 41 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
MD5 | B977AA1CC7F473B2E1FCC44870C028C9 |
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 | python39-PyTrie |
PackageRelease | 1.7 |
PackageVersion | 0.4.0 |
SHA-1 | 01EA910A3B3AE387324805492B960D84A18EF651 |
SHA-256 | E9AF35DE0BCC3C2FF243931532FB6A000EED1D55D82692297331887055F24190 |
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 |
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 | 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 | AE52542CB2A566A6F36F2F75A7BA4546 |
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 | python38-PyTrie |
PackageRelease | 15.16 |
PackageVersion | 0.4.0 |
SHA-1 | 1EC387B62CD6BF9AABEEBD5BE204507653D36857 |
SHA-256 | 630ED5B1F0D4E82C30FFE5AA6D0A6FD63FEDC73798E3A3EE1FD4B3784205CBAB |
Key | Value |
---|---|
FileName | http://archlinux.mirror.root.lu//pool//community//python-pytrie-0.4.0-3-any.pkg.tar.zst |
MD5 | C9BB166DE7354A2B110E19CB902AF3D6 |
SHA-1 | 264E635B6B717CC284583EBD5AE5A6DCBA674F00 |
SHA-256 | CE95B036E02B4D58052CB3762E2E5EBA6D49221A8CC05BAAAD9A930D90A9AF1B |
SSDEEP | 192:6C70hfAmsbgz9T4Pxs07Tbz5XYzTf/VTbUWnd2OfM8jG8kv+HqSxPrlpxBsa6+fz:EhfPsb8Z4PxsYnzdYzR8Ad2B8igHdxP1 |
TLSH | T16B42D0FC2FD06161E4CCB6A0B579F3499A8773ED81FBA07158C4A54116CC2F01D9E6E5 |
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 |