container

package

v0.1.1 Latest Latest Go to latest Published: Oct 10, 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 PriorityMap[K comparable, V any, P Priority] struct {
	// contains filtered or unexported fields
}

PriorityMap provides a map with a built-in priority queue for trimming.

func NewPriorityMap[K comparable, V any, P Priority]() PriorityMap[K, V, P]

NewPriorityMap creates a new empty priority queue.

func (p *PriorityMap[K, V, P]) Delete(key K)

Delete an element from the map.

func (p *PriorityMap[K, V, P]) Find(cond func(V) bool) (V, bool)

Find a value in the map with a given condition.

func (p *PriorityMap[K, V, P]) Get(key K) (V, bool)

Get an element in the map by its key.

func (p *PriorityMap[K, V, P]) Len() int

Len returns the number of elements in the queue.

func (p *PriorityMap[K, V, P]) Next() (K, V, bool)

Next returns the next value in the map with the lowest priority.

func (p *PriorityMap[K, V, P]) Set(key K, val V, pri P)

Set an element in the map to the given value and priority.

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)