If we look at
|
emptyNs := bytes.Repeat([]byte{0}, int(n.NamespaceLen)) |
|
h := n.baseHasher.Sum(nil) |
|
digest := append(append(emptyNs, emptyNs...), h...) |
we notice this code
|
digest := append(append(emptyNs, emptyNs...), h...) |
but that code could be made clearer, simpler and even faster (if in hot loop) by
emptyNs2X := bytes.Repeat([]byte{0}, int(n.NamespaceLen)*2)
h := n.baseHasher.Sum(nil)
digest := append(emptyNs2X, h...)