robin-map 1.2.1-1 source package in Ubuntu

Changelog

robin-map (1.2.1-1) unstable; urgency=medium

  * New upstream release
  * debian/control: S-V bump 4.6.0 -> 4.6.2 (no changes needed)

 -- Matteo F. Vescovi <email address hidden>  Sat, 21 Jan 2023 18:58:19 +0100

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 Pocket Published Component Section
Oracular release universe misc
Noble release universe misc
Mantic release universe misc
Lunar release universe misc

Builds

Lunar: [FULLYBUILT] amd64

Downloads

File Size SHA-256 Checksum
robin-map_1.2.1-1.dsc 2.0 KiB fc03a2b314a1eeb5f60410ed0f9d518c1cc0da0ebd77d79ff7bf77acc4798e48
robin-map_1.2.1.orig.tar.xz 55.8 KiB 34c720250cfc11ada269e8779991c85e260cfc865c0af3a6aab30a457a48aa75
robin-map_1.2.1-1.debian.tar.xz 2.9 KiB 13b5c93e8d370040d7eb43c86c15eec1e62120e52daeb9a8c0003af31cdd5641

Available diffs

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