Ubuntu
hopscotch-map package

hopscotch-map 2.2.1-1 source package in Ubuntu

Changelog

hopscotch-map (2.2.1-1) unstable; urgency=medium

  * Initial release (Closes: #946638)

 -- Michael R. Crusoe <email address hidden>  Thu, 12 Dec 2019 13:38:02 +0100

Upload details

Uploaded by:
Debian Med
Uploaded to:
Sid
Original maintainer:
Debian Med
Architectures:
any
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
hopscotch-map_2.2.1-1.dsc 2.1 KiB cb683bc86415c96800e55ff27824fb0a8133675ccc66c47f172e11d801fcb2bd
hopscotch-map_2.2.1.orig.tar.gz 67.9 KiB 73e301925e1418c5ed930ef37ebdcab2c395a6d1bdaf5a012034bb75307d33f1
hopscotch-map_2.2.1-1.debian.tar.xz 3.1 KiB 590bb97bc1be77647ee8ddeae9cbc2743f3e77e697099ee193c2597ffe9442f9

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::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.