go/src/cmd/compile/internal/ssa/biasedsparsemap.go

type biasedSparseMap …

// newBiasedSparseMap returns a new biasedSparseMap for values between first and last, inclusive.
func newBiasedSparseMap(first, last int) *biasedSparseMap { … }

// cap returns one more than the largest key valid for s
func (s *biasedSparseMap) cap() int { … }

// size returns the number of entries stored in s
func (s *biasedSparseMap) size() int { … }

// contains reports whether x is a key in s
func (s *biasedSparseMap) contains(x uint) bool { … }

// get returns the value s maps for key x, or -1 if
// x is not mapped or is out of range for s.
func (s *biasedSparseMap) get(x uint) int32 { … }

// getEntry returns the i'th key and value stored in s,
// where 0 <= i < s.size()
func (s *biasedSparseMap) getEntry(i int) (x uint, v int32) { … }

// add inserts x->0 into s, provided that x is in the range of keys stored in s.
func (s *biasedSparseMap) add(x uint) { … }

// add inserts x->v into s, provided that x is in the range of keys stored in s.
func (s *biasedSparseMap) set(x uint, v int32) { … }

// remove removes key x from s.
func (s *biasedSparseMap) remove(x uint) { … }

func (s *biasedSparseMap) clear() { … }