- 完全随机的 int key, 做 find_or_insert 操作
| ns/op | op/s | err% | ins/op | bra/op | miss% | total | benchmark
|--------------------:|--------------------:|--------:|----------------:|---------------:|--------:|----------:|:----------
| 35,153,700.00 | 28.45 | 1.8% | 157,273,534.00 | 33,488,895.00 | 1.5% | 0.41 | `unordered_map:random`
| 136,277,935.00 | 7.34 | 1.7% | 193,896,493.00 | 48,073,497.00 | 13.1% | 1.49 | `map:random`
| 58,396,319.00 | 17.12 | 0.8% | 312,029,741.00 | 92,169,201.00 | 4.9% | 0.66 | `btree_map:random`
| 12,382,928.00 | 80.76 | 0.8% | 92,646,655.00 | 12,036,977.00 | 5.7% | 0.14 | `robin_hood_map:random`
| 17,489,723.00 | 57.18 | 1.2% | 90,160,012.00 | 17,922,242.00 | 4.4% | 0.20 | `dense_hash_map:random`
| 810,089.00 | 1,234.43 | 3.2% | 3,600,629.00 | 300,147.00 | 0.0% | 0.01 | `array(test):random`
- 顺序出现的 int key, 每个 key 重复出现 32 次, 组与组之间略微打乱(比如 0 0 0 1 0 1 1 2 1 2 2 2 ... 这样的序列), 做 find_or_insert 操作
| ns/op | op/s | err% | ins/op | bra/op | miss% | total | benchmark
|--------------------:|--------------------:|--------:|----------------:|---------------:|--------:|----------:|:----------
| 19,428,866.00 | 51.47 | 1.2% | 137,639,829.00 | 26,979,609.00 | 1.2% | 0.22 | `unordered_map:sequential`
| 305,547,283.00 | 3.27 | 0.5% | 494,128,064.00 | 130,782,008.00 | 17.3% | 3.34 | `map:sequential`
| 183,810,512.00 | 5.44 | 0.4% | 973,906,327.00 | 302,459,238.00 | 4.8% | 2.03 | `btree_map:sequential`
| 34,349,617.00 | 29.11 | 0.3% | 183,005,851.00 | 24,127,612.00 | 12.6% | 0.38 | `robin_hood_map:sequential`
| 26,675,597.00 | 37.49 | 1.2% | 185,300,938.00 | 46,039,048.00 | 5.1% | 0.30 | `dense_hash_map:sequential`
| 6,950,046.00 | 143.88 | 0.8% | 38,400,593.00 | 3,200,143.00 | 0.0% | 0.08 | `array(test):sequential`