Alternatives and similar repositories for art

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

• 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…
  ☆162Updated last year
• aarthikrao / wal
  Simple and efficient WAL implementation in Go 🚀
  ☆61Updated last year
• alphadose / itogami
  Fastest and most efficient goroutine pool (experimental)
  ☆139Updated 2 years ago
• cantabular / faststringmap
  A fast (5x) string keyed read-only map for Go - particularly good for keys using a small set of nearby runes.
  ☆67Updated last year
• kpango / fastime
  Blazing fast time function library for Go with zero memory allocation. fastime returns the approximate time.
  ☆54Updated last month
• inelpandzic / imdgo
  A simple In-Memory Data Grid in Go
  ☆76Updated 3 years ago
• dolthub / maphash
  ☆122Updated 2 years ago
• pawelgaczynski / giouring
  Go programming language port of liburing.
  ☆108Updated last year
• shaj13 / raft
  raft is a golang library that provides a simple, clean, and idiomatic implementation of the Raft consensus protocol
  ☆136Updated 3 months ago
• tidwall / spinlock
  A spinlock implementation for Go.
  ☆62Updated 4 years ago
• godzie44 / go-uring
  The `io_uring` library and runtime for GO
  ☆141Updated 3 months ago
• akutz / lem
  a golang test framework for asserting expected escape analysis results & heap allocations
  ☆71Updated 8 months ago
• ii64 / gouring
  Go io uring syscall implementation without CGO, rewrite on branch v0.4
  ☆116Updated 2 years ago
• iOliverNguyen / ujson
  µjson - A fast and minimal JSON parser and transformer that works on unstructured JSON
  ☆83Updated 7 months ago
• gammazero / radixtree
  adaptive radix tree (a.k.a prefix tree or compact trie)
  ☆33Updated 5 months ago
• wdamron / amt
  Hash Array Mapped Trie (HAMT) implemented in Go (1.18+ generics)
  ☆65Updated 3 years ago
• tidwall / box
  Efficiently box values in Go. Optimized for primitives, strings, and byte slices.
  ☆70Updated 2 years ago
• panmari / cuckoofilter
  Optimized implementation of Cuckoo Filter: Practically Better Than Bloom.
  ☆46Updated 5 months ago
• ksrichard / easyraft
  Easy to use Raft library to make your app distributed, highly available and fault-tolerant
  ☆74Updated 3 years ago
• Michal-Leszczynski / btree
  BTree provides a simple, ordered, in-memory data structure for Go programs.
  ☆45Updated 3 years ago
• tidwall / expr
  Expression evaluator for Go
  ☆77Updated 4 months ago
• tidwall / rhh
  A simple and efficient hashmap package for Go. Uses open addressing, Robin Hood hashing, and xxhash algorithm.
  ☆81Updated 3 years ago
• downflux / go-kd
  Golang k-D tree implementation with duplicate coordinate support
  ☆51Updated 2 years ago
• aneshas / gocask
  Go implementation of Bitcask - A Log-Structured Hash Table for Fast Key / Value Data
  ☆37Updated last year
• sonirico / parco
  🏇🏻 generalist, fast and tiny binary parser and compiler generator, powered by Go 1.18+ Generics
  ☆58Updated 2 years ago
• tidwall / mmap
  Load file-backed memory
  ☆122Updated 2 years ago
• rqlite / sql
  Pure Go SQL parser
  ☆163Updated last month
• Link512 / stealthpool
  Off heap golang memory pool
  ☆60Updated 4 years ago
• aarthikrao / timeMachine
  A distributed fault tolerant scheduler that is horizontally scalable 🔥
  ☆98Updated 9 months ago
• facebookincubator / go-qfext
  a fast counting quotient filter implementation in golang
  ☆95Updated 3 years ago