Result for D9145B42C68ED2D76B6C1766CB1FAB4778F1098F

Query result

Key Value
FileName./usr/share/doc/robin-map-devel/README.md
FileSize14274
MD5E664530876AA9E71382A3D230129DD66
SHA-1D9145B42C68ED2D76B6C1766CB1FAB4778F1098F
SHA-256C1F16589D48968C0D03A4C953B1F5797DBE00757261F5ED5D05B40F2C9FD034F
SSDEEP192:vv3mAtsCkzoVnRGziPkudseYUbSuWNWA9xI9/iEAn4uYX16EVR19wqf2AvBKgBvl:WVCk8nwuPkuYuwWAjddr6jH
TLSHT1A052D80AB3B4373015930BA5A38D5196F63A8026B3ACCD60749E43EC5F076B2933B1F9
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