Result for ECDF72BD5262F440452C14837B86ED289F2B9C62

Search result
Graph view
Parent (58)

Query result

Key Value
FileName./usr/share/licenses/python3-PyTrie/LICENSE
FileSize1450
MD51FF76394D9FBE7F388BD2C8EC8D35913
SHA-1ECDF72BD5262F440452C14837B86ED289F2B9C62
SHA-25697F85C2BA0D856CF5F7E5DB587AF7299233DB2E502980EB655ACE28343541D50
SHA-5122D84411C835D365E5F17228147CD2EE9EE2FB0F03535FF7944A967370EC04B89BD4D4C40C1737AC3B5A4FB33FD63382DDE6DD7D57DD643838B18F7C02AB8B337
SSDEEP24:NUnezoV+bOOrYFTI+JYrYFTzLg5KBTPJ94Os43sEskuTkWROt32sByxtdfy33tZq:jOOrYJErYJzc5uPz4943JZ32sBEtI336
TLSHT17D31745712844FA759E317417266AAC4B08DD03D3F23AE012C6EF2986B7B12EC4BB441
insert-timestamp1728969965.3972287
mimetypetext/plain
sourcesnap:CQABYoGge9Vs2HVu3GqpPrH1NloZyML2_1371
tar:gnameroot
tar:unameroot
hashlookup:parent-total58
hashlookup:trust100

Network graph view

Parents (Total: 58)

The searched file hash is included in 58 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
MD5B977AA1CC7F473B2E1FCC44870C028C9
PackageArchnoarch
PackageDescriptionpytrie 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.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamepython39-PyTrie
PackageRelease1.7
PackageVersion0.4.0
SHA-101EA910A3B3AE387324805492B960D84A18EF651
SHA-256E9AF35DE0BCC3C2FF243931532FB6A000EED1D55D82692297331887055F24190
Key Value
MD5299206D181F505C4B49077E8EE6689BE
PackageArchnoarch
PackageDescriptionpytrie 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.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamepython3-PyTrie
PackageReleasebp154.1.27
PackageVersion0.3.1
SHA-102DF2A7F855E71FAAF4EDF0EC31CF38179ACA136
SHA-2560E73B3203B72FAC28CCE9182FBA6533CB63F44F239896A4FD6C606011C7C5E21
Key Value
MD5EAA98FD4EA86BCFF0E66CE8028EC2831
PackageArchnoarch
PackageDescriptionpytrie 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.
PackageNamepython310-PyTrie
PackageRelease15.30
PackageVersion0.4.0
SHA-10B863BA9ADA1FC53B77A39B88B7750B130EA9DA0
SHA-256B0413E138AF1F56783EF68ED7FD8896B34C9400064C90B7B3949E26B40C59340
Key Value
MD56318EC279A0B6740F26F87E8DF4A5478
PackageArchnoarch
PackageDescriptionpytrie 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.
PackageMaintainerhttps://www.suse.com/
PackageNamepython3-PyTrie
PackageReleaselp154.15.1
PackageVersion0.4.0
SHA-111BD49C35B2F65B5D21B2A67A9687B9E5748408B
SHA-2566B45CC2FFEC11E969B39052882A0E0B7280BEC70AB0080F53FC39A50603F81F0
Key Value
SHA-1135E6F26E3B94B411DAEDA8B67CE5DA7D37D04ED
snap-authoritycanonical
snap-filenamePDs0gdNmphoAllZ4d3qAuDmaKrEHyrWf_2.snap
snap-idPDs0gdNmphoAllZ4d3qAuDmaKrEHyrWf_2
snap-namecrossbarfx-pypy
snap-publisher-idWtpsanth6CVx0Hz9w8H6T9GOFChVky8l
snap-signkeyBWDEoaqyr25nF5SNCvEv2v7QnM9QsfCc0PBMYD_i2NGSQ32EF2d4D0hqUel3m8ul
snap-timestamp2021-03-03T23:30:12.325107Z
source-urlhttps://api.snapcraft.io/api/v1/snaps/download/PDs0gdNmphoAllZ4d3qAuDmaKrEHyrWf_2.snap
Key Value
MD552EFCD37BA42BE8374A6EAF309FBD11F
PackageArchnoarch
PackageDescriptionpytrie 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.
PackageNamepython310-PyTrie
PackageRelease15.16
PackageVersion0.4.0
SHA-11BA5BC99CA19D864C25B59D72F0FE799529D1401
SHA-256F8C18910E72AB219F0DD67E2F9565853245B929AFFE2AAD823E3E4ED18F5CFBB
Key Value
MD5AE52542CB2A566A6F36F2F75A7BA4546
PackageArchnoarch
PackageDescriptionpytrie 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.
PackageNamepython38-PyTrie
PackageRelease15.16
PackageVersion0.4.0
SHA-11EC387B62CD6BF9AABEEBD5BE204507653D36857
SHA-256630ED5B1F0D4E82C30FFE5AA6D0A6FD63FEDC73798E3A3EE1FD4B3784205CBAB
Key Value
MD5B1903D98B142FDBA6101203266BBB973
PackageArchnoarch
PackageDescriptionpytrie 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.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamepython3-PyTrie
PackageReleasebp156.3.1
PackageVersion0.3.1
SHA-12333F0A36C6E31CCEB72B6E76F5A7354C321F109
SHA-256B0D910D7D47FF54B23FB58D156A1BAC968213976D81BB8EE10D692B674F81128
Key Value
FileNamehttp://archlinux.mirror.root.lu//pool//community//python-pytrie-0.4.0-3-any.pkg.tar.zst
MD5C9BB166DE7354A2B110E19CB902AF3D6
SHA-1264E635B6B717CC284583EBD5AE5A6DCBA674F00
SHA-256CE95B036E02B4D58052CB3762E2E5EBA6D49221A8CC05BAAAD9A930D90A9AF1B
SSDEEP192:6C70hfAmsbgz9T4Pxs07Tbz5XYzTf/VTbUWnd2OfM8jG8kv+HqSxPrlpxBsa6+fz:EhfPsb8Z4PxsYnzdYzR8Ad2B8igHdxP1
TLSHT16B42D0FC2FD06161E4CCB6A0B579F3499A8773ED81FBA07158C4A54116CC2F01D9E6E5
Key Value
MD5B30DF6AA78D2E1EE1145FD1C52937F6A
PackageArchnoarch
PackageDescriptionpytrie 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.
PackageNamepython3-PyTrie
PackageReleaselp153.2.12
PackageVersion0.4.0
SHA-12859BADFFA464FC5981A293F43BFFD8E0892AF45
SHA-256456163B62CAC5D2DC963FA1B244766EBEE049E984E3DA8F956DE3BB3C5313445





metalookup is a service from miwakeru.com