Method BitDels

structure/bitmap_1.go:279–311

BitDels delete a group of bits at the specified offsets in the bitmap If the key does not exist, it returns an error There is room for optimization

(key string, offsets ...uint)

// If the key does not exist, it returns an error
// There is room for optimization
func (b *BitMapStructure) BitDels(key string, offsets ...uint) error {
	// Check the parameters
	if len(offsets) == 0 {
		return ErrInvalidValue
	}

	bitmap, length, err := b.getBitmapFromDB(key, false)
	if err != nil {
		return err
	}

	sort.Slice(offsets, func(i, j int) bool {
		return offsets[i] < offsets[j]
	})

	// Number of deletions so far
	cntDel := uint(0)
	// Current offset to delete
	offsetIndex := 0

	length -= uint(len(offsets))
	for i := uint(0); i < length; i++ {
		if offsetIndex < len(offsets) && i+cntDel == offsets[offsetIndex] {
			cntDel++
			offsetIndex++
			i--
			continue
		}
		b.setBit(bitmap, i, b.getBit(bitmap, i+cntDel))
	}

	return b.setBitmapToDB(key, bitmap, length)
}

var (
	// ErrListEmpty is returned if the list is empty.