bug fix on arraycontainer

arraycontainer.go

@@ -1100,10 +1100,25 @@ func (ac *arrayContainer) nextAbsentValue(target uint16) int {
 // Ex: target=5 ac=[1,2,3,4,6,7] returns 6
 // Ex: target=6 ac=[1,2,3,4,6,7] returns 6
 func (ac *arrayContainer) nextValue(target uint16) int {
+	cardinality := len(ac.content)
+	if cardinality == 0 {
+		return -1
+	}
+
+	if target < ac.minimum() {
+		return -1
+	}
+	if target > ac.maximum() {
+		return -1
+	}
+
 	result := binarySearchUntil(ac.content, target)
 	if result.exactMatch {
 		return int(result.value)
 	}
+	if result.outOfBounds() {
+		return -1
+	}
 
 	if result.index < len(ac.content)-1 {
 		return int(ac.content[result.index+1])

roaringarray.go

@@ -75,6 +75,7 @@ type container interface {
 	nextValue(x uint16) int
 	previousValue(x uint16) int
 	nextAbsentValue(x uint16) int
+	previousAbsentValue(x uint16) int
 }
 
 type contype uint8

runcontainer_test.go

@@ -2337,7 +2337,6 @@ func TestNextPreviousValue(t *testing.T) {
 	assert.Equal(t, 39, runContainer.previousValue(45))
 	assert.Equal(t, -1, runContainer.previousValue(80))
 
-	assert.Equal(t, 45, runContainer.nextAbsentValue(45))
 	assert.Equal(t, -1, runContainer.nextAbsentValue(0))
 	assert.Equal(t, -1, runContainer.nextAbsentValue(1))
 	assert.Equal(t, 10, runContainer.nextAbsentValue(5))