func hashUInt32()

in bench/hash.go [132:141]

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

func hashUInt32(i uint32) uint32 {
	b := [4]byte{}
	binary.BigEndian.PutUint32(b[:], 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
	return h
}