disksing / iterLinks
Go implementation of C++ STL iterators and algorithms.
☆194Updated 3 years ago
Alternatives and similar repositories for iter
Users that are interested in iter are comparing it to the libraries listed below
Sorting:
- A simple and efficient thread-safe sharded hashmap for Go☆246Updated 6 years ago
- A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist☆291Updated 2 years ago
- A fast little LRU cache for Go☆174Updated 2 years ago
- A fast, threadsafe skip list in Go☆270Updated 4 years ago
- ⚡️ lock-free utilities in Go☆162Updated last year
- A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.☆221Updated 2 years ago
- Server for benchmarking pure Go key/value databases☆162Updated 2 years ago
- Load file-backed memory☆122Updated 3 years ago
- 🧪 A chunk of experiments and demos about Go 2 generics design (type parameter & type set)☆152Updated 3 years ago
- Fast and easy-to-use skip list for Go.☆426Updated last year
- An easy-to-use Map Reduce Go parallel-computing framework inspired by 2021 6.824 lab1. It supports multiple workers threads on a single m…☆225Updated 2 years ago
- Single producer and multi-reader lockless ring buffer in go using generics from the go 1.18.x release. It is significantly faster than ch…☆163Updated 2 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.☆222Updated last year
- Get unix time (nanoseconds) in 8ns, 10x faster than stdlib☆141Updated 6 months ago
- skipset is a high-performance, scalable concurrent sorted set based on skip-list. Up to 15x faster than sync.Map in the typical pattern.☆263Updated 2 years ago
- ☆123Updated 2 years ago
- A highly optimized double-ended queue☆202Updated 2 years ago
- high performance key value database written in Go. Deprecated. Use robaho/leveldb☆87Updated 3 years ago
- A typed implementation of the Go sync.Map using code generation☆257Updated 2 years ago
- Adaptive Radix Trees implemented in Go☆406Updated 11 months ago
- An ordered collection implemented in Golang with O(log(N)) time complexity on adding / searching / removing☆161Updated 2 years ago
- Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci☆101Updated 3 years ago
- B-tree implementation for Go☆239Updated 3 years ago
- Golang library for io_uring (without CGO)☆132Updated 4 years ago
- Pattern-defeating quicksort in Go with generics(need Go1.18). About 2x ~ 60x faster than the built-in sort package.☆118Updated 2 years ago
- Off heap golang memory pool☆60Updated 4 years ago
- High resolution timing and benchmarking for Go☆264Updated this week
- The assembler from the Go compiler, in library form.☆195Updated 4 years ago
- Miscellaneous Go hacks☆242Updated last week
- cpuworker - A Customized Goroutine Scheduler over Golang Runtime☆170Updated 3 years ago