heap

Dec 11, 2023

Changes in this version

+ func MapValues[K comparable, V any](m Map[K, V]) []V

+ type Map struct

+ func NewMap[K comparable, V any](less func(a, b V) bool) Map[K, V]

+ func (m *Map[K, V]) Contains(k K) bool

+ func (m *Map[K, V]) Fix(k K)

+ func (m *Map[K, V]) Get(k K) (V, bool)

+ func (m *Map[K, V]) Len() int

+ func (m *Map[K, V]) Peek() (K, V, bool)

+ func (m *Map[K, V]) Pop() (K, V, bool)

+ func (m *Map[K, V]) Push(k K, v V) (V, bool)

+ func (m *Map[K, V]) Remove(k K) (V, bool)

+ type Queue struct

+ func NewQueue[T any](less func(a, b T) bool) Queue[T]

+ func QueueOf[T any](less func(a, b T) bool, entries ...T) Queue[T]

+ func (q *Queue[T]) Fix(i int)

+ func (q *Queue[T]) Len() int

+ func (q *Queue[T]) Peek() (T, bool)

+ func (q *Queue[T]) Pop() (T, bool)

+ func (q *Queue[T]) Push(t T)

+ type Set struct

+ func NewSet[T comparable](less func(a, b T) bool) Set[T]

+ func (s Set[T]) Contains(t T) bool

+ func (s Set[T]) Fix(t T)

+ func (s Set[T]) Len() int

+ func (s Set[T]) Peek() (T, bool)

+ func (s Set[T]) Pop() (T, bool)

+ func (s Set[T]) Push(t T) bool

+ func (s Set[T]) Remove(t T) bool