go-datastructures

Structures like MPMC queues and Ctrie are designed for safe concurrent access, solving common Go patterns without channel limitations, as noted in the Futures and Queue package descriptions.

Includes rare implementations like augmented trees for n-dimensional collision detection and Fibonacci heaps with cheap decrease-key ops, filling gaps in Go's ecosystem for graph algorithms.

Benchmarks show multithreaded bucket sort can be 3x faster than native Go sort, and bitarrays provide space-efficient existence checks without hashing overhead.

Offers a wide range from persistent tries to concurrent hash maps, reducing the need to integrate multiple libraries for different data structure needs in production.