Result for A694A36EC98A052D2C06149137E87CC2A40F7D04

Query result

Key Value
FileName./usr/share/cmake/tsl-robin-map/tsl-robin-mapConfigVersion.cmake
FileSize2739
MD55D38334CF6106A0FA90BD81E73976C2A
SHA-1A694A36EC98A052D2C06149137E87CC2A40F7D04
SHA-2568ACFD946BD9653EEE55C59B73E57E436949371EEA574F99922F5ED831085BADB
SSDEEP48:pifh430Y30gu/Ei30j30bUKl30gq+mmdm5fKutmEpNATIuUSMV30gcpUEa30bzhr:uRguMn4bUK+gi95fjtmEpNATIuUSMOgU
TLSHT1BB51584795489AF253868BD356C77938BA361096A3B384E8F14EB88C4794D7443FE3EC
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
MD5F8F1A3A654ABB4B518A20CC8632466DF
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).
PackageMaintainerhttps://bugs.opensuse.org
PackageNamerobin-map-devel
PackageReleasebp155.1.8
PackageVersion1.0.1
SHA-1EC89AD13C2148D34473168F35AD074D034276A1F
SHA-2565D60E98CAA21118223FC43797796F4A1D10E36CE4F35830BBB93399361434962