Workiva/go-datastructures

Health v2 · maintenance only

Adoption not part of the score

7954 stars · 841 forks observed · 2026-08-28

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

A collection of useful, performant, and threadsafe data structures for Go, including augmented interval trees, bitarrays, futures, non-blocking queues, an MPMC ring buffer, and a Fibonacci heap. It emphasizes lock-free/CAS-based concurrency and benchmarks against standard alternatives like channels.

Use cases

• threadsafe queue for goroutines in go
• fast priority queue implementation in Go
• interval tree for n-dimensional range collision queries
• broadcast an event to multiple listeners instead of a single channel consumer
• lock-free MPMC ring buffer to synchronize and shut down goroutines
• bitarray membership and intersection testing with uint64 identifiers
• heap with cheap decrease-key for Dijkstra or Prim algorithms

When to choose

• You need concurrent, non-blocking queues that can outperform Go channels and never panic on send
• You need interval or range intersection queries in one or more dimensions
• You need to notify many goroutines of the same event, which channels handle poorly
• You need a Fibonacci or priority heap for graph algorithms or ordered scheduling

When to avoid

• You only need basic slices and maps already provided by the Go standard library
• You need bounded queues with backpressure, since these queues never block on send and grow unbounded
• You want generics-based, idiomatic modern Go APIs, as this library predates generics and relies on interfaces and uint64 identifiers

Facets

library · maturity active

concurrency developer-tools go data-structures priority-queue fibonacci-heap interval-tree bitarray ring-buffer futures threadsafe lock-free algorithms

Member repositories

For agents

markdown · JSON · MCP: product_card(name="Workiva/go-datastructures")