Parents (Total: 4)

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

Key	Value
MD5	A6E8D4F0CDA97683E28CF0E755D370E7
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	5.20
PackageVersion	0.6.3
SHA-1	ABD9343362BA22426D85324676F654136758E3B1
SHA-256	D4CA736A76D1DCAF23C0EA009BB1D744EEAE7848604D9C4A299757430D6441CC

Key	Value
MD5	4421D697705E182BDA77CEEA57A6D62E
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	1.4
PackageVersion	0.6.3
SHA-1	B860CF38236EE457AFFCCC6A1F1DE9E951C1703C
SHA-256	64CDA30FFE6A727A424F5AD933A4AADDFD93F8E1A10B0964D4E79637232A1954

Key	Value
MD5	DD50D81768A83CA0720B79A284A6EA9B
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	5.17
PackageVersion	0.6.3
SHA-1	0465D8A38265F6B41AD54A0C5753B6BF4255E88C
SHA-256	E181AC23CCE7359E31DA2F5C51CBD3F839F214284EA2C68DDDB2DF0E3E1AC4A1

Key	Value
MD5	A9BD8F31D5236AE82398A07A8D5C4D5D
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	5.27
PackageVersion	0.6.3
SHA-1	7CDE7FE5DF8A9B3358173B11650B444945999214
SHA-256	F186C0CE90A606B56013CC468168E11B612FE0F147D3085EDC14AC6B664415E3