Result for 014AFF73D5F250F8C2A09C7CC5389EDE5ABC472D

Query result

Key Value
FileName./usr/include/tsl/robin_growth_policy.h
FileSize11058
MD5D4E72B44BE8BA0E21115679AAAAEDABB
SHA-1014AFF73D5F250F8C2A09C7CC5389EDE5ABC472D
SHA-256DD6675976E640C24ADC0018316FFC7868BB3FA3D8AE035F2E72FD50344322618
SSDEEP192:5fQHRrvPHvNxMAcP8pXmsmGlyilr28U/xVgiVlKGyinoTbiiazGyqi9UxZ2C42Xk:VErvvvNxMhP8pXDZ2C426r
TLSHT15A324F0A95F2B37015A3D2B75A5E8097F2296517336C8F80BC8FC3642F8203589FF9A4
hashlookup:parent-total2
hashlookup:trust60

Network graph view

Parents (Total: 2)

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

Key Value
MD591BAEC9A0D44F69FCFDD9CE833473EEB
PackageArchnoarch
PackageDescriptionThe 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).
PackageMaintainerFedora Project
PackageNamerobin-map-devel
PackageRelease2.el8
PackageVersion0.6.1
SHA-17D3B7F5DF01667A05DCA9F3C3DE864A6522C1754
SHA-2568760E872D1ADFAB07B4225AB1E907DE0EDD6E41C74E81B51FD2D5919A4B09139
Key Value
FileSize21272
MD544AA9B36C71BF4D3BD7A8B2DBE10EFD4
PackageDescriptionC++ 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).
PackageMaintainerMatteo F. Vescovi <mfv@debian.org>
PackageNamerobin-map-dev
PackageSectionlibdevel
PackageVersion0.5.0-1
SHA-186D949372AFA2B6E9E78C04C7A7E861A0F69562D
SHA-2562367009FE1C0249CB2E96BDC21C9A36FFDF841F9EB86B0C48638D944416E5A93