coder/coderd/util/maps/maps.go

package maps

import (
	"sort"

	"golang.org/x/exp/constraints"
)

func Map[K comparable, F any, T any](params map[K]F, convert func(F) T) map[K]T {
	into := make(map[K]T)
	for k, item := range params {
		into[k] = convert(item)
	}
	return into
}

// Subset returns true if all the keys of a are present
// in b and have the same values.
// If the corresponding value of a[k] is the zero value in
// b, Subset will skip comparing that value.
// This allows checking for the presence of map keys.
func Subset[T, U comparable](a, b map[T]U) bool {
	var uz U
	for ka, va := range a {
		ignoreZeroValue := va == uz
		if vb, ok := b[ka]; !ok || (!ignoreZeroValue && va != vb) {
			return false
		}
	}
	return true
}

// SortedKeys returns the keys of m in sorted order.
func SortedKeys[K constraints.Ordered, V any](m map[K]V) (keys []K) {
	for k := range m {
		keys = append(keys, k)
	}
	sort.Slice(keys, func(i, j int) bool { return keys[i] < keys[j] })
	return keys
}