[ 源代码： robin-map ]
软件包：robin-map-dev（1.4.0-1）
试制（Experimental）软件包
警告：这个软件包来自于 experimental 发行版。这表示它很有可能表现出不稳定或者出现 bug ，甚至是导致资料损失。请务必在使用之前查阅 changelog 以及其他潜在的文档。
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).