treap

Documentation

Index

• type Treap
  • func New[T constraints.Ordered]() *Treap[T]
  • func (t *Treap[T]) At(k uint) (T, error)
  • func (t *Treap[T]) Clear()
  • func (t *Treap[T]) Contains(value T) bool
  • func (t *Treap[T]) Delete(value T)
  • func (t *Treap[T]) Empty() bool
  • func (t *Treap[T]) Index(value T) uint
  • func (t *Treap[T]) Insert(value T)
  • func (t *Treap[T]) Predecessor(value T) (T, error)
  • func (t *Treap[T]) Size() uint
  • func (t *Treap[T]) Successor(value T) (T, error)

Types

type Treap

type Treap[T constraints.Ordered] struct {
	// contains filtered or unexported fields
}

func New

func New[T constraints.Ordered]() *Treap[T]

func (*Treap[T]) At

func (t *Treap[T]) At(k uint) (T, error)

func (*Treap[T]) Clear

func (t *Treap[T]) Clear()

func (*Treap[T]) Contains

func (t *Treap[T]) Contains(value T) bool

func (*Treap[T]) Delete

func (t *Treap[T]) Delete(value T)

func (*Treap[T]) Empty

func (t *Treap[T]) Empty() bool

func (*Treap[T]) Index

func (t *Treap[T]) Index(value T) uint

func (*Treap[T]) Insert

func (t *Treap[T]) Insert(value T)

func (*Treap[T]) Predecessor

func (t *Treap[T]) Predecessor(value T) (T, error)

func (*Treap[T]) Size

func (t *Treap[T]) Size() uint

func (*Treap[T]) Successor

func (t *Treap[T]) Successor(value T) (T, error)