robin-map 1.0.1-1 source package in Ubuntu
Changelog
robin-map (1.0.1-1) unstable; urgency=medium * New upstream release * debian/control: S-V bump 4.5.0 -> 4.6.0 (no changes needed) * debian/copyright: extend copyright timestamp -- Matteo F. Vescovi <email address hidden> Fri, 15 Apr 2022 23:15:46 +0200
Upload details
- Uploaded by:
- Matteo F. Vescovi
- Uploaded to:
- Sid
- Original maintainer:
- Matteo F. Vescovi
- Architectures:
- all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section |
---|
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
robin-map_1.0.1-1.dsc | 2.0 KiB | 55b76346fbe2103d2d8337322100707f10a16c28532b5fad63a34aea1a9539e9 |
robin-map_1.0.1.orig.tar.xz | 55.7 KiB | 373624be2eb6545cbbbd13f6553730129483e770efa9f301b954f30e16b95207 |
robin-map_1.0.1-1.debian.tar.xz | 2.7 KiB | 3038cf4e59ce67308823046760c4b3c7b9b0aa144ad78cdbd572bad7f8886c3e |
Available diffs
- diff from 0.6.3-1 to 1.0.1-1 (52.3 KiB)
No changes file available.
Binary packages built by this source
- robin-map-dev: 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).