An Ordered Map in Go
An ordered map (also called a linked hash map in Java) is a data structure that allows amortized O(1) for access and mutation just like a map, but the elements maintain their order.
For this I created the
github.com/elliotchance/orderedmap package. Here is some basic usage:
m := orderedmap.NewOrderedMap()// Keys and values can be any type.