skiplist

type SkipList ¶

type SkipList[K any, V any] struct {
	MaxLevel int
	// contains filtered or unexported fields
}

A SkipList maintains an ordered collection of key:valkue pairs. It support insertion, lookup, and deletion operations with O(log n) time complexity Paper: Pugh, William (June 1990). "Skip lists: a probabilistic alternative to balanced trees". Communications of the ACM 33 (6): 668–676

func New[K any, V any](compare cmp.LessFunc[K]) *SkipList[K, V]

func (s *SkipList[K, V]) Del(k K) (v V, ok bool)

func (s *SkipList[K, V]) Get(k K) (v V, ok bool)

func (s *SkipList[K, V]) Len() int

func (s *SkipList[K, V]) Range(from, to K, op func(v V))

func (s *SkipList[K, V]) Search(k K) (ok bool)

func (s *SkipList[K, V]) Set(k K, v V)