puzpuzpuz/xsync
Concurrent data structures for Go observed · 2026-08-28
Health v2 · maintenance only
85/100
- Activity 91
- Release rhythm 68
- Longevity 100
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: 38.0
- age_days: 1916
- days_rel: 137
- days_push: 56
- n_releases_24m: 9
Adoption not part of the score
1719 stars · 73 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded
xsync is a Go library providing scalable concurrent data structures such as a concurrent hash table map, striped counter, and other synchronization primitives. It offers drop-in alternatives to the standard sync package with better performance under high contention.
Use cases
- replace sync.Map with a faster concurrent map in Go
- implement high-contention counters in Go
- build caching layers with concurrent hash tables
- reduce lock contention in multicore Go services
- store and load key-value pairs concurrently without mutexes
When to choose
- your Go application has heavy contention on sync.Map or atomic counters
- you need a performant concurrent map with generics support
- you want benchmarked, stress-tested concurrent primitives
When to avoid
- your workload has low contention where standard sync primitives suffice
- you need data structures for languages other than Go
- you require minimal dependencies and cannot take on a library
Facets
library · maturity stable
concurrency caching developer-tools developer-tools performance go cross-platform concurrent-data-structures concurrent-map sync high-performance striped-counter golang algorithms
1 source
- readme: https://github.com/puzpuzpuz/xsync · fetched 2026-08-28 · 78f82818130e
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| puzpuzpuz/xsync | main | 85 |
For agents
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem