jfcg / sortyLinks
Fast Concurrent / Parallel Sorting in Go
☆137Updated this week
Alternatives and similar repositories for sorty
Users that are interested in sorty are comparing it to the libraries listed below
Sorting:
- fast int64-int64 map for go☆98Updated 2 years ago
- 10x faster than crypto/rand. Uses securely allocated memory. Forked from https://gitlab.com/NebulousLabs/fastrand☆164Updated 4 years ago
- 🚧 Flexible mechanism to make execution flow interruptible.☆100Updated 4 years ago
- A simple thread-safe and fixed size LRU. Based on the Hashlru Algorithm☆71Updated 2 years ago
- Connection pool for Go's net.Conn interface☆127Updated 2 years ago
- Intern Go strings☆96Updated last year
- Static bit vector structures library☆72Updated 5 years ago
- A fast string sorting algorithm (MSD radix sort)☆193Updated 7 years ago
- A fast (5x) string keyed read-only map for Go - particularly good for keys using a small set of nearby runes.☆67Updated 11 months ago
- Generic and fast binary serializer for Go☆226Updated last year
- Useful Go String methods☆191Updated 2 years ago
- Expression evaluator for Go☆74Updated 3 months ago
- Storing strings without GC overhead☆83Updated 5 years ago
- Simple expression evaluation engine for Go☆72Updated 4 years ago
- Transform Go code into it's AST☆123Updated 5 years ago
- Fastest levenshtein implementation in Go.☆133Updated 4 years ago
- cheap Go type to hold & operate on either a read-only []byte or string☆109Updated last year
- Fastest and most efficient goroutine pool (experimental)☆140Updated 2 years ago
- Lightweight, thread-safe, blocking FIFO queue based on auto-resizing circular buffer☆70Updated 4 years ago
- Automatically sets up command line flags based on struct fields and tags.☆176Updated 2 years ago
- A spinlock implementation for Go.☆61Updated 4 years ago
- Debugging helper for Go☆66Updated 5 years ago
- Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.☆88Updated 4 years ago
- Simple string pattern matcher for Go☆127Updated last year
- A prefix tree implementation in go☆43Updated last year
- A simple and efficient hashmap package for Go. Uses open addressing, Robin Hood hashing, and xxhash algorithm.☆81Updated 3 years ago
- Bitset data structure☆163Updated 2 years ago
- Probabilistic set data structure☆87Updated 8 years ago
- This package helps to work with huge amount of data, which cannot be stored in RAM☆43Updated 2 years ago
- uint128 for Go☆248Updated 7 months ago