Method init

roaring.go:814–853

()

}

func (iui *unsetIterator) init() {
	// Check if we've gone past the end range
	if uint64(iui.nextKey)<<16 >= iui.end {
		iui.iter = nil
		return
	}

	// Check if we're in an empty container gap
	if iui.containerIndex >= iui.highlowcontainer.size() ||
		iui.highlowcontainer.getKeyAtIndex(iui.containerIndex) > uint16(iui.nextKey) {
		// We're in a gap - iterate through empty container
		iui.emptyContainerVal = 0
		// If this container overlaps with start, advance to start
		if uint64(iui.nextKey)<<16 < iui.start && iui.start < uint64(iui.nextKey+1)<<16 {
			iui.emptyContainerVal = uint16(iui.start)
		}
		iui.iter = nil
		return
	}

	// We're in an actual container
	iui.hs = uint32(iui.nextKey) << 16
	c := iui.highlowcontainer.getContainerAtIndex(iui.containerIndex)
	switch t := c.(type) {
	case *arrayContainer:
		iui.arrayUnsetIter = *newArrayContainerUnsetIterator(t.content)
		iui.iter = &iui.arrayUnsetIter
	case *runContainer16:
		iui.runUnsetIter = *t.newRunUnsetIterator16()
		iui.iter = &iui.runUnsetIter
	case *bitmapContainer:
		iui.bitmapUnsetIter = *newBitmapContainerUnsetIterator(t)
		iui.iter = &iui.bitmapUnsetIter
	}

	// If this container overlaps with start, advance to the low bits of start
	if uint64(iui.nextKey)<<16 < iui.start && iui.start < uint64(iui.nextKey+1)<<16 {
		iui.iter.advanceIfNeeded(uint16(iui.start))
	}
}

// Next returns the next integer
func (iui *unsetIterator) Next() uint32 {