Documentation
¶
Index ¶
- func MapValues[K comparable, V any](m Map[K, V]) []V
- type Map
- 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
- type Set
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func MapValues ¶ added in v1.10.14
func MapValues[K comparable, V any](m Map[K, V]) []V
Types ¶
type Map ¶ added in v1.10.14
type Map[K comparable, V any] struct { // contains filtered or unexported fields }
func NewMap ¶ added in v1.10.14
func NewMap[K comparable, V any](less func(a, b V) bool) Map[K, V]
NewMap returns a heap without duplicates ordered by its values
type Queue ¶
type Queue[T any] struct { // contains filtered or unexported fields }
type Set ¶ added in v1.10.14
type Set[T comparable] struct { // contains filtered or unexported fields }
func NewSet ¶ added in v1.10.14
func NewSet[T comparable](less func(a, b T) bool) Set[T]
NewSet returns a heap without duplicates ordered by its values
Source Files
Click to show internal directories.
Click to hide internal directories.