grailbio / baseLinks
A collection of Go utility packages used by GRAIL's tools
☆95Updated last year
Alternatives and similar repositories for base
Users that are interested in base are comparing it to the libraries listed below
Sorting:
- fast int64-int64 map for go☆96Updated 2 years ago
- A simple and efficient hashmap package for Go. Uses open addressing, Robin Hood hashing, and xxhash algorithm.☆80Updated 3 years ago
- xxh3 fast hash function☆105Updated 6 years ago
- Best-effort CPU-local sharded values for Go☆201Updated 3 years ago
- Go wrapper for CRoaring☆46Updated 2 years ago
- MUS format serializer for Golang☆114Updated last month
- ☆122Updated 2 years ago
- A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.☆218Updated 2 years ago
- A prefix tree (trie) implementation in go☆37Updated 10 months ago
- Storing strings without GC overhead☆83Updated 5 years ago
- ☆43Updated 3 years ago
- cheap Go type to hold & operate on either a read-only []byte or string☆108Updated 11 months ago
- An Go library of synchronization primitives to help make use of hardware transactional memory (HTM)☆94Updated 2 years ago
- Load file-backed memory☆122Updated 2 years ago
- Miscellaneous Go hacks☆239Updated last month
- ☆97Updated 5 months ago
- ☆121Updated last year
- Optimized implementation of Cuckoo Filter: Practically Better Than Bloom.☆46Updated 3 months ago
- Probabilistic set data structure☆87Updated 7 years ago
- Fast integer map for uint32-to-uint32☆28Updated 2 weeks ago
- Expression evaluator for Go☆74Updated 2 months ago
- Intern Go strings☆95Updated last year
- cgosymbolizer teaches the Go runtime to include cgo frames in backtraces☆30Updated 3 years ago
- Promise to the Go compiler that your Reads and Writes are well-behaved☆58Updated 5 years ago
- A fast string sorting algorithm (MSD radix sort)☆193Updated 7 years ago
- Code for decoding and encoding runtime/trace files as well as useful functionality implemented on top.☆90Updated 9 months ago
- A minimal-memory AnchorHash (consistent-hash) implementation for Go☆76Updated 6 years ago
- A high performance memory-bound Go cache☆90Updated this week
- Efficiently box values in Go. Optimized for primitives, strings, and byte slices.☆70Updated 2 years ago
- Fastest levenshtein implementation in Go.☆132Updated 4 years ago