[ 原始碼： 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).