wangjia184 / sortedsetLinks
An ordered collection implemented in Golang with O(log(N)) time complexity on adding / searching / removing
☆161Updated 2 years ago
Alternatives and similar repositories for sortedset
Users that are interested in sortedset are comparing it to the libraries listed below
Sorting:
- Fast and scalable pseudorandom generator for Go☆207Updated 4 years ago
- ⚡️ lock-free utilities in Go☆163Updated last year
- A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist☆294Updated 2 years ago
- A typed implementation of the Go sync.Map using code generation☆257Updated 2 years ago
- A simple and efficient thread-safe sharded hashmap for Go☆246Updated 6 years ago
- errgroup with goroutine worker limits☆165Updated 2 years ago
- concurrency utilities☆304Updated 6 years ago
- Storing strings without GC overhead☆84Updated 3 weeks ago
- Examples of using github.com/gobwas/ws☆221Updated 4 years ago
- A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.☆221Updated 2 years ago
- Fast resizable golang semaphore primitive☆177Updated 4 years ago
- Go package porting the standard hashing algorithms to a more efficient implementation.☆294Updated last year
- A highly optimized double-ended queue☆202Updated 2 years ago
- Golang implementation of Sliding Window Algorithm for distributed rate limiting.☆408Updated last year
- Go Pooling Helpers☆119Updated 5 years ago
- A fast little LRU cache for Go☆174Updated 2 years ago
- a thread-safe circular buffer (ring buffer) in Go, implemented io.ReaderWriter interface☆613Updated 9 months ago
- Eventually consistent distributed in-memory cache Go library☆162Updated 2 years ago
- Fast and easy-to-use skip list for Go.☆429Updated last year
- Fastest and most efficient goroutine pool (experimental)☆140Updated 3 years ago
- Fast, fully fledged murmur3 in Go.☆347Updated 2 years ago
- High resolution timing and benchmarking for Go☆264Updated last month
- skipmap is a high-performance, scalable concurrent sorted map based on skip-list. Up to 10x faster than sync.Map in the typical pattern.☆222Updated last year
- A fast, threadsafe skip list in Go☆270Updated 4 years ago
- A Golang package for doing a deep copy for (just about) anything☆148Updated last year
- Zero-allocation type-safe pool for Go☆251Updated 2 years ago
- Generic and fast binary serializer for Go☆247Updated last year
- skipset is a high-performance, scalable concurrent sorted set based on skip-list. Up to 15x faster than sync.Map in the typical pattern.☆264Updated 2 years ago
- ☆123Updated 2 years ago
- Package schedgroup provides a goroutine worker pool which schedules tasks to be performed at or after a specified time. MIT Licensed.☆139Updated 3 years ago