Parents (Total: 22)

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

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	2F664EFE0F3004DFBE6F475DED3CE231
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	lp152.5.1
PackageVersion	0.6.3
SHA-1	1495E7B61B97D51393B74CC13D8F2AE135F2D1D4
SHA-256	08D6847447418F93B0937574FD1105B22EF1A19045D936E42D4D76E5E2DE052B

Key	Value
MD5	7111EB6A2C8ECF1585F875A73FC2009A
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.2
PackageVersion	0.6.3
SHA-1	3E545DBD015181CF33136B51B75278FA45DA8043
SHA-256	8910472463CE97830EFEA4DD7DD7CB2E24866B5761A02A3AC5C0C3530CF175BA

Key	Value
MD5	23399DA5AF244F247375C3C53816B184
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.9
PackageVersion	0.6.3
SHA-1	5EEB8806378A122553204040D37F9096EBEE9C9B
SHA-256	4E40385E32AFD2030F06F6AF2F200D2260003C5AD326B21E4A47F72A99DF5433

Key	Value
MD5	5D1263FF21355A86462136DAC3E3BDD6
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	daviddavid <daviddavid>
PackageName	robin-map-devel
PackageRelease	1.mga8
PackageVersion	0.6.3
SHA-1	6947C3DB069EC96A58565C73D0C5FADB46B1AD65
SHA-256	7EBCF77724A96FF29EF1B1DA5A7682545C81CE20DD359B8318487571323079D6

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

Key	Value
MD5	A35C1BA2FCC92083E19178D77026D7D6
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	lp153.5.1
PackageVersion	0.6.3
SHA-1	86310296F97C941B9FA0E8E8B4E9E83826B5AE20
SHA-256	62A79216566364E786EC5BCF57E75F08B81B464BE4340468E68524A764FBD09B

Key	Value
MD5	539F0957FCE539EFBBE9E3B9227BD4BB
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://www.suse.com/
PackageName	robin-map-devel
PackageRelease	lp154.5.1
PackageVersion	0.6.3
SHA-1	86F78A2BEC014778C9A7841E90313291184C5817
SHA-256	3D08F8500DD558C1B9C0C9EE33D46BEC47CF49155B09FC0304A9F5EEBE2B158C

Key	Value
MD5	9F303E878AB3E4AEFB06BA476918EFF4
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://www.suse.com/
PackageName	robin-map-devel
PackageRelease	150400.5.1
PackageVersion	0.6.3
SHA-1	8BE0DDC266F2D28E1DA1F30AC1AE89C6F36C34F3
SHA-256	7E282553B1E4CDCBC22EBC863278B06AD443A2F8FA74B1EC1097BF52DBDE0945

Key	Value
MD5	105039D36DC7921D8AE726A5A09D57B8
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	4.fc34
PackageVersion	0.6.3
SHA-1	8F9D849D7ECE25B6A018BB88A80C3209217215C7
SHA-256	AD32BE07BA9FE978FCABB135860115F3AD2AA369E02540FD32E53DAC26330067