Parents (Total: 5)

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

Key	Value
FileSize	25276
MD5	839016EF237A3DF8F84439465B8D6960
PackageDescription	C++ implementation of a fast hash map and hash set The robin-map library is a C++ implementation of a fast hash map and hash set using open-addressing and linear robin hood hashing with backward shift deletion to resolve collisions. . Four classes are provided: tsl::robin_map, tsl::robin_set, tsl::robin_pg_map and tsl::robin_pg_set. The first two are faster and use a power of two growth policy, the last two use a prime growth policy instead and are able to cope better with a poor hash function. Use the prime version if there is a chance of repeating patterns in the lower bits of your hash (e.g. you are storing pointers with an identity hash function).
PackageMaintainer	Matteo F. Vescovi <mfv@debian.org>
PackageName	robin-map-dev
PackageSection	libdevel
PackageVersion	0.6.3-1
SHA-1	3B78C08CD65B552369193646B4188EAE607AF5B3
SHA-256	6D7D10A25CBF8941404102407C8D714AECC35F2D0AA92BFD2AAFA7B312593C93

Key	Value
FileSize	25316
MD5	52505A93EB2C0BAE761949BE91AC2A43
PackageDescription	C++ implementation of a fast hash map and hash set The robin-map library is a C++ implementation of a fast hash map and hash set using open-addressing and linear robin hood hashing with backward shift deletion to resolve collisions. . Four classes are provided: tsl::robin_map, tsl::robin_set, tsl::robin_pg_map and tsl::robin_pg_set. The first two are faster and use a power of two growth policy, the last two use a prime growth policy instead and are able to cope better with a poor hash function. Use the prime version if there is a chance of repeating patterns in the lower bits of your hash (e.g. you are storing pointers with an identity hash function).
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	robin-map-dev
PackageSection	libdevel
PackageVersion	0.6.3-1
SHA-1	F4EA795130B26D35F957EB0890A9CDBA2E488FE5
SHA-256	98523E62FD66BD48586DF306A5CF5D5E7DA01B2ED1ABEC45E1AEAF938B54503C

Key	Value
FileSize	22860
MD5	1380EBEA183C1B45D1892086815BEC18
PackageDescription	C++ implementation of a fast hash map and hash set The robin-map library is a C++ implementation of a fast hash map and hash set using open-addressing and linear robin hood hashing with backward shift deletion to resolve collisions. . Four classes are provided: tsl::robin_map, tsl::robin_set, tsl::robin_pg_map and tsl::robin_pg_set. The first two are faster and use a power of two growth policy, the last two use a prime growth policy instead and are able to cope better with a poor hash function. Use the prime version if there is a chance of repeating patterns in the lower bits of your hash (e.g. you are storing pointers with an identity hash function).
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	robin-map-dev
PackageSection	libdevel
PackageVersion	0.6.2-1
SHA-1	E01B61A5481D802EA267A6F06206FE87A2CE98C4
SHA-256	DF2BA3E86F7577605CFDFEAAEE2DEA4087D91C39FA011F49F2568FEA4B7214E1

Key	Value
FileSize	21272
MD5	44AA9B36C71BF4D3BD7A8B2DBE10EFD4
PackageDescription	C++ implementation of a fast hash map and hash set The robin-map library is a C++ implementation of a fast hash map and hash set using open-addressing and linear robin hood hashing with backward shift deletion to resolve collisions. . Four classes are provided: tsl::robin_map, tsl::robin_set, tsl::robin_pg_map and tsl::robin_pg_set. The first two are faster and use a power of two growth policy, the last two use a prime growth policy instead and are able to cope better with a poor hash function. Use the prime version if there is a chance of repeating patterns in the lower bits of your hash (e.g. you are storing pointers with an identity hash function).
PackageMaintainer	Matteo F. Vescovi <mfv@debian.org>
PackageName	robin-map-dev
PackageSection	libdevel
PackageVersion	0.5.0-1
SHA-1	86D949372AFA2B6E9E78C04C7A7E861A0F69562D
SHA-256	2367009FE1C0249CB2E96BDC21C9A36FFDF841F9EB86B0C48638D944416E5A93

Key	Value
FileSize	25288
MD5	4D10EA9BDEF3D72DD1B1C7656FC21FB7
PackageDescription	C++ implementation of a fast hash map and hash set The robin-map library is a C++ implementation of a fast hash map and hash set using open-addressing and linear robin hood hashing with backward shift deletion to resolve collisions. . Four classes are provided: tsl::robin_map, tsl::robin_set, tsl::robin_pg_map and tsl::robin_pg_set. The first two are faster and use a power of two growth policy, the last two use a prime growth policy instead and are able to cope better with a poor hash function. Use the prime version if there is a chance of repeating patterns in the lower bits of your hash (e.g. you are storing pointers with an identity hash function).
PackageMaintainer	Matteo F. Vescovi <mfv@debian.org>
PackageName	robin-map-dev
PackageSection	libdevel
PackageVersion	0.6.3-1~bpo10+1
SHA-1	5A840C0134E3F06B40B61C0230A21F0DC0F53ED0
SHA-256	5FFE16BAD6E8E8D5A1AF5A3431F2CCF19D040012143A06D411F86F87A5E7378B