avl

Documentation

Index

• type TreeMap
  • func NewTreeMap[K cmp.Ordered, V comparable]() *TreeMap[K, V]
  • func (t *TreeMap[K, V]) Find(key *K) *K
  • func (t *TreeMap[K, V]) FindKeyValues(key *K) (*K, []*V)
  • func (t *TreeMap[K, V]) FindMax() *K
  • func (t *TreeMap[K, V]) FindMin() *K
  • func (t *TreeMap[K, V]) GetValues(key *K) []*V
  • func (t *TreeMap[K, V]) Put(key *K, value *V)
  • func (t *TreeMap[K, V]) Remove(key *K)
  • func (t *TreeMap[K, V]) RemoveMax()
  • func (t *TreeMap[K, V]) RemoveMin()
  • func (t *TreeMap[K, V]) RemoveValue(key *K, value *V)
  • func (t *TreeMap[K, V]) Replace(key *K, value *V)
  • func (t *TreeMap[K, V]) Size() uint
• type TreeSet
  • func NewTreeSet[K cmp.Ordered]() *TreeSet[K]
  • func (t *TreeSet[K]) Find(key *K) *K
  • func (t *TreeSet[K]) FindMax() *K
  • func (t *TreeSet[K]) FindMin() *K
  • func (t *TreeSet[K]) Put(key *K)
  • func (t *TreeSet[K]) Remove(key *K)
  • func (t *TreeSet[K]) RemoveMax()
  • func (t *TreeSet[K]) RemoveMin()
  • func (t *TreeSet[K]) Size() uint

Types

type TreeMap

type TreeMap[K cmp.Ordered, V comparable] struct {
	// contains filtered or unexported fields
}

func NewTreeMap

func NewTreeMap[K cmp.Ordered, V comparable]() *TreeMap[K, V]

func (*TreeMap[K, V]) Find

func (t *TreeMap[K, V]) Find(key *K) *K

func (*TreeMap[K, V]) FindKeyValues

func (t *TreeMap[K, V]) FindKeyValues(key *K) (*K, []*V)

func (*TreeMap[K, V]) FindMax

func (t *TreeMap[K, V]) FindMax() *K

func (*TreeMap[K, V]) FindMin

func (t *TreeMap[K, V]) FindMin() *K

func (*TreeMap[K, V]) GetValues

func (t *TreeMap[K, V]) GetValues(key *K) []*V

func (*TreeMap[K, V]) Put

func (t *TreeMap[K, V]) Put(key *K, value *V)

func (*TreeMap[K, V]) Remove

func (t *TreeMap[K, V]) Remove(key *K)

func (*TreeMap[K, V]) RemoveMax

func (t *TreeMap[K, V]) RemoveMax()

func (*TreeMap[K, V]) RemoveMin

func (t *TreeMap[K, V]) RemoveMin()

func (*TreeMap[K, V]) RemoveValue

func (t *TreeMap[K, V]) RemoveValue(key *K, value *V)

func (*TreeMap[K, V]) Replace

func (t *TreeMap[K, V]) Replace(key *K, value *V)

func (*TreeMap[K, V]) Size

func (t *TreeMap[K, V]) Size() uint

type TreeSet

type TreeSet[K cmp.Ordered] struct {
	// contains filtered or unexported fields
}

func NewTreeSet

func NewTreeSet[K cmp.Ordered]() *TreeSet[K]

func (*TreeSet[K]) Find

func (t *TreeSet[K]) Find(key *K) *K

func (*TreeSet[K]) FindMax

func (t *TreeSet[K]) FindMax() *K

func (*TreeSet[K]) FindMin

func (t *TreeSet[K]) FindMin() *K

func (*TreeSet[K]) Put

func (t *TreeSet[K]) Put(key *K)

func (*TreeSet[K]) Remove

func (t *TreeSet[K]) Remove(key *K)

func (*TreeSet[K]) RemoveMax

func (t *TreeSet[K]) RemoveMax()

func (*TreeSet[K]) RemoveMin

func (t *TreeSet[K]) RemoveMin()

func (*TreeSet[K]) Size

func (t *TreeSet[K]) Size() uint