pq

type Item[S any, T Number] struct {
	Value    S // The Value of the item; arbitrary.
	Priority T // The Priority of the item in the queue.
	// The Index is needed by update and is maintained by the heap.Interface methods.
	Index int // The Index of the item in the heap.
}

type Number interface {
	constraints.Integer | constraints.Float
}

type PriorityQueue[S any, T Number] []*Item[S, T]

type SortableMap[S comparable, T Number] map[S]T