Alternatives and similar repositories for trie:

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

• goccy / go-reflect
  Zero-allocation reflection library for Go
  ☆555Updated last year
• benbjohnson / clock
  Clock is a small library for mocking time in Go.
  ☆679Updated last year
• cloudfoundry / go-diodes
  Diodes are ring buffers manipulated via atomics.
  ☆470Updated this week
• mdempsky / maligned
  Tool to detect Go structs that would take less memory if their fields were sorted.
  ☆538Updated last year
• fatih / structtag
  Parse and modify Go struct field tags
  ☆636Updated last year
• modern-go / reflect2
  reflect api without runtime reflect.Value cost
  ☆777Updated 7 months ago
• rogpeppe / go-internal
  Selected Go-internal packages factored out from the standard library
  ☆896Updated 3 weeks ago
• segmentio / fasthash
  Go package porting the standard hashing algorithms to a more efficient implementation.
  ☆292Updated 7 months ago
• gammazero / deque
  Fast ring-buffer deque (double-ended queue)
  ☆649Updated last week
• armon / go-radix
  Golang implementation of Radix trees
  ☆901Updated 7 months ago
• derekparker / trie
  Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
  ☆766Updated 5 months ago
• oleiade / lane
  Generic PriorityQueues, Queues, Stacks, and Deque data structures for Go
  ☆888Updated last year
• mitchellh / hashstructure
  Get hash values for arbitrary values in Go (golang).
  ☆752Updated 2 years ago
• joncrlsn / dque
  dque is a fast, embedded, durable queue for Go
  ☆779Updated 3 months ago
• wk8 / go-ordered-map
  Optimal implementation of ordered maps for Golang - ie maps that remember the order in which keys were inserted.
  ☆552Updated 6 months ago
• gofrs / flock
  Thread-safe file locking library in Go
  ☆607Updated last week
• bits-and-blooms / bitset
  Go package implementing bitsets
  ☆1,380Updated 2 weeks ago
• twmb / murmur3
  Fast, fully fledged murmur3 in Go.
  ☆317Updated last year
• tidwall / hashmap
  A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.
  ☆217Updated last year
• alexkohler / prealloc
  prealloc is a Go static analysis tool to find slice declarations that could potentially be preallocated.
  ☆647Updated 10 months ago
• qustavo / sqlhooks
  Attach hooks to any database/sql driver
  ☆654Updated 7 months ago
• zeebo / xxh3
  XXH3 algorithm in Go
  ☆427Updated last year
• smallnest / ringbuffer
  a thread-safe circular buffer (ring buffer) in Go, implemented io.ReaderWriter interface
  ☆533Updated 2 months ago
• hashicorp / go-immutable-radix
  An immutable radix tree implementation in Golang
  ☆1,026Updated last month
• valyala / bytebufferpool
  Anti-memory-waste byte buffer pool
  ☆1,225Updated 7 months ago
• scylladb / go-set
  Type-safe, zero-allocation sets for Go
  ☆815Updated 4 years ago
• hashicorp / go-cleanhttp
  ☆385Updated this week
• stretchr / objx
  Go package for dealing with maps, slices, JSON and other data.
  ☆726Updated last week
• colega / zeropool
  Zero-allocation type-safe pool for Go
  ☆230Updated last year
• alphadose / haxmap
  Fastest and most memory efficient golang concurrent hashmap
  ☆975Updated 3 months ago