重散列

A hash function based on triple-block chaining is put forward and its security is demonstrated.

提出了一类基于三重分组链接的单向散列函数，并论证了其安全性。

The current proposal is that insert, erase and rehash are stable - so they are here.

当前的建议是，插入、删除和重散列都应是稳定的-所以它们就是这样的。

However, the user can request an explicit rehashing passing a new bucket array.

不过，用户可以传入一个新的桶数组来请求一次明确的重散列。

Rehashing can be explicitly requested and the user must provide a new bucket array that will be used from that moment.

可以明确要求重散列，用户必须提供从那一刻开始使用的新的桶数组。

This will get the expensive rehashing out of the way and let you store iterators, safe in the knowledge that they won't be invalidated.

这样可以养活不必要的代价昂贵的重散列，让你可以保存迭代器，并确知它们不会失效。

Since no automatic rehashing is done, iterators are never invalidated when inserting or erasing elements.

由于没有自动的重散列，所以在插入和删除元素时不会令迭代器失效。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。