maps

package module

v0.0.6 Latest Latest Go to latest Published: Oct 3, 2022 License: MIT Imports: 1 Imported by: 1

Details

In current form the lib is incredibly small. I may build it up over time.

If you need a sorted map and require performance, consider a btree.

MIT

This section is empty.

This section is empty.

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

func SortKeys[K Ordered, V any](m map[K]V) []K

SortKeys sorts the keys of a map.

type KeyValue[K Ordered, V any] struct {
	Key   K
	Value V
}

KeyValue is a Key Value pair.

type KeyValues[K Ordered, V any] []KeyValue[K, V]

func SortByKeys[K Ordered, V any](m map[K]V) KeyValues[K, V]

Sort sorts a map by key, returning a slice of KV structs.

type Ordered interface {
	~int | ~int8 | ~int16 | ~int32 | ~int64 | ~uint | ~uint8 | ~uint16 | ~uint32 | ~uint64 | ~float32 | ~float64 | ~string
}