Multi-String Pattern Matching Algorithm for information retrieval.

mspm alternatives and similar packages

Based on the "Data Structures" category.
Alternatively, view mspm alternatives based on common mentions on social networks and blogs.

• gods

  9.7 2.1 mspm VS gods

  Go Data Structures. Containers, Sets, Lists, Stacks, Maps, BidiMaps, Trees, HashSet etc.

• go-datastructures

  9.5 0.0 mspm VS go-datastructures

  a collection of useful, performant, and thread-safe data structures

Get performance insights in less than 4 minutes

Scout APM uses tracing logic that ties bottlenecks to source code so you know the exact line of code causing performance issues and can get back to building a great product faster.

Sponsored scoutapm.com



• golang-set

  8.4 0.8 mspm VS golang-set

  Thread-Safe and Non-Thread-Safe high-performance sets for Go.

• gota

  8.3 0.0 mspm VS gota

  An implementation of dataframes, series, and data wrangling methods for Go.

• boomfilters

  7.9 0.3 mspm VS boomfilters

  probabilistic data structures for processing continuous, unbounded streams

• roaring

  7.8 7.3 mspm VS roaring

  Go package implementing compressed bitsets.

• willf/bloom

  7.7 0.0 mspm VS willf/bloom

  Go package implementing Bloom filters.

• cuckoofilter

  7.3 1.6 mspm VS cuckoofilter

  Cuckoo filter: a good alternative to a counting bloom filter implemented in Go.

• gocache

  7.3 6.2 mspm VS gocache

  A complete Go cache library with mutiple stores (memory, memcache, redis, ...), chainable, loadable, metrics cache and more.

• bitset

  7.3 5.2 mspm VS bitset

  Go package implementing bitsets.

• hyperloglog

  7.2 0.0 mspm VS hyperloglog

  HyperLogLog implementation with Sparse, LogLog-Beta bias correction and TailCut space reduction.

• trie

  7.0 0.1 mspm VS trie

  Trie implementation in Go

• algorithms

  6.9 0.0 mspm VS algorithms

  Algorithms and data structures.CLRS study.

• go-geoindex

  6.7 0.0 mspm VS go-geoindex

  In-memory geo index.

• conjungo

  6.1 0.0 mspm VS conjungo

  A small, powerful and flexible merge library.

• mafsa

  6.0 0.0 mspm VS mafsa

  MA-FSA implementation with Minimal Perfect Hashing

• goskiplist

  6.0 0.0 mspm VS goskiplist

  A skip list implementation in Go.

• merkletree

  6.0 0.0 mspm VS merkletree

  Implementation of a merkle tree providing an efficient and secure verification of the contents of data structures.

• Bloomfilter

  6.0 0.0 mspm VS Bloomfilter

  Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go

• hilbert

  5.9 0.0 mspm VS hilbert

  Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.

• gostl

  5.9 2.0 mspm VS gostl

  Data structure and algorithm library for go, designed to provide functions similar to C++ STL.

• ttlcache

  5.7 6.3 mspm VS ttlcache

  An in-memory LRU string-interface{} map with expiration for golang

• go-adaptive-radix-tree

  5.4 2.1 mspm VS go-adaptive-radix-tree

  A Go implementation of Adaptive Radix Tree.

• binpacker

  5.4 0.0 mspm VS binpacker

  Binary packer and unpacker helps user build custom binary stream.

• bloom

  4.9 0.0 mspm VS bloom

  Bloom filters implemented in Go.

• iter

  4.7 0.0 mspm VS iter

  Go implementation of C++ STL iterators and algorithms.

• encoding

  4.6 0.0 mspm VS encoding

  Integer Compression Libraries for Go.

• bit

  4.6 0.0 mspm VS bit

  Golang set data structure with bonus bit-twiddling functions.

• goconcurrentqueue

  4.6 2.0 mspm VS goconcurrentqueue

  Concurrent FIFO queue.

• ring

  4.5 1.4 mspm VS ring

  Go implementation of a high performance, thread safe bloom filter.

• levenshtein

  4.5 1.6 mspm VS levenshtein

  Implmentation to calculate levenshtein distance in Go.

• skiplist

  4.4 0.0 mspm VS skiplist

  Skiplist implementation in Go

• go-rquad

  4.3 1.1 mspm VS go-rquad

  Region quadtrees with efficient point location and neighbour finding.

• remember-go

  3.9 3.9 mspm VS remember-go

  A universal interface for caching slow database queries (backed by redis, memcached, ristretto, or in-memory).

• go-mcache

  3.6 0.0 mspm VS go-mcache

  Fast in-memory key:value store/cache library. Pointer caches.

• set

  3.3 0.6 mspm VS set

  Simple set data structure implementation in Go using LinkedHashMap.

• crunch

  3.3 2.3 mspm VS crunch

  Go package implementing buffers for handling various datatypes easily.

• count-min-log

  3.1 0.0 mspm VS count-min-log

  A Go implementation Count-Min-Log sketch: Approximately counting with approximate counters (Like Count-Min sketch but using less memory).

• nan

  2.8 7.8 mspm VS nan

  Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers.

• goset

  2.7 0.6 mspm VS goset

  A useful Set collection implementation for Go.

• hide

  2.6 1.6 mspm VS hide

  ID type with marshalling to/from hash to prevent sending IDs to clients.

• ptrie

  2.4 0.5 mspm VS ptrie

  An implementation of prefix tree.

• pipeline

  2.3 0.0 mspm VS pipeline

  An implementation of pipelines with fan-in and fan-out.

• timedmap

  2.2 3.0 mspm VS timedmap

  Map with expiring key-value pairs.

• deque

  2.2 0.2 mspm VS deque

  A highly optimized double-ended queue.

• go-ef

  2.1 0.0 mspm VS go-ef

  A Go implementation of the Elias-Fano encoding.

• null

  1.7 0.9 mspm VS null

  Nullable Go types that can be marshalled/unmarshalled to/from JSON.

• dict

  1.5 1.3 mspm VS dict

  Python-like dictionaries (dict) for Go.

• treap

  1.4 0.0 mspm VS treap

  Persistent, fast ordered map using tree heaps.

• gofal

  1.1 0.0 mspm VS gofal

  fractional api for Go.

Do you think we are missing an alternative of mspm or a related project?

Popular Comparisons

• mspm
  vs
  gota
• go-datastructures
  vs
  gods
• golang-set
  vs
  gods
• golang-set
  vs
  bitset
• golang-set
  vs
  mafsa

SaaSHub - Software Alternatives and Reviews Sponsored www.saashub.com