Function mergeKeyValues

utils.go:97–135

(
	k0, v0 [][]byte,
	k1, v1 [][]byte,
)

}

func mergeKeyValues(
	k0, v0 [][]byte,
	k1, v1 [][]byte,
) (keys, values [][]byte) {
	l0 := len(k0)
	l1 := len(k1)
	// Pre-allocate capacity with estimated maximum size to reduce slice re-growth
	estimatedSize := l0 + l1
	keys = make([][]byte, 0, estimatedSize)
	values = make([][]byte, 0, estimatedSize)
	cur0 := 0
	cur1 := 0
	for cur0 < l0 && cur1 < l1 {
		if bytes.Compare(k0[cur0], k1[cur1]) <= 0 {
			keys = append(keys, k0[cur0])
			values = append(values, v0[cur0])
			cur0++
			if bytes.Equal(k0[cur0], k1[cur1]) {
				// skip k1 item if k0 == k1
				cur1++
			}
		} else {
			keys = append(keys, k1[cur1])
			values = append(values, v1[cur1])
			cur1++
		}
	}
	for cur0 < l0 {
		keys = append(keys, k0[cur0])
		values = append(values, v0[cur0])
		cur0++
	}
	for cur1 < l1 {
		keys = append(keys, k1[cur1])
		values = append(values, v1[cur1])
		cur1++
	}
	return
}

// This Type is for sort a pair of (k, v).
type sortkv struct {