ubalgorithms

Jul 7, 2025

Changes in this version

+ type LRUCache struct

+ func NewLRUCache[K comparable, V any](capacity int) *LRUCache[K, V]

+ func (this *LRUCache[K, V]) Get(key K) (V, bool)

+ func (this *LRUCache[K, V]) Put(key K, value V)

+ func (this *LRUCache[K, V]) Remove(key K) bool

+ type PriorityQueue struct

+ func NewMaxCostPriorityQueue[T comparable](capacity int) *PriorityQueue[T]

+ func NewMinCostPriorityQueue[T comparable](capacity int) *PriorityQueue[T]

+ func (pq *PriorityQueue[T]) PopItem() T

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

+ func (q *PriorityQueue[T]) Less(i, j int) bool

+ func (q *PriorityQueue[T]) Peek() (*T, error)

+ func (q *PriorityQueue[T]) Pop() any

+ func (q *PriorityQueue[T]) Push(x any)

+ func (q *PriorityQueue[T]) PushItem(value T, priority int)

+ func (q *PriorityQueue[T]) String() string

+ func (q PriorityQueue[T]) Swap(i, j int)