MauriceGit / skiplistLinks
A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist
☆286Updated 2 years ago
Alternatives and similar repositories for skiplist
Users that are interested in skiplist are comparing it to the libraries listed below
Sorting:
- ⚡️ lock-free utilities in Go☆158Updated last year
- A fast, threadsafe skip list in Go☆267Updated 3 years ago
- Fast and easy-to-use skip list for Go.☆417Updated 9 months ago
- A Go package providing a filesystem-backed FIFO queue☆487Updated last year
- errgroup with goroutine worker limits☆165Updated 2 years ago
- Golang implementation of Sliding Window Algorithm for distributed rate limiting.☆403Updated last year
- Fast and scalable pseudorandom generator for Go☆206Updated 3 years ago
- A simple and efficient thread-safe sharded hashmap for Go☆228Updated 5 years ago
- Go Pooling Helpers☆116Updated 5 years ago
- A highly optimized double-ended queue☆200Updated last year
- an off-heap hash-table in Go. Used to be called go-offheap-hashtable, but we shortened it.☆375Updated last month
- Fast, zero heap allocation Go Trie for runes or paths☆494Updated 9 months ago
- A quick tour (or reminder) of Go performance tools☆270Updated 3 years ago
- TinyLFU cache admission policy☆264Updated 5 months ago
- High resolution timing and benchmarking for Go☆260Updated 4 years ago
- skipmap is a high-performance, scalable concurrent sorted map based on skip-list. Up to 10x faster than sync.Map in the typical pattern.☆211Updated 10 months ago
- a thread-safe circular buffer (ring buffer) in Go, implemented io.ReaderWriter interface☆581Updated 3 months ago
- A revamped Google's jump consistent hash☆106Updated 2 years ago
- Fast resizable golang semaphore primitive☆178Updated 4 years ago
- concurrency utilities☆301Updated 5 years ago
- A typed implementation of the Go sync.Map using code generation☆256Updated 2 years ago
- Go package porting the standard hashing algorithms to a more efficient implementation.☆293Updated last year
- An ordered collection implemented in Golang with O(log(N)) time complexity on adding / searching / removing☆157Updated 2 years ago
- Fast, fully fledged murmur3 in Go.☆337Updated 2 years ago
- Eventually consistent distributed in-memory cache Go library☆160Updated 2 years ago
- Server for benchmarking pure Go key/value databases☆161Updated last year
- Fast golang queue using ring-buffer☆629Updated 2 years ago
- Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go☆353Updated 6 years ago
- Adaptive Radix Trees implemented in Go☆392Updated 6 months ago
- Zero-allocation type-safe pool for Go☆235Updated 2 years ago