elliotchance/orderedmap

Health v2 · maintenance only

Adoption not part of the score

1026 stars · 77 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded

A Go library providing an ordered map data structure that maintains insertion order with amortized O(1) Set, Get, Delete, and Len operations. It combines a native Go map with a linked list and supports Go 1.23 iterators for bidirectional traversal.

Use cases

• maintain insertion order of map keys in Go
• iterate a map in the order items were added
• get O(1) ordered map operations in Go
• convert an ordered map to a slice of keys or values
• reverse-iterate a map from newest to oldest entries

When to choose

• you need a Go map that preserves insertion order with high performance
• you want Go 1.23 range-over-func iterator support
• you need generics support with simple Set/Get/Delete semantics

When to avoid

• you only need an unordered map - use the built-in Go map
• you need concurrency-safe ordered maps without external locking
• you're on Go versions older than 1.17

Facets

library · maturity stable

data-science developer-tools developer-tools go ordered-map data-structures generics linked-list insertion-order algorithms

Member repositories

For agents

markdown · JSON · MCP: product_card(name="elliotchance/orderedmap")