Result for 7773EA16E9B834DC5A362D879080D9C312EF4A81

Query result

Key Value
FileName./usr/share/doc/robin-map-dev/changelog.Debian.gz
FileSize299
MD500DFB7E8E3F9AE2E468BE5750619E227
SHA-17773EA16E9B834DC5A362D879080D9C312EF4A81
SHA-2561C47A177C320D3D0E222C7694A55A0002DAA0BFE329494C8CCD6FBEA7FE72C29
SSDEEP6:Xt9A6z69cu4/zRbYE/a2VOpxe1uBpyeVGE7rMbum9aMab+Jg2eTL0F5:XPfhbRbYE/jVnEBpy2GWMCm9St0F5
TLSHT128E07D0969D37C6AD625213E35C8159DD047144068128F80C7CC1B0D880A6B342D6685
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
FileSize22860
MD51380EBEA183C1B45D1892086815BEC18
PackageDescriptionC++ implementation of a fast hash map and hash set The 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).
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamerobin-map-dev
PackageSectionlibdevel
PackageVersion0.6.2-1
SHA-1E01B61A5481D802EA267A6F06206FE87A2CE98C4
SHA-256DF2BA3E86F7577605CFDFEAAEE2DEA4087D91C39FA011F49F2568FEA4B7214E1