Result for 0CB584B2780807C435A9371D6C8A33C20CCE862E

Query result

Key Value
FileName./usr/share/cmake/tsl-robin-map/tsl-robin-mapConfigVersion.cmake
FileSize2739
MD519DB59385DE02831CFB0CF87AE76245D
SHA-10CB584B2780807C435A9371D6C8A33C20CCE862E
SHA-256D5447BC7355E0EED05F772A03A38BC7265693EA2F10B586EE7092DBD80483C61
SSDEEP48:pifh430Y30gu/Ei30X30bUKl30gq6mmdmVfKutmEpNATIuUSMV30gcpUEa30bzhr:uRguMn0bUK+gO9VfjtmEpNATIuUSMOgU
TLSHT11451794795489AF263868BD316C77938BA361096A3B380E8F54EB88C4754D7443FE3ED
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
MD5105039D36DC7921D8AE726A5A09D57B8
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
PackageRelease4.fc34
PackageVersion0.6.3
SHA-18F9D849D7ECE25B6A018BB88A80C3209217215C7
SHA-256AD32BE07BA9FE978FCABB135860115F3AD2AA369E02540FD32E53DAC26330067