string hash significant speedup

[Steven Schveighoffer via Digitalmars-d-learn]

On 8/10/17 3:36 PM, Johnson Jones wrote:
> when using T[string], hashing is used. Computing the hash is 
> slow(relatively speaking).
> 
> Does D cache the hashes? Strings are immutable so there is absolutely no 
> reason why the hash ever need to be computed more than once.

It computes them on insertion, and caches the result in the structure of 
the hash table.

-Steve