rangeset

type RangeEntry[T any] struct {
	Start T
	End   T
}

type RangeSet[T any] struct {
	// the merged ranges
	Ranges *btree.BTreeG[RangeEntry[T]]
	// a three-way comparison function like strcmp;
	// 0 for equality, -1 for v1 < v2, 1 for v1 > v2
	Compare func(v1, v2 T) int
	// a sentinel value indicating wrapping around from this value from the end to the start
	// if HasWrap is true and the final value is this, then any value sorting after it
	// is considered within the range
	RWrapV T
	// whether or not there is a "wraparound value" on the right side
	HasRWrap bool
	// contains filtered or unexported fields
}