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	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	F8F1A3A654ABB4B518A20CC8632466DF
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	bp155.1.8
PackageVersion	1.0.1
SHA-1	EC89AD13C2148D34473168F35AD074D034276A1F
SHA-256	5D60E98CAA21118223FC43797796F4A1D10E36CE4F35830BBB93399361434962

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	1F55AB14DAA5D3BA25AFA05932581541
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	bp154.1.29
PackageVersion	0.6.3
SHA-1	9B295FC96EC3C4594CA18B58B2B5EC4AF7465D62
SHA-256	46449D24A2D8FEDAC26B3826382FADCC283E75737E0F0A6522C60AD5CC0AF31E