We're continuing with the array search covered in episode 1. I'd recommend reading that before this one. Lets start with an easy one. One implementation we didn't cover in episode 1 is to use bytes.IndexByte. IndexByte does end up calling a hand craft assembly version so there's some hope this might be decent. func (n *nodeLoop) getIndexByte(k byte) interface{} { idx := bytes.IndexByte(n.key[:n.count], k) if idx < 0 { return nil } return n.
