Result for 0E269D1EC2B7F5ACEC308D78D52CF981F3F49996

Query result

Key Value
FileName./usr/include/tsl/robin_set.h
FileSize20433
MD5A9C2594F3A64FD4B8B88D47F47DD12B1
SHA-10E269D1EC2B7F5ACEC308D78D52CF981F3F49996
SHA-256050978680E77BC22A81D8A5D4F86634B4C77DA4C7E78733AE69E6D8BCD2C3863
SSDEEP384:VERyTCytguEnYou4AAGPuAAqWPMh2gmBnnJKqftqf:esguEVtGWAAqWPMogKnJKq1+
TLSHT1E592306375E0BA320926A371AB925080F6266553F754CEC8B09F4731FF5372E43AB6B4
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