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	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

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	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	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
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	C0B2BF142F188728CA096854AEA5B8E9
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.5
PackageVersion	0.4.0
SHA-1	CAB5E7C7B825D5F37AF05A5929DD25ED746E0B24
SHA-256	522DB8EBF9BEE5488E4B349478A0F8B682C16590A0D7536C9EF37B51889C42AA

Key	Value
MD5	C8ABE4193CF6F85B8F1821B27FB02F33
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.15.2
PackageVersion	0.4.0
SHA-1	614F1B44FF2F7CE0551329087C3007BF4A26E291
SHA-256	744423DA075E2BF645CC28F88CF35258E2867C1B0F86FC933C89959ED54820DC