zhangyunhao116 / skipmap
skipmap is a high-performance, scalable concurrent sorted map based on skip-list. Up to 10x faster than sync.Map in the typical pattern.
☆202Updated 5 months ago
Alternatives and similar repositories for skipmap:
Users that are interested in skipmap are comparing it to the libraries listed below
- skipset is a high-performance, scalable concurrent sorted set based on skip-list. Up to 15x faster than sync.Map in the typical pattern.☆252Updated last year
- ⚡️ lock-free utilities in Go☆152Updated 9 months ago
- ☆116Updated last year
- ☆117Updated last year
- A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.☆217Updated last year
- A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist☆282Updated 2 years ago
- Zero-allocation type-safe pool for Go☆230Updated last year
- ☆220Updated 2 weeks ago
- high performance in-memory cache☆287Updated this week
- a thread-safe circular buffer (ring buffer) in Go, implemented io.ReaderWriter interface☆536Updated 2 months ago
- auto adjust your GOGC value☆223Updated 6 months ago
- A highly optimized double-ended queue☆189Updated last year
- Fast and easy-to-use skip list for Go.☆397Updated 4 months ago
- A fast, threadsafe skip list in Go☆265Updated 3 years ago
- Fastest pseudo-random number generator in Go. About 2x ~ 200x faster than math/rand.☆32Updated 8 months ago
- Adaptive Radix Trees implemented in Go☆383Updated 2 months ago
- Pattern-defeating quicksort in Go with generics(need Go1.18). About 2x ~ 60x faster than the built-in sort package.☆115Updated 2 years ago
- Server for benchmarking pure Go key/value databases☆155Updated last year
- Write ahead log for Go.☆636Updated 3 months ago
- Simple building blocks for protobuf marshaling and unmarshaling☆167Updated 8 months ago
- A Golang package for doing a deep copy for (just about) anything☆146Updated 11 months ago
- errgroup with goroutine worker limits☆162Updated 2 years ago
- Go port of Google's Swiss Table hash table☆389Updated 7 months ago
- Write Ahead Log for LSM or bitcask storage(or any append-only write).☆254Updated 3 weeks ago
- A simple and efficient thread-safe sharded hashmap for Go☆225Updated 5 years ago
- 🧪 A chunk of experiments and demos about Go 2 generics design (type parameter & type set)☆150Updated 2 years ago
- Patch all Go functions for testing☆254Updated last year
- Go concurrent-safe, goroutine-safe, thread-safe queue☆414Updated last year
- An ordered collection implemented in Golang with O(log(N)) time complexity on adding / searching / removing☆156Updated last year
- Fastest and most efficient goroutine pool (experimental)☆137Updated 2 years ago