Golang Ordered Maps
.
Same as regular maps, but also remembers the order in which keys were
inserted, akin to Python's collections.OrderedDicts:
https://docs.python.org/3.7/library/collections.html#ordereddict-objects
.
It offers the following features:
.
* optimal runtime performance (all operations are constant time)
* optimal memory usage (only one copy of values, no unnecessary memory
allocation)
* allows iterating from newest or oldest keys indifferently, without
memory copy, allowing to break the iteration, and in time linear to the
number of keys iterated over rather than the total length of the
ordered map
* supports any generic types for both keys and values. If you're
running go < 1.18, you can use version 1 (https://github.com/wk8/go-
ordered-map/tree/v1) that takes and returns generic interface{}s instead
of using generics
* idiomatic API, akin to that of container/list
(https://golang.org/pkg/container/list)
* support for JSON and YAML marshalling
.
Documentation
.
The full documentation is available on pkg.go.dev:
https://pkg.go.dev/github.com/wk8/go-ordered-map/v2
Installed Size: 79.9 kB
Architectures: all