viant / ptrie
A prefix tree implementation in go
☆42Updated 11 months ago
Alternatives and similar repositories for ptrie:
Users that are interested in ptrie are comparing it to the libraries listed below
- Simple string pattern matcher for Go☆127Updated 11 months ago
- Expression evaluator for Go☆68Updated last year
- Storing strings without GC overhead☆82Updated 5 years ago
- Rolling window implementation in go.☆57Updated last month
- Fast Concurrent / Parallel Sorting in Go☆136Updated 10 months ago
- Lightweight, thread-safe, blocking FIFO queue based on auto-resizing circular buffer☆70Updated 4 years ago
- Helpers for making the use of reflection easier☆28Updated 8 months ago
- Load file-backed memory☆120Updated 2 years ago
- x/sync/singleflight but with Go 1.18 generics☆30Updated 2 years ago
- Off heap golang memory pool☆59Updated 3 years ago
- A simple and efficient hashmap package for Go. Uses open addressing, Robin Hood hashing, and xxhash algorithm.☆80Updated 3 years ago
- Static bit vector structures library☆72Updated 5 years ago
- ☆80Updated last month
- Promise to the Go compiler that your Reads and Writes are well-behaved☆57Updated 5 years ago
- Fast, dependable universally unique ids☆26Updated 3 months ago
- A JSON stream parser for Go☆67Updated 2 years ago
- GoLang extended synchronization primitives: Named mutex, non blocking mutex, semaphore.☆51Updated 8 years ago
- A fast userspace CSPRNG☆89Updated 5 months ago
- Package ring provides a high performance and thread safe Go implementation of a bloom filter.☆138Updated 4 years ago
- A pure Go implementation of the smaz compression library for short strings.☆80Updated 2 years ago
- Pure Go implementation of xxHash (32 and 64 bits versions)☆59Updated 4 years ago
- A simple cache meant to hold a small number of values☆30Updated 6 years ago
- a thread-safe concurrent map for go☆93Updated last year
- Connection pool for Go's net.Conn interface☆128Updated 2 years ago
- Package netpoll implements a network poller based on epoll/kqueue.☆55Updated last year
- BTree provides a simple, ordered, in-memory data structure for Go programs.☆45Updated 2 years ago
- A fast (5x) string keyed read-only map for Go - particularly good for keys using a small set of nearby runes.☆67Updated 7 months ago
- A buffer pool file I/O library for Go☆54Updated 3 years ago
- Enriches the standard go http client with retry functionality.☆51Updated 10 months ago
- Highly concurrent drop-in replacement for bufio.Writer☆56Updated 7 years ago