std

package

v0.0.6 Latest Latest Go to latest Published: Aug 30, 2025 License: MIT Imports: 3 Imported by: 0

Details

This section is empty.

This section is empty.

func CopyMap[K comparable, V any](m map[K]V) map[K]V

func FindMapElements[K comparable, V any](keys []K, m map[K]V) (res []V)

func FullMergeMaps(mapA map[string]any, mapB map[string]any) (res map[string]any)

func GetValues[K comparable, V any](m map[K]V) (res []V)

func MergeMapsOfArrays(mapA map[string]interface{}, mapB map[string]interface{}) (res map[string]interface{})

func MergeSlicesUnique[T string | int](ss ...[]T) (res []T)

func Min[T number](a T, b T) T

func RightMergeMaps[T comparable, V any](left map[T]V, right map[T]V) (res map[T]V)

type Item struct {
	Key          string
	LastModified time.Time
	Index        int // The index of the item in the heap.
}

type Pair[T, V any] struct {
	First  T
	Second V
}

func MapToPairs[T comparable, V any](m map[T]V) (res []Pair[T, V])

type PriorityQueue struct {
	// contains filtered or unexported fields
}

func NewPriorityQueue(itemCap int) PriorityQueue

func (pq PriorityQueue) Len() int

func (pq *PriorityQueue) Pop() interface{}

func (pq *PriorityQueue) Push(x interface{})