package auth

// A Range represents a contiguous range of T.
//
// +stateify savable
type idMapRange struct {
	// Start is the inclusive start of the range.
	Start uint32

	// End is the exclusive end of the range.
	End uint32
}

// WellFormed returns true if r.Start <= r.End. All other methods on a Range
// require that the Range is well-formed.
func (r idMapRange) WellFormed() bool {
	return r.Start <= r.End
}

// Length returns the length of the range.
func (r idMapRange) Length() uint32 {
	return r.End - r.Start
}

// Contains returns true if r contains x.
func (r idMapRange) Contains(x uint32) bool {
	return r.Start <= x && x < r.End
}

// Overlaps returns true if r and r2 overlap.
func (r idMapRange) Overlaps(r2 idMapRange) bool {
	return r.Start < r2.End && r2.Start < r.End
}

// IsSupersetOf returns true if r is a superset of r2; that is, the range r2 is
// contained within r.
func (r idMapRange) IsSupersetOf(r2 idMapRange) bool {
	return r.Start <= r2.Start && r.End >= r2.End
}

// Intersect returns a range consisting of the intersection between r and r2.
// If r and r2 do not overlap, Intersect returns a range with unspecified
// bounds, but for which Length() == 0.
func (r idMapRange) Intersect(r2 idMapRange) idMapRange {
	if r.Start < r2.Start {
		r.Start = r2.Start
	}
	if r.End > r2.End {
		r.End = r2.End
	}
	if r.End < r.Start {
		r.End = r.Start
	}
	return r
}

// CanSplitAt returns true if it is legal to split a segment spanning the range
// r at x; that is, splitting at x would produce two ranges, both of which have
// non-zero length.
func (r idMapRange) CanSplitAt(x uint32) bool {
	return r.Contains(x) && r.Start < x
}