Parents (Total: 19)

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

Key	Value
SHA-1	008E56BBE36C748A462280F287593BCC2A09DD12
snap-authority	canonical
snap-filename	u9RvoPWIDtHquyrBzUSOal5iiFHxd1QG_655.snap
snap-id	u9RvoPWIDtHquyrBzUSOal5iiFHxd1QG_655
snap-name	yuzu
snap-publisher-id	9SWN96Eik6hh5eaxna63mWktGmp7BCBU
snap-signkey	BWDEoaqyr25nF5SNCvEv2v7QnM9QsfCc0PBMYD_i2NGSQ32EF2d4D0hqUel3m8ul
snap-timestamp	2020-08-25T19:04:50.089482Z
source-url	https://api.snapcraft.io/api/v1/snaps/download/u9RvoPWIDtHquyrBzUSOal5iiFHxd1QG_655.snap

Key	Value
SHA-1	0B0BC79FF0D2F4523D04E14DC985078A3BC27BA8
snap-authority	canonical
snap-filename	u9RvoPWIDtHquyrBzUSOal5iiFHxd1QG_568.snap
snap-id	u9RvoPWIDtHquyrBzUSOal5iiFHxd1QG_568
snap-name	yuzu
snap-publisher-id	9SWN96Eik6hh5eaxna63mWktGmp7BCBU
snap-signkey	BWDEoaqyr25nF5SNCvEv2v7QnM9QsfCc0PBMYD_i2NGSQ32EF2d4D0hqUel3m8ul
snap-timestamp	2020-08-25T19:04:50.089482Z
source-url	https://api.snapcraft.io/api/v1/snaps/download/u9RvoPWIDtHquyrBzUSOal5iiFHxd1QG_568.snap

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
SHA-1	35F7E926B0555AC34B76F7FDA78265A085AA273C
snap-authority	canonical
snap-filename	u9RvoPWIDtHquyrBzUSOal5iiFHxd1QG_602.snap
snap-id	u9RvoPWIDtHquyrBzUSOal5iiFHxd1QG_602
snap-name	yuzu
snap-publisher-id	9SWN96Eik6hh5eaxna63mWktGmp7BCBU
snap-signkey	BWDEoaqyr25nF5SNCvEv2v7QnM9QsfCc0PBMYD_i2NGSQ32EF2d4D0hqUel3m8ul
snap-timestamp	2020-08-25T19:04:50.089482Z
source-url	https://api.snapcraft.io/api/v1/snaps/download/u9RvoPWIDtHquyrBzUSOal5iiFHxd1QG_602.snap

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
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
FileSize	25288
MD5	4D10EA9BDEF3D72DD1B1C7656FC21FB7
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~bpo10+1
SHA-1	5A840C0134E3F06B40B61C0230A21F0DC0F53ED0
SHA-256	5FFE16BAD6E8E8D5A1AF5A3431F2CCF19D040012143A06D411F86F87A5E7378B

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	91BAEC9A0D44F69FCFDD9CE833473EEB
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.el8
PackageVersion	0.6.1
SHA-1	7D3B7F5DF01667A05DCA9F3C3DE864A6522C1754
SHA-256	8760E872D1ADFAB07B4225AB1E907DE0EDD6E41C74E81B51FD2D5919A4B09139

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