liyue201/gostl
Data structure and algorithm library for go, designed to provide functions similar to C++ STL observed · 2026-08-28
Health v2 · maintenance only
50/100
- Activity 39
- Release rhythm 35
- Longevity 100
Flags: no_releases
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: 2518
- days_rel: n/a
- days_push: 370
- n_releases_24m: 0
Adoption not part of the score
1138 stars · 115 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded
GoSTL is a data structure and algorithm library for Go that mirrors the C++ STL, providing containers like vector, deque, rbtree, skiplist, and bloom filter plus algorithms like sort and binary search. Most data structures support optional goroutine-safe operation via configuration.
Use cases
- use C++ STL-style containers in Go
- need a red-black tree or skiplist in Go
- goroutine-safe queue, stack, or deque
- consistent hashing with ketama in Go
- bloom filter or bitmap implementation
- sort and binary search with custom comparators
When to choose
- you miss STL-style containers and iterators when writing Go
- you need specialized structures like HAMT, skiplist, or rbtree with thread-safety options
When to avoid
- Go's built-in slices and maps already cover your needs
- you want a minimal dependency-free solution
Facets
library · maturity active
data-science developer-tools developer-tools go stl data-structures algorithms red-black-tree skiplist bloom-filter ketama goroutine-safe containers iterators
1 source
- readme: https://github.com/liyue201/gostl · fetched 2026-08-28 · e74ebf01d310
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| liyue201/gostl | main | 50 |
For agents
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem