Alternatives and similar repositories for art:

Users that are interested in art are comparing it to the libraries listed below

• dolthub / maphash
  ☆119Updated last year
• Michal-Leszczynski / btree
  BTree provides a simple, ordered, in-memory data structure for Go programs.
  ☆45Updated 3 years ago
• gammazero / radixtree
  adaptive radix tree (a.k.a prefix tree or compact trie)
  ☆32Updated last month
• sensiblecodeio / faststringmap
  A fast (5x) string keyed read-only map for Go - particularly good for keys using a small set of nearby runes.
  ☆67Updated 9 months ago
• robaho / keydb
  high performance key value database written in Go. Deprecated. Use robaho/leveldb
  ☆86Updated 2 years ago
• Link512 / stealthpool
  Off heap golang memory pool
  ☆60Updated 3 years ago
• tidwall / spinlock
  A spinlock implementation for Go.
  ☆61Updated 4 years ago
• aarthikrao / wal
  Simple and efficient WAL implementation in Go 🚀
  ☆60Updated 11 months ago
• aneshas / gocask
  Go implementation of Bitcask - A Log-Structured Hash Table for Fast Key / Value Data
  ☆35Updated last year
• alphadose / itogami
  Fastest and most efficient goroutine pool (experimental)
  ☆140Updated 2 years ago
• tidwall / expr
  Expression evaluator for Go
  ☆72Updated last month
• godzie44 / go-uring
  The `io_uring` library and runtime for GO
  ☆128Updated this week
• kpango / fastime
  Blazing fast time function library for Go with zero memory allocation. fastime returns the approximate time.
  ☆54Updated 2 years ago
• regeda / expr
  Expr – a tiny stack-based virtual machine written in Go
  ☆31Updated 3 years ago
• panmari / cuckoofilter
  Optimized implementation of Cuckoo Filter: Practically Better Than Bloom.
  ☆46Updated 2 months ago
• andy-kimball / arenaskl
  Fast, lock-free, arena-based Skiplist implementation in Go that supports iteration in both directions.
  ☆40Updated 4 years ago
• dustinxie / lockfree
  Golang lock-free Hashmap and List
  ☆71Updated 2 years ago
• tidwall / rhh
  A simple and efficient hashmap package for Go. Uses open addressing, Robin Hood hashing, and xxhash algorithm.
  ☆80Updated 3 years ago
• GavinClarke0 / lockless-generic-ring-buffer
  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…
  ☆160Updated last year
• pawelgaczynski / giouring
  Go programming language port of liburing.
  ☆102Updated last year
• ii64 / gouring
  Go io uring syscall implementation without CGO, rewrite on branch v0.4
  ☆114Updated 2 years ago
• inelpandzic / imdgo
  A simple In-Memory Data Grid in Go
  ☆72Updated 3 years ago
• sahib / timeq
  A fast file-based priority queue
  ☆58Updated last year
• ajwerner / btree
  go2 generics experiment in building generic augmented BTree data structures
  ☆24Updated 3 years ago
• dshulyak / uring
  Golang library for io_uring (without CGO)
  ☆133Updated 4 years ago
• s0rg / quadtree
  Generic, zero-alloc, 100%-test covered Quadtree for golang
  ☆37Updated last week
• lukechampine / noescape
  Promise to the Go compiler that your Reads and Writes are well-behaved
  ☆57Updated 5 years ago
• tidwall / hashmap
  A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.
  ☆218Updated 2 years ago
• tidwall / box
  Efficiently box values in Go. Optimized for primitives, strings, and byte slices.
  ☆70Updated 2 years ago
• greatroar / blobloom
  Extremely fast Bloom filters for Go
  ☆48Updated 7 months ago