hopscotch-map 2.3.0-2 source package in Ubuntu


hopscotch-map (2.3.0-2) unstable; urgency=medium

  * Team upload
  * Fix watchfile to detect new versions on github (routine-update)
  * Standards-Version: 4.6.0 (routine-update)

 -- Andreas Tille <email address hidden>  Sun, 22 Aug 2021 10:00:19 +0200

Upload details

Uploaded by:
Debian Med
Uploaded to:
Original maintainer:
Debian Med
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Jammy release universe misc


Jammy: [FULLYBUILT] amd64


File Size SHA-256 Checksum
hopscotch-map_2.3.0-2.dsc 2.1 KiB d4dff0576d0b74391ba49af04ab0b195ad2e8ffdfb9dc2f180909858715e9dfe
hopscotch-map_2.3.0.orig.tar.gz 69.4 KiB a59d65b552dc7682521989842418c92257147f5068152b5af50e917892ad9317
hopscotch-map_2.3.0-2.debian.tar.xz 3.6 KiB bdd6b9804c98e53b63e725f763068198a5fbe8b0cfa60d1726acf471fbfb31c4

Available diffs

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
 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::bhopscotch_pg_map` and `tsl::bhopscotch_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.