binary_search

package

v0.0.0-...-6deb688 Latest Latest Go to latest Published: Nov 1, 2023 License: Apache-2.0 Imports: 1 Imported by: 0

Documentation ¶

This section is empty.

This section is empty.

This section is empty.

type Comparer[T cmp.Ordered] func(x, y T) int

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

func NewSymbolTable[K, V cmp.Ordered](comparer Comparer[K]) *SymbolTable[K, V]

func (st *SymbolTable[K, V]) Add(key K, value V)

func (st *SymbolTable[K, V]) Ceiling(key K) (K, bool)

func (st *SymbolTable[K, V]) Contains(key K) bool

func (st *SymbolTable[K, V]) Count() int

func (st *SymbolTable[K, V]) Empty() bool

func (st *SymbolTable[K, V]) Floor(key K) (K, bool)

func (st *SymbolTable[K, V]) Keys() []K

func (st *SymbolTable[K, V]) Max() (K, bool)

func (st *SymbolTable[K, V]) Min() (K, bool)

func (st *SymbolTable[K, V]) Range(low, high K) ([]K, bool)

func (st *SymbolTable[K, V]) Rank(key K) int

func (st *SymbolTable[K, V]) Remove(key K) bool

func (st *SymbolTable[K, V]) RemoveMax() bool

func (st *SymbolTable[K, V]) RemoveMin() bool

func (st *SymbolTable[K, V]) Select(index int) (K, bool)

func (st *SymbolTable[K, V]) TryGet(key K) (V, bool)