Flexible and efficient recursive hashing

[bearophile via Digitalmars-d]

Among the CppCon 2014 slide packs there is this nice one:
"Types Don't Know #", by Howard Hinnant:

https://github.com/CppCon/CppCon2014/tree/master/Presentations/Types%20Don%27t%20Know%20%23%20-%20Howard%20Hinnant%20-%20CppCon%202014

It shows a nice idea to perform transitive hashing in a flexible 
and efficient way. Perhaps the idea can be used in D too. It 
suggests the introduction of a hashAppend standard method.

Bye,
bearophile