MUM-based hash functions

I have had a long-standing interest in hash functions. This interest naturally grew out of my 40 years of work on compilers and various programming language processors. The reason is simple: the most efficient universal search–insert-delete data structure in compilers is the hash table. Although hash table can have a quadratic complexity in the worst case, in practice it outperforms any n*long(n)…