Result for 0C7D832BB5D2B2C159D691797C11FC341D4E2428

Query result

Key Value
FileName./usr/include/tsl/robin_hash.h
FileSize46283
MD5284877DB74AB2C38B1EA0D9719464829
SHA-10C7D832BB5D2B2C159D691797C11FC341D4E2428
SHA-256FE5F91935D48A3EDAC729034D0C01B5292B89B3918AC66BD7BC58846C13ACED6
SSDEEP768:exdlCArOMpC9r0rbvCuHjgJgyF8MGKEgZtfw2hOaqo4N4WObmm:exdlCArOwC9r0rbauHjgJgyFuKEM9w2J
TLSHT1172341A165F67AF115B3F2739F864042FA115517A368CED5B9EC0730EF036258AAB2F0
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