skiplist

Documentation

Index

• Constants
• type Node
• type Skiplist
  • func New[A any](prob float64, maxLevels int, fastRandom bool) *Skiplist[A]
  • func (list *Skiplist[A]) Contains(val A) bool
  • func (list *Skiplist[A]) Find(val A, prev, next []*Node[A]) (foundLevel int)
  • func (list *Skiplist[A]) Get(val A) maybe.Maybe[A]
  • func (list *Skiplist[A]) Height() int
  • func (list *Skiplist[A]) Insert(v A) bool
  • func (list *Skiplist[A]) Len() int
  • func (list *Skiplist[A]) Remove(val A) bool
  • func (list *Skiplist[A]) ToSortedArray() []A

Constants

const MinProb = 0.01

MinProb Minimum probability of bernoulli trial success for random function

const SkiplistMaxLevel = 30

SkiplistMaxLevel maximum levels allocated for each Skiplist next pointer arrays are of constant size

Types

type Node

type Node[A any] struct {
	// contains filtered or unexported fields
}

type Skiplist

type Skiplist[A any] struct {
	// contains filtered or unexported fields
}

* Skiplist : The Skiplist structure, must be initialised before use.

func New

func New[A any](prob float64, maxLevels int, fastRandom bool) *Skiplist[A]

func (*Skiplist[A]) Contains

func (list *Skiplist[A]) Contains(val A) bool

func (*Skiplist[A]) Find

func (list *Skiplist[A]) Find(val A, prev, next []*Node[A]) (foundLevel int)

func (*Skiplist[A]) Get

func (list *Skiplist[A]) Get(val A) maybe.Maybe[A]

func (*Skiplist[A]) Height

func (list *Skiplist[A]) Height() int

func (*Skiplist[A]) Insert

func (list *Skiplist[A]) Insert(v A) bool

func (*Skiplist[A]) Len

func (list *Skiplist[A]) Len() int

func (*Skiplist[A]) Remove

func (list *Skiplist[A]) Remove(val A) bool

func (*Skiplist[A]) ToSortedArray

func (list *Skiplist[A]) ToSortedArray() []A