emirpasic/gods
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more observed · 2026-08-28
Health v2 · maintenance only
27/100
- Activity 10
- Release rhythm 8
- Longevity 100
Flags: no_license
How is this computed?
round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10) — computed 2026-09-03. Adoption (stars, forks) is never an input.
- gap_med: n/a
- age_days: 4200
- days_rel: n/a
- days_push: 540
- n_releases_24m: 0
Adoption not part of the score
17457 stars · 1824 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-29, confidence not recorded
GoDS is a Go library implementing a wide range of data structures including lists, sets, stacks, maps, trees, and queues, with iterators, comparators, sorting, and JSON serialization support. It is a pure-Go, dependency-free collection library.
Use cases
- implement data structures in go
- need a red-black tree or avl tree in golang
- sorted map or set for go
- priority queue implementation in go
- bidirectional map in golang
- stack and queue containers for go
When to choose
- you need common data structures (trees, sets, maps, heaps) in pure Go with no dependencies
- you want consistent container interfaces with iterators and sorting
When to avoid
- you need concurrent/thread-safe data structures
- you only need basic slices and maps already provided by Go's standard library
Facets
library · maturity stable
data-science go data-structures containers trees sets maps queues stacks iterators algorithms
1 source
- readme: https://github.com/emirpasic/gods · fetched 2026-08-28 · 2b80b1769c4d
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| emirpasic/gods | main | 27 |
For agents
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem