skipmap

package

v0.0.0-...-bed99cc Latest Latest Go to latest Published: Jul 14, 2025 License: MIT Imports: 3 Imported by: 0

Details

View Source

const (
	DefaultMaxLevel    = 32
	DefaultProbability = 0.5
)

This section is empty.

This section is empty.

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

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

func New[K cmp.Ordered, V any]() *SkipMap[K, V]

func NewWithComparator[K any, V any](comparator func(a, b K) int) *SkipMap[K, V]

func (s *SkipMap[K, V]) Get(key K) (V, bool)

func (s *SkipMap[K, V]) IsEmpty() bool

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

func (s *SkipMap[K, V]) Max() (K, V, bool)

func (s *SkipMap[K, V]) Min() (K, V, bool)

func (s *SkipMap[K, V]) Put(key K, value V)

func (s *SkipMap[K, V]) Range(start, end K) []V

func (s *SkipMap[K, V]) RangeFunc(start, end K, f func(key K, value V) bool)

RangeFunc iterates over the elements in the range [start, end] and calls f for each key-value pair. If f returns false, iteration stops.

func (s *SkipMap[K, V]) Remove(key K) bool