Alternatives and similar repositories for bloomfilter

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

• glycerine / rbuf
  a small circular ring buffer library in go / golang
  ☆188Updated 6 years ago
• zond / gotomic
  Non blocking data structures for Go
  ☆267Updated 8 years ago
• AndreasBriese / bbloom
  go/golang: fast bit set Bloom filter
  ☆136Updated 5 years ago
• tsenart / tb
  A generic lock-free implementation of the "Token-Bucket" algorithm
  ☆145Updated 6 years ago
• bmatsuo / lmdb-go
  Bindings for the LMDB C library
  ☆164Updated 3 years ago
• facebookarchive / inmem
  Package inmem provides an in memory LRU cache with TTL support.
  ☆81Updated 8 years ago
• steveyen / gtreap
  gtreap is an immutable treap implementation in the Go Language
  ☆90Updated 3 years ago
• OneOfOne / lfchan
  A scalable lock-free channel.
  ☆135Updated 9 years ago
• textnode / gringo
  High-performance minimalist queue implemented using a stripped-down lock-free ringbuffer, written in Go (golang.org)
  ☆133Updated 7 years ago
• gigawattio / metaflector
  Higher-level reflect-based capabilities for inspecting objects and structs
  ☆70Updated 7 years ago
• cznic / lldb
  github.com/cznic/lldb has moved to modernc.org/lldb
  ☆33Updated 6 years ago
• armon / circbuf
  Golang circular (ring) buffer
  ☆174Updated 2 years ago
• tidwall / raft-fastlog
  Raft in-memory backend implementation with persistence
  ☆84Updated 4 years ago
• klauspost / readahead
  Asynchronous read-ahead for Go readers
  ☆233Updated 11 months ago
• salviati / cuckoo
  Cuckoo hashing for Go
  ☆83Updated 3 years ago
• cloudflare / bm
  A Golang implementation of Bentley/McIlroy long string compression
  ☆119Updated 9 months ago
• facebookarchive / pqueue
  Package pqueue provides a priority queue.
  ☆102Updated 10 years ago
• rogpeppe / fastuuid
  Fast generation of 192-bit UUIDs
  ☆84Updated 2 years ago
• gavv / monotime
  Measuring time intervals correctly in Go (monotonic clock).
  ☆64Updated 6 years ago
• patrick-higgins / rtreego
  an R-Tree library for Go
  ☆29Updated 8 years ago
• hit9 / htree
  Package htree implements the in-memory hash tree. Hacker News: https://news.ycombinator.com/item?id=11369676
  ☆92Updated 2 years ago
• smarty-archives / mafsa
  Package mafsa implements Minimal Acyclic Finite State Automata in Go, essentially a high-speed, memory-efficient, Unicode-friendly set of…
  ☆296Updated 6 years ago
• facebookarchive / rpool
  Package rpool provides a resource pool.
  ☆88Updated 9 years ago
• Clever / leakybucket
  Leaky bucket implementation in Go with support for different backends (redis, in-memory)
  ☆87Updated 2 months ago
• ashishgandhi / buffer
  A file backed circular buffer for Go. Mmap file into memory. Madvise to lower memory footprint.
  ☆81Updated 8 months ago
• glycerine / zebrapack
  ZebraPack format is like gobs version 2: serialization in Go, *but* extremely fast and friendly to other languages. Use Go as your schema…
  ☆171Updated 6 years ago
• jakewins / 4fq
  Low latency batching queues for Go
  ☆75Updated 8 years ago
• xtgo / set
  General, type-safe, non-allocating set-operations for any sort.Interface
  ☆170Updated 6 years ago
• nozzle / throttler
  ☆171Updated 6 years ago
• dgryski / go-farm
  go-farm: a pure-Go farmhash implementation
  ☆251Updated 9 months ago