a lock-free radix tree implementation for golang
MIT License
An Adaptive Radix Tree (ART) implementation in Go
Surprisingly space efficient trie in Golang(11 bits/key; 100 ns/get).
adaptive radix tree (a.k.a prefix tree or compact trie)
Fast key-value DB in Go.
A simple and serializable radix tree implementation in Go/Golang.
Algorithms and Data Structures implemented in Go for beginners, following best practices.
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
Data Structures and Algorithms implementation in Go
Immutable collections for Go
Embedded go database
A Golang lock-free thread-safe HashMap optimized for fastest read access.
A collection of useful, performant, and threadsafe Go datastructures.
A collection of generic data structures written in Go.
This repo contains my notes on working with Go and computer systems.
A Golang implemented Redis Server and Cluster. Go 语言实现的 Redis 服务器和分布式集群