func hashIntFNV1A()

in bench/hash.go [88:101]

• 14 lines of code
• 1 McCabe index (conditional complexity)

func hashIntFNV1A(i int) uint32 {
	b := [8]byte{}
	binary.BigEndian.PutUint64(b[:], uint64(i))
	h := Init32
	h = (h ^ uint32(b[0])) * prime32
	h = (h ^ uint32(b[1])) * prime32
	h = (h ^ uint32(b[2])) * prime32
	h = (h ^ uint32(b[3])) * prime32
	h = (h ^ uint32(b[4])) * prime32
	h = (h ^ uint32(b[5])) * prime32
	h = (h ^ uint32(b[6])) * prime32
	h = (h ^ uint32(b[7])) * prime32
	return h
}