Hi posted some thoughts on the subject at our mattermost workspace.
This particular PR caught my attention because I have done things like
this before. I am looking forward to gcc15. I think changing things at
this point might be a bit intrusive.
I am thinking about:
"The FNV-1a algorithm is:
hash = FNV_offset_basis
for each octetOfData to be hashed
hash = hash xor octetOfData
hash = hash * FNV_prime
return hash"
Found here:
https://softwareengineering.stackexchange.com/questions/49550/which-hashing-algorithm-is-best-for-uniqueness-and-speed
If you are interested, comment on MatterMost.
Jerry -
