// When the length of prefix is odd, the prefix is supplemented with 0
When the length of prefix is odd, the prefix is supplemented with 0
// When the length of prefix is odd the prefix is supplemented with 0
func prefixToKey(prefix []byte) []byte {
	length := len(prefix)
	l := (length + 1) / 2
	ret := make([]byte, l)
	i := 0
	p := prefix
	if length%2 == 1 {
		p = prefix[1:]
		ret[0] = prefix[0] & 0xF
		i = 1
	}
	for j := 0; j < len(p); j++ {
		pos := i + j/2
		ret[pos] = (ret[pos] << 4) | (p[j] & 0xF)
	}
	return ret
}
func prefixToKey ( prefix [ ] byte ) [ ] byte { length := len ( prefix ) l := ( length + 1 ) / 2 ret := make ( [ ] byte , l ) i := 0 p := prefix if length % 2 == 1 { p = prefix [ 1 : ] ret [ 0 ] = prefix [ 0 ] & 0xF i = 1 } for j := 0 ; j < len ( p ) ; j ++ { pos := i + j / 2 ret [ pos ] = ( ret [ pos ] << 4 ) | ( p [ j ] & 0xF ) } return ret }
When the length of prefix is odd, the prefix is supplemented with 0
When the length of prefix is odd the prefix is supplemented with 0