Generic golang functions to do a unique sort of elements

sort.go

package sort

// SortedUniqueFunc returns a sorted list of unique elements extracted from the input slice using the provided getter function.
func SortedUniqueFunc[T any, E cmp.Ordered](ts []T, get func(T) E) []E {
	elems := make(map[E]struct{})
	for _, t := range ts {
		elem := get(t)
		elems[elem] = struct{}{}
	}
	return slices.Sorted(maps.Keys(elems))
}

// SortedUnique returns a sorted list of unique elements from the input slice.
func SortedUnique[T cmp.Ordered](ts []T) []T {
	return SortedUniqueFunc(ts, Identity)
}

// Identity is the identity function that returns the input as is.
// Can be used for the [SortedUniqueFunc] function when the input slice is of a comparable type.
// Inspired by haskell's id function.
func Identity[E any](e E) E {
	return e
}