Alternatives and similar repositories for base

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

• cespare / percpu
  Best-effort CPU-local sharded values for Go
  ☆201Updated 3 years ago
• brentp / intintmap
  fast int64-int64 map for go
  ☆98Updated 2 years ago
• philpearl / stringbank
  Storing strings without GC overhead
  ☆82Updated 5 years ago
• tidwall / expr
  Expression evaluator for Go
  ☆76Updated 4 months ago
• dgryski / go-xxh3
  xxh3 fast hash function
  ☆105Updated 6 years ago
• RoaringBitmap / gocroaring
  Go wrapper for CRoaring
  ☆46Updated 2 years ago
• segmentio / fasthash
  Go package porting the standard hashing algorithms to a more efficient implementation.
  ☆293Updated last year
• pkg / diff
  ☆98Updated 7 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
• go4org / mem
  cheap Go type to hold & operate on either a read-only []byte or string
  ☆111Updated last year
• josharian / intern
  Intern Go strings
  ☆95Updated last year
• philpearl / intern
  string interning library for lots of strings
  ☆37Updated 4 years ago
• biogo / store
  bíogo data store repository
  ☆38Updated 4 years ago
• spenczar / tdigest
  Fast approximate quantiles in Go
  ☆127Updated 2 years ago
• opencoff / go-bbhash
  Fast Scalable Minimal Perfect Hash for Large Keysets
  ☆32Updated 6 months ago
• aclements / go-misc
  Miscellaneous Go hacks
  ☆242Updated last month
• tidwall / hashmap
  A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.
  ☆218Updated 2 years ago
• kelindar / intmap
  Fast integer map for uint32-to-uint32
  ☆30Updated last month
• tidwall / mmap
  Load file-backed memory
  ☆122Updated 2 years ago
• bmatsuo / lmdb-go
  Bindings for the LMDB C library
  ☆164Updated 3 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
• kortschak / utter
  Implements a deep pretty printer for Go data structures to ease data snapshot creation
  ☆90Updated 9 months ago
• jfcg / sorty
  Fast Concurrent / Parallel Sorting in Go
  ☆137Updated this week
• tidwall / box
  Efficiently box values in Go. Optimized for primitives, strings, and byte slices.
  ☆70Updated 2 years ago
• alecthomas / mph
  Minimal Perfect Hashing for Go
  ☆187Updated 11 months ago
• dgryski / go-metro
  Go translation of MetroHash
  ☆110Updated 7 months ago
• yourbasic / bit
  Bitset data structure
  ☆164Updated 2 years ago
• stuartcarnie / go-simd
  Optimized functions for Go using SIMD
  ☆194Updated 4 years ago
• saurabh0719 / go-hashlru
  A simple thread-safe and fixed size LRU. Based on the Hashlru Algorithm
  ☆71Updated 2 years ago
• yourbasic / radix
  A fast string sorting algorithm (MSD radix sort)
  ☆193Updated 7 years ago