Result for 6EC73B07148CF3E717A8516193255211B6460E71

Query result

Key Value
FileName./usr/share/cmake/tsl-robin-map/tsl-robin-mapTargets.cmake
FileSize3399
MD5495D8B835A19EEA078A11397432F302E
SHA-16EC73B07148CF3E717A8516193255211B6460E71
SHA-256CBEC8A7916B4F33AC75D7973D6D221239CE98B0910B2865B75B5F5187C512CFD
SSDEEP96:ZNz5QU4EhzxmgKT3kalEbRG7hPT/L+XmNbUM:56DR7hPTy2P
TLSHT1BB6110672F5B49E102E2C7913FD4E216E02291BB7F4351A5EC4A724C26EC5188A8F27F
hashlookup:parent-total1
hashlookup:trust55

Network graph view

Parents (Total: 1)

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

Key Value
MD523399DA5AF244F247375C3C53816B184
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).
PackageNamerobin-map-devel
PackageRelease5.9
PackageVersion0.6.3
SHA-15EEB8806378A122553204040D37F9096EBEE9C9B
SHA-2564E40385E32AFD2030F06F6AF2F200D2260003C5AD326B21E4A47F72A99DF5433