Key | Value |
---|---|
FileName | ./usr/share/doc/robin-map-dev/changelog.Debian.gz |
FileSize | 372 |
MD5 | 9459D894AA40301E2C6702F53C63F25D |
SHA-1 | 07E73DD7C63342ACDD6E565D3F2CD03F3CA20211 |
SHA-256 | A44C1122F17B8386A72009784211E74B7C1F27DDA78DB70A22BC1B8AAF7E4616 |
SSDEEP | 6:Xt/Eznb+4Y+3dhfJ0MNDYcoeSOSrRXOpDNmEC0rTPfZFEJzR2GrQQIt+qJgb965I:Xgb+2pJPN4e2MpDzxr7fZFEB0N3t+qJQ |
TLSH | T118E0C05620273A63F0836868CA4A7319A63F91A119F5601B960D05C4D72D7F2273E95F |
hashlookup:parent-total | 2 |
hashlookup:trust | 60 |
The searched file hash is included in 2 parent files which include package known and seen by metalookup. A sample is included below:
Key | Value |
---|---|
FileSize | 25276 |
MD5 | 839016EF237A3DF8F84439465B8D6960 |
PackageDescription | C++ 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). |
PackageMaintainer | Matteo F. Vescovi <mfv@debian.org> |
PackageName | robin-map-dev |
PackageSection | libdevel |
PackageVersion | 0.6.3-1 |
SHA-1 | 3B78C08CD65B552369193646B4188EAE607AF5B3 |
SHA-256 | 6D7D10A25CBF8941404102407C8D714AECC35F2D0AA92BFD2AAFA7B312593C93 |
Key | Value |
---|---|
FileSize | 25316 |
MD5 | 52505A93EB2C0BAE761949BE91AC2A43 |
PackageDescription | C++ 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). |
PackageMaintainer | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | robin-map-dev |
PackageSection | libdevel |
PackageVersion | 0.6.3-1 |
SHA-1 | F4EA795130B26D35F957EB0890A9CDBA2E488FE5 |
SHA-256 | 98523E62FD66BD48586DF306A5CF5D5E7DA01B2ED1ABEC45E1AEAF938B54503C |