Result for 6B5AD21CA6C4D7F84DB056F2E35F35FF2E23AB1A

Query result

Key Value
FileName./usr/include/tsl/robin_map.h
FileSize25392
MD5F3CF83455AB7BE041249A97198578856
SHA-16B5AD21CA6C4D7F84DB056F2E35F35FF2E23AB1A
SHA-256E065804C4E0C7CAF12834FFA119E451CA162B4D4B3CC4E2610AEE34875CC6567
SSDEEP384:VEz0JCU2WupAoyKSieBcA9qWPQPLoQh2FXLF2B5vJKiP1qQccG:e5WuR9eiA9qWPQPLoQoFbF65xKita
TLSHT1EFB2326374F0BA310962A371AB815080F626B427F7598ED8749F0735FF5372943AB6B4
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