Parents (Total: 6)

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

Key	Value
MD5	E2E7BC70AF19F150E8138E8EF49DF1EA
PackageArch	noarch
PackageDescription	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). See GrowthPolicy for details. A benchmark of tsl::robin_map against other hash maps may be found here. This page also gives some advices on which hash table structure you should try for your use case (useful if you are a bit lost with the multiple hash tables implementations in the tsl namespace).
PackageName	robin-map-devel
PackageRelease	3.1
PackageVersion	0.6.2
SHA-1	E9E4650304F19DC613DBA91056DCABA401A0077A
SHA-256	8F946894D2398C5D613E26826E67CEE12478C5265BD9487A6F7B9DEB35F0355F

Key	Value
MD5	6178B6FE2AB0EDA5C615E892A0A4EC46
PackageArch	noarch
PackageDescription	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). See GrowthPolicy for details. A benchmark of tsl::robin_map against other hash maps may be found here. This page also gives some advices on which hash table structure you should try for your use case (useful if you are a bit lost with the multiple hash tables implementations in the tsl namespace).
PackageName	robin-map-devel
PackageRelease	lp151.3.1
PackageVersion	0.6.2
SHA-1	9CCA874FE9607E48880189D3FDC41C1F88CE204C
SHA-256	DF142921B869DC69BB732DEF5F4E98133996EC56628C1F171087354EC3733B20

Key	Value
MD5	26750D9F6A37A0F718061F3AA682C30A
PackageArch	noarch
PackageDescription	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). See GrowthPolicy for details. A benchmark of tsl::robin_map against other hash maps may be found here. This page also gives some advices on which hash table structure you should try for your use case (useful if you are a bit lost with the multiple hash tables implementations in the tsl namespace).
PackageMaintainer	https://bugs.opensuse.org
PackageName	robin-map-devel
PackageRelease	bp153.1.14
PackageVersion	0.6.2
SHA-1	CC078F87AB3E1C1A72EBEA3854C786E999E53DF6
SHA-256	A7E98D4455C0A34FE28F49C19F16848E616398035B5422E221231707E63D1653

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
MD5	AA2C64A29E7A77F88013E10F99F4F02D
PackageArch	noarch
PackageDescription	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). See GrowthPolicy for details. A benchmark of tsl::robin_map against other hash maps may be found here. This page also gives some advices on which hash table structure you should try for your use case (useful if you are a bit lost with the multiple hash tables implementations in the tsl namespace).
PackageMaintainer	Fedora Project
PackageName	robin-map-devel
PackageRelease	2.fc32
PackageVersion	0.6.2
SHA-1	F8DCDD8EE7BD004C0C237BD5EE1DBFAA75B099AE
SHA-256	EDF8939EF8DDD6249284C395982D03B89E846A66EC5A3C1CA5A243C385FC396A

Key	Value
MD5	41CC02BE104F52BF94B4026CB458D815
PackageArch	noarch
PackageDescription	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). See GrowthPolicy for details. A benchmark of tsl::robin_map against other hash maps may be found here. This page also gives some advices on which hash table structure you should try for your use case (useful if you are a bit lost with the multiple hash tables implementations in the tsl namespace).
PackageMaintainer	https://bugs.opensuse.org
PackageName	robin-map-devel
PackageRelease	lp152.1.1
PackageVersion	0.6.2
SHA-1	C5126F53D5DA72094CEDF19034E21E040779B1E9
SHA-256	66CB7D033FD7A06F0B02FE438814266B6A8F1E3F1C463EC408AB2A2861AFA237