Parents (Total: 8)

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

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
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
FileName	http://archlinux.mirror.root.lu//pool//community//robin-map-0.6.3-1-x86_64.pkg.tar.zst
MD5	77DAE81E881157A4D3D6BF6F0A054331
SHA-1	B9758E15155052EA087945AB6E62460C730C9DB1
SHA-256	D4FCCD58EFBADC5B15BE90F94204C91ECF7E1F87CF0E777D891735615D415258
SSDEEP	384:Sxb48650ztZU0oFLOsHCgOwOQ6CLEYZEu4mhEzox8INKwUupXgF8o+yVk:gYSLU0P6CgaQ6QrJRKwUupXgz+y+
TLSH	T16992E1F9A6E950D5B592D7C3BA108594A802C2E3522C3B43771CBD8AFD94CFB161FA41

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	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	22EA51AF3468A6F492D40BE278793CA4
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.1
PackageVersion	0.6.3
SHA-1	D6BAF6A7072F1F1A2E25EF002122AA6E81F43F84
SHA-256	7EE3E73AD8F258FA65D7650DA3E3943E36E2C0346A75D006A88FDFA256862914