hopscotch-map 2.3.1-1 source package in Ubuntu
Changelog
hopscotch-map (2.3.1-1) unstable; urgency=medium * Team upload. * New upstream version * Standards-Version: 4.6.2 (routine-update) -- Andreas Tille <email address hidden> Wed, 12 Jul 2023 22:01:19 +0200
Upload details
- Uploaded by:
- Debian Med
- Uploaded to:
- Sid
- Original maintainer:
- Debian Med
- Architectures:
- all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Plucky | release | universe | misc | |
Oracular | release | universe | misc | |
Noble | release | universe | misc | |
Mantic | release | universe | misc |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
hopscotch-map_2.3.1-1.dsc | 2.1 KiB | eac65560696057f4e03596e99f60d97ec81133b606062e6e551918a4cadddcbe |
hopscotch-map_2.3.1.orig.tar.gz | 69.1 KiB | 53dab49005cd5dc859f2546d0d3eef058ec7fb3b74fc3b19f4965a9a151e9b20 |
hopscotch-map_2.3.1-1.debian.tar.xz | 3.7 KiB | b5cfa07de3b230be036b14f08ac7ee41933ffff643cc4e9d19aa3c68d9285c86 |
Available diffs
- diff from 2.3.0-3 to 2.3.1-1 (59.1 KiB)
No changes file available.
Binary packages built by this source
- libtsl-hopscotch-map-dev: C++ fast hash map and hash set using hopscotch hashing
The hopscotch-map library is a C++ implementation of a fast hash map and hash
set using open-addressing and hopscotch hashing to resolve collisions. It is a
cache-friendly data structure offering better performances than
`std::unordered_ map` in most cases and is closely similar to
`google::dense_ hash_map` while using less memory and providing more
functionalities.
.
The library provides the following main classes: `tsl::hopscotch_map`,
`tsl::hopscotch_ set`, `tsl::hopscotch _pg_map` and `tsl::hopscotch _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).
.
In addition to these classes the library also provides `tsl::bhopscotch_map`,
`tsl::bhopscotch_ set`, `tsl::bhopscotc h_pg_map` and `tsl::bhopscotc h_pg_set` .
These classes have an additional requirement for the key, it must be
`LessThanComparable`, but they provide a better asymptotic upper bound.
Nonetheless if you don't have specific requirements (risk of hash DoS attacks),
`tsl::hopscotch_ map` and `tsl::hopscotch _set` should be sufficient in most
cases and should be your default pick as they perform better in general.