bmkessler

For 32-bit mod on x64 there is a new mod method that involves two multiplications https://arxiv.org/abs/1902.01961 and is benchmarked faster than the current divide, multiply, and subtract implementation in libdivide....

@kellabyte Also, if you avoid the use of the hash interface from the standard lib and use an implementation of FNV that has the appropriate signature `FNV1a(b []byte) uint64` you...

This is really cool. One API option would be: `func Benchmark(b *testing.B, cfgs ...Configurator) Stopper ` And then you could pass in whatever config to output and treat `len(cfgs) ==...