zyedidia/generic
A collection of generic data structures written in Go. observed · 2026-08-28
Health v2 · maintenance only
23/100
- Activity 0
- Release rhythm 8
- Longevity 100
How is this computed?
round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10) — computed 2026-09-02. Adoption (stars, forks) is never an input.
- gap_med: n/a
- age_days: 1722
- days_rel: n/a
- days_push: 969
- n_releases_24m: 0
Adoption not part of the score
1348 stars · 82 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded
A collection of generic data structures for Go 1.18+ built with type parameters, including trees, maps, sets, heaps, queues, ropes, and tries. Each structure lives in its own subpackage with documentation and examples.
Use cases
- use generic data structures in Go without writing my own
- need an AVL tree or B-tree with type parameters
- want an LRU cache implementation in Go
- need a bidirectional map or multimap
- looking for a rope or interval tree in Go
- need a hashmap that can be efficiently copied
When to choose
- you need common data structures with Go generics and minimal dependencies
- you want small, focused subpackages you can import individually
- you need structures like ropes, interval trees, or copy-on-write hashmaps not in the standard library
When to avoid
- you need concurrent/thread-safe data structures out of the box
- you need a batteries-included collections library with iterators and rich APIs
- you are not using Go 1.18 or later
Facets
library · maturity stable
developer-tools developer-tools go data-structures generics avl-tree btree hashmap rope trie lru-cache algorithms
1 source
- readme: https://github.com/zyedidia/generic · fetched 2026-08-28 · 0c9d231fadc5
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| zyedidia/generic | main | 23 |
For agents
markdown · JSON · MCP: product_card(name="zyedidia/generic")
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem