cockroachdb / swissLinks
Go port of Google's Swiss Table hash table
☆439Updated 3 weeks ago
Alternatives and similar repositories for swiss
Users that are interested in swiss are comparing it to the libraries listed below
Sorting:
- Golang port of Abseil's SwissTable☆827Updated 4 months ago
- ☆242Updated last week
- Concurrency toolkit for Go☆215Updated 11 months ago
- Gain is a high-performance io_uring networking framework written entirely in Go.☆544Updated last year
- Zero-allocation type-safe pool for Go☆235Updated 2 years ago
- A parsing/linking engine for protobuf; the guts for a pure Go replacement of protoc.☆277Updated 2 weeks ago
- Golang rate limiters for distributed applications☆571Updated 2 weeks ago
- high performance in-memory cache☆335Updated last week
- A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.☆218Updated 2 years ago
- Write ahead log for Go.☆667Updated 8 months ago
- Simple dense bitmap index in Go with binary operators☆343Updated 2 weeks ago
- Experimental implementation of a proposed v2 encoding/json package☆518Updated last week
- ⚡ A memory arena implementation for Go.☆540Updated last year
- A high-performance, thread-safe generic concurrent hash map implementation with Swiss Map.☆245Updated 7 months ago
- Fastest and most memory efficient golang concurrent hashmap☆1,003Updated 8 months ago
- ☆121Updated 2 years ago
- Simple building blocks for protobuf marshaling and unmarshaling☆196Updated last year
- Zero-allocation reflection library for Go☆576Updated last year
- Concurrent data structures for Go☆1,415Updated last week
- Low-level Go Client for ClickHouse☆356Updated this week
- Make your Go programs use less memory (maybe)☆828Updated last month
- Sonic is a Go library for network and I/O programming that provides developers with a consistent asynchronous model, with a focus on achi…☆737Updated 4 months ago
- An alternative to stack traces for your Go errors☆771Updated 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.☆212Updated 10 months ago
- B-tree implementation for Go☆239Updated 3 years ago
- High Availability Raft Framework for Go☆637Updated 3 months ago
- XXH3 algorithm in Go☆459Updated 4 months ago
- A Protocol Buffers compiler that generates optimized marshaling & unmarshaling Go code for ProtoBuf APIv2☆987Updated 4 months ago
- 🔍 Go binary size SVG treemap☆577Updated 9 months ago
- Fast, zero heap allocation Go Trie for runes or paths☆494Updated 9 months ago