bit_set.go

// Copyright (C) 2019-2021, Ava Labs, Inc. All rights reserved.
// See the file LICENSE for licensing terms.

package ids

import (
	"fmt"
	"math/bits"
)

// BitSet is a set that can contain uints in the range [0, 64). All functions
// are O(1). The zero value is the empty set.
type BitSet uint64

// Add [i] to the set of ints
func (bs *BitSet) Add(i uint) { *bs |= 1 << i }

// Union adds all the elements in [s] to this set
func (bs *BitSet) Union(s BitSet) { *bs |= s }

// Intersection takes the intersection of [s] with this set
func (bs *BitSet) Intersection(s BitSet) { *bs &= s }

// Difference removes all the elements in [s] from this set
func (bs *BitSet) Difference(s BitSet) { *bs &^= s }

// Remove [i] from the set of ints
func (bs *BitSet) Remove(i uint) { *bs &^= 1 << i }

// Clear removes all elements from this set
func (bs *BitSet) Clear() { *bs = 0 }

// Contains returns true if [i] was previously added to this set
func (bs BitSet) Contains(i uint) bool { return bs&(1<<i) != 0 }

// Len returns the number of elements in this set
func (bs BitSet) Len() int { return bits.OnesCount64(uint64(bs)) }

func (bs BitSet) String() string { return fmt.Sprintf("%016x", uint64(bs)) }