Parents (Total: 8)

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

Key	Value
MD5	2F085F7F6CB5320E06A632D1662912A4
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	python39-PyTrie
PackageRelease	15.19
PackageVersion	0.4.0
SHA-1	619C740DC2BE947A9FA2F92EB9DDF3359BFD6C9D
SHA-256	9EA6ECF030A9FEBB052EF39F082E7A9231793DC76B85D3A5A2D4294D0C5E4AE4

Key	Value
MD5	030E1A52458377A658B41AB728C99443
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	python39-PyTrie
PackageRelease	15.14
PackageVersion	0.4.0
SHA-1	4D94C69F6672DE6444F60731B98FDE52C97D0CB9
SHA-256	A4B2E3F500383465471A8CD99FDE40FD25C59770FB964C1D39B58DEBA289AEE9

Key	Value
MD5	A24BA770DF80EFD0885A6A4CE516C11C
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	python39-PyTrie
PackageRelease	15.30
PackageVersion	0.4.0
SHA-1	F1DF877BB93E0A6DFE23673DEF834131D5656200
SHA-256	A4588CE5190C0B4349DFB9534CCFC9C44AC04C88526A444B7E9542E292C001ED

Key	Value
MD5	25A03B31801A663C169C394E4482C609
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	python39-PyTrie
PackageRelease	1.3
PackageVersion	0.4.0
SHA-1	33F9E1A73106A9B790117EE74E9289854B019015
SHA-256	C5AFE775DB89842939FBA3FBCF2D5D51E7A3AB130FA6E1801902CBF58AE987CA

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
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	C6354B33C0FF3B8738ED59FF9E837FFC
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	python39-PyTrie
PackageRelease	15.13
PackageVersion	0.4.0
SHA-1	5D9DF126C2B26E24A0E18C69EBA7E65B76F06F9F
SHA-256	EE267BFE9DB3D9CD92006C4F1DD80A0CCA30B33EFA7F6004116248D634757A38

Key	Value
MD5	7EA8DECF9F95EA768F4C88A12F90113A
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	python39-PyTrie
PackageRelease	15.16
PackageVersion	0.4.0
SHA-1	70AA09BED250E0A1D334852D4A2BD8C7E9263FA0
SHA-256	066E78251E74FC48F606ADC92838B0BF15E863406B434D22FFA7B2B4FEB762B4