Fred

here is my example for your reference: ```xml ```

没有竞争当然不会get不到。有竞争的话，对方抢先删除了，或者超时了，就会Get不到 -- 这取决于你是否把这一瞬间定义为代码逻辑的时间先后。

google's hash function -- cith_hash_128, has very good hash value output on your keys if they are not too short. based on this, the bucket order of high_load_factor_hash_table -> low_load_factor_hash_table...