Result for 171159F4B09E3D53331A0CB32D2E1E3346131584

Query result

Key Value
FileName./usr/share/cmake/tsl-robin-map/tsl-robin-mapConfigVersion.cmake
FileSize1604
MD57813FBEF1C224BEB101D0E2D16D623C2
SHA-1171159F4B09E3D53331A0CB32D2E1E3346131584
SHA-25639FC00C2F7AF5412DDF2BC7C5AC23578F773827F25AD992BEA45F9249D2C4886
SSDEEP48:pifh430Y30gu/Ei30e30bUKl30gqPmmdmUGg30gk30ge630KV30qm6BUd30y30dN:uRguMnrbUK+gv9UG5glge/KOgXWe
TLSHT19631AE87944C4AF2A3464AE356873978BB3551A5A3B380D8F54AB88C5764D3483EF3EC
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
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