Parents (Total: 34)

The searched file hash is included in 34 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
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
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
FileName	https://ftp.lysator.liu.se/pub/OpenBSD/6.9/packages//sparc64//robin-map-0.6.3.tgz
MD5	5F9840E447B90FD7FC1B1746C42A42FF
SHA-1	14DDE95977A8EA6F1D7A1281A5DD8DEC9F62DE4D
SHA-256	CEF2AF062F42B7FA076DA17D18D0AB87E92120CC7FEFDE7E1F58E88846207BB8
SSDEEP	384:n+929YYS8L82RoX6jiaUkxJW9bFP0RG2ZtXBoSjpUI55+zyyHZ9ujEomrb2qnz/s:+929WJ2RoKjAkTWHMG2ZjDn+z19ujEoX
TLSH	T190A2E01AE1D70C8A082DB2F1F37478B6FF4AEE2749D0D6CA5627467D9D3610F422C068

Key	Value
FileName	https://ftp.lysator.liu.se/pub/OpenBSD/6.9/packages//mips64//robin-map-0.6.3.tgz
MD5	C575DC834F11A7F8D8990F109FD02D82
SHA-1	2CB294D6DC9779BDB6636C8B3424BDB8B797D32D
SHA-256	5638C79C27C1B507EDB567141857BD661D04B6F8E514F35C7837AF467B64817A
SSDEEP	384:E9h/gVg6MQy9KIi35ELefkRVlFVL9KXt1SiWkSwK39b3KLRcsq9wPsHJ03KgnTVS:E91gVgbVVbEkT9La1S/kxCbg29wq+V9w
TLSH	T17FA2F126BBF3FA19E54DB140DBD0060445EECCE9D2324906C3A595485FA9BFBBC1D839

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
FileName	https://ftp.lysator.liu.se/pub/OpenBSD/6.9/packages//arm//robin-map-0.6.3.tgz
MD5	3D753E96008AED1A923C454689CB060A
SHA-1	4CD27C23B295E3C11F1180D9F16BC947DB787362
SHA-256	E07ABB5E84AE95B39087E9902E25D382211438E157ACE25555C3A971F380528D
SSDEEP	384:z79IfM2wNDrQwpb0sAoYf7J90RgTeU/ro/87wslyWxTfi5ZzF5UAjHt7:P9wTwDrQwpQ5heGhfyWxTfEzvdd
TLSH	T180A2E17ADFB7C0D8F1A36D3827390ED1AB40C5312394E89CB11F1AACDC252283A89168