Method search

runcontainer.go:936–938

search returns alreadyPresent to indicate if the key is already in one of our interval16s. If key is alreadyPresent, then whichInterval16 tells you where. If key is not already present, then whichInterval16 is set as follows: a) whichInterval16 == len(rc.iv)-1 if key is beyond our last inter

(key int)

//
// runContainer16.search always returns whichInterval16 < len(rc.iv).
func (rc *runContainer16) search(key int) (whichInterval16 int, alreadyPresent bool, numCompares int) {
	return rc.searchRange(key, 0, 0)
}

// getCardinality returns the count of the integers stored in the
// runContainer16. The running complexity depends on the size