the benchmark contains William Ahern's perfect hash library (pf), unordered map(um), unordered map with string view key(umv), robin map (mr),
robin map with string view key(mrv), and your StrHash(mca).
first summarize timing of one execution and second for the loop of 1000 execution. generally your version of hashFunc(0) performs better but it's not 3x faster than robin map.
the benchmark contains William Ahern's perfect hash library (pf), unordered map(um), unordered map with string view key(umv), robin map (mr), robin map with string view key(mrv), and your StrHash(mca).
first summarize timing of one execution and second for the loop of 1000 execution. generally your version of hashFunc(0) performs better but it's not 3x faster than robin map.
great work!