Alternatives and similar repositories for base

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

• brentp / intintmap
  fast int64-int64 map for go
  ☆100Updated 3 months ago
• tidwall / expr
  Expression evaluator for Go
  ☆80Updated 2 weeks ago
• philpearl / stringbank
  Storing strings without GC overhead
  ☆86Updated last month
• kortschak / utter
  Implements a deep pretty printer for Go data structures to ease data snapshot creation
  ☆93Updated last year
• tidwall / rhh
  A simple and efficient hashmap package for Go. Uses open addressing, Robin Hood hashing, and xxhash algorithm.
  ☆82Updated 3 years ago
• pkg / diff
  ☆101Updated last year
• cespare / percpu
  Best-effort CPU-local sharded values for Go
  ☆203Updated 4 years ago
• josharian / intern
  Intern Go strings
  ☆97Updated 2 years ago
• tidwall / box
  Efficiently box values in Go. Optimized for primitives, strings, and byte slices.
  ☆77Updated 5 months ago
• dgryski / go-xxh3
  xxh3 fast hash function
  ☆105Updated 6 years ago
• jfcg / sorty
  Fast Concurrent / Parallel Sorting in Go
  ☆144Updated 5 months ago
• segmentio / fasthash
  Go package porting the standard hashing algorithms to a more efficient implementation.
  ☆295Updated last year
• ka-weihe / fast-levenshtein
  Fastest levenshtein implementation in Go.
  ☆134Updated 5 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.
  ☆70Updated last year
• opencoff / go-bbhash
  Fast Scalable Minimal Perfect Hash for Large Keysets
  ☆32Updated last year
• go4org / mem
  cheap Go type to hold & operate on either a read-only []byte or string
  ☆115Updated last year
• kelindar / intmap
  Fast integer map for uint32-to-uint32
  ☆33Updated 7 months ago
• go4org / intern
  ☆122Updated 2 years ago
• stuartcarnie / go-simd
  Optimized functions for Go using SIMD
  ☆192Updated 5 years ago
• agext / levenshtein
  Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.
  ☆90Updated 5 years ago
• kpango / fastime
  Blazing fast time function library for Go with zero memory allocation. fastime returns the approximate time.
  ☆56Updated 6 months ago
• lukechampine / noescape
  Promise to the Go compiler that your Reads and Writes are well-behaved
  ☆61Updated 6 years ago
• cespare / mph
  Minimal perfect hashing in Go
  ☆74Updated 3 years ago
• tidwall / hashmap
  A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.
  ☆221Updated 2 years ago
• pbnjay / memory
  A go function to report total system memory
  ☆207Updated 3 years ago
• beevik / prefixtree
  A prefix tree (trie) implementation in go
  ☆40Updated last year
• tidwall / mmap
  Load file-backed memory
  ☆122Updated 3 years ago
• yourbasic / radix
  A fast string sorting algorithm (MSD radix sort)
  ☆196Updated 7 years ago
• viant / ptrie
  A prefix tree implementation in go
  ☆44Updated last year
• mpraski / clusters
  Cluster analysis library for Golang
  ☆95Updated 6 years ago