container

package

v0.1.0 Latest Latest Go to latest Published: Sep 7, 2024 License: MIT Imports: 2 Imported by: 0

Details

This section is empty.

This section is empty.

This section is empty.

type Priority interface{ int64 | float64 }

Priority defines the number types available to use as a priority value.

type PriorityQueue[T comparable, P Priority] struct {
	// contains filtered or unexported fields
}

PriorityQueue provides a generic priority queue implementation with a built-in index for removals. https://pkg.go.dev/container/heap#example-package-PriorityQueue

func NewPriorityQueue[T comparable, P Priority]() PriorityQueue[T, P]

NewPriorityQueue creates a new empty priority queue.

func (pq *PriorityQueue[T, P]) Len() int

Len returns the number of elements in the queue.

func (pq *PriorityQueue[T, P]) Peek() (T, bool)

Peek returns the top element from the queue without removing it.

func (pq *PriorityQueue[T, P]) Pop() (T, bool)

Pop pops an element from the queue.

func (pq *PriorityQueue[T, P]) Push(val T, pri P)

Push pushes an element into the queue.

func (pq *PriorityQueue[T, P]) Remove(val T) bool

Remove removes an arbitrary element from the queue.

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

Thread-safe generic map.

func NewSyncMap[K comparable, V any]() SyncMap[K, V]

func (s *SyncMap[K, V]) Delete(key K)

func (s *SyncMap[K, V]) Load(key K) (V, bool)

func (s *SyncMap[K, V]) Range(f func(k K, v V) bool)

func (s *SyncMap[K, V]) Store(key K, val V)