sparse_set

Documentation

Index

• type Range
  • func NewRange[V constraints.Integer](start, end V) *Range[V]
  • func (s *Range[V]) Contains(val V) bool
  • func (s *Range[V]) Valid() bool
• type Set
  • func (s *Set[V]) Insert(val V) bool
  • func (s *Set[V]) Remove(val V) bool

Types

type Range

type Range[V constraints.Integer] struct {
	Start, End V // inclusive
}

sparseRange is an internal structure for storing range details.

func NewRange

func NewRange[V constraints.Integer](start, end V) *Range[V]

func (*Range[V]) Contains

func (s *Range[V]) Contains(val V) bool

func (*Range[V]) Valid

func (s *Range[V]) Valid() bool

type Set

type Set[V constraints.Integer] []Range[V]

sparseSet is an ordered series of disjoint sparseRange items. overlapping ranges are coalesced.

func (*Set[V]) Insert

func (s *Set[V]) Insert(val V) bool

func (*Set[V]) Remove

func (s *Set[V]) Remove(val V) bool