Parents (Total: 7)

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

Key	Value
MD5	A3A33C3350AC6F69253DB78AD56650E5
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.30
PackageVersion	0.4.0
SHA-1	ADAF285DCCD0172013E5CAB67348D39F989A7938
SHA-256	E886640A9A81039B60FCEF3AEDAF7922E7384E05A3747FFAA04C1D207DBD2C6C

Key	Value
MD5	0FC14C05006C87F11C5FEAEA0DC7D8C0
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	python38-PyTrie
PackageRelease	1.7
PackageVersion	0.4.0
SHA-1	CD1C9E5B54714C7E53C73F1312FB919CB0169D2B
SHA-256	554FF38E0555D17FA8C26F38A1892D1F619FB2FEB95EF00C6DACB4D97BFAE310

Key	Value
MD5	EDEC156713E38D7DE4F4833B60C1AACE
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.13
PackageVersion	0.4.0
SHA-1	E97134A4F53C6C59A6ED5BCA1EB8A40631E462FF
SHA-256	8FABF2C7489221DAB01430549DEC76FB7D59CB1B9CE28D630FAF116EDF2FD56B

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
MD5	27FBF9CA877250618E69F7091112514E
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	1.3
PackageVersion	0.4.0
SHA-1	8A7CA4FDDEA182EC55DF5F4FA234B6FBAEA53F9A
SHA-256	7EB71705BE333D570D453CAE8486ECBB256F80B9F10682788413C8C465807DF0

Key	Value
MD5	F4512886015364BCF626D7686FB13DD7
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.14
PackageVersion	0.4.0
SHA-1	8F9143133D8F174B7933C243A0B085FAE3168E77
SHA-256	AF7B1C322A33A209CC90BDA539E9850DD48E3DB8E63ECF22CEA91B77C4D9C747

Key	Value
MD5	9E92080FA1D2338E68B8619D6086A540
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.19
PackageVersion	0.4.0
SHA-1	C4A2AC4BEA485C70627AE15A1156C3E58BF9990F
SHA-256	E6FE78D5ACD4F0327A36C47C236B43FF9ECB96FA85F34A82BF91C16B50BD698E