Popularity

1.9

Declining

Activity

0.0

Stable

Stars 26

Watchers 2

Forks 4

Last Commit almost 7 years ago

Programming language: Go

License: BSD 3-clause "New" or "Revised" License

Tags: Data Structures

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.8 4.7 mspm VS gods

GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
go-datastructures

9.4 7.3 mspm VS go-datastructures

A collection of useful, performant, and threadsafe Go datastructures.

InfluxDB high-performance time series database

Collect, organize, and act on massive volumes of high-resolution data to power real-time intelligent systems.

Promo influxdata.com

golang-set

8.8 4.8 mspm VS golang-set

A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
gota

8.6 0.0 mspm VS gota

Gota: DataFrames and data wrangling in Go (Golang)
FSM for Go

8.5 2.9 mspm VS FSM for Go

Finite State Machine for Go
roaring

8.4 8.3 mspm VS roaring

Roaring bitmaps in Go (golang), used by InfluxDB, Bleve, DataDog
willf/bloom

8.3 4.1 mspm VS willf/bloom

Go package implementing Bloom filters, used by Milvus and Beego.
gocache

8.3 6.8 mspm VS gocache

☔️ A complete Go cache library that brings you multiple ways of managing your caches
boomfilters

7.8 0.0 mspm VS boomfilters

Probabilistic data structures for processing continuous, unbounded streams.
bitset

7.7 8.2 mspm VS bitset

Go package implementing bitsets
cuckoofilter

7.4 2.1 mspm VS cuckoofilter

Cuckoo Filter: Practically Better Than Bloom
gostl

7.4 4.7 mspm VS gostl

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

7.2 7.1 mspm VS hyperloglog

HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
algorithms

7.1 0.0 mspm VS algorithms

CLRS study. Codes are written with golang.
trie

7.0 4.3 mspm VS trie

Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
merkletree

6.7 0.0 mspm VS merkletree

A Merkle Tree implementation written in Go.
ttlcache

6.5 6.4 mspm VS ttlcache

DISCONTINUED. An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
go-geoindex

6.4 0.0 mspm VS go-geoindex

Go native library for fast point tracking and K-Nearest queries
goconcurrentqueue

6.1 0.0 mspm VS goconcurrentqueue

Go concurrent-safe, goroutine-safe, thread-safe queue
go-adaptive-radix-tree

6.1 7.2 mspm VS go-adaptive-radix-tree

Adaptive Radix Trees implemented in Go
mafsa

6.0 0.0 mspm VS mafsa

DISCONTINUED. MA-FSA implementation with Minimal Perfect Hashing
levenshtein

6.0 4.8 mspm VS levenshtein

Go implementation to calculate Levenshtein Distance.
Bloomfilter

6.0 0.0 mspm VS Bloomfilter

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

6.0 1.3 mspm VS conjungo

DISCONTINUED. A small flexible merge library in go
hilbert

5.9 0.0 mspm VS hilbert

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

5.7 0.0 mspm VS goskiplist

A skip list implementation in Go
bitmap

5.6 4.3 mspm VS bitmap

Simple dense bitmap index in Go with binary operators
cuckoo-filter

5.6 0.0 mspm VS cuckoo-filter

Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现，优于布隆过滤器，可以定制化过滤器参数，并进行了空间优化
binpacker

5.4 0.0 mspm VS binpacker

A binary stream packer and unpacker
bit

5.0 0.0 mspm VS bit

Bitset data structure
iter

4.9 0.0 mspm VS iter

Go implementation of C++ STL iterators and algorithms.
deque

4.8 3.4 mspm VS deque

A highly optimized double-ended queue
bloom

4.7 0.0 mspm VS bloom

Bloom filters implemented in Go.
encoding

4.5 0.0 mspm VS encoding

Integer Compression Libraries for Go
remember-go

4.5 0.0 mspm VS remember-go

Cache Slow Database Queries
ring

4.4 0.0 mspm VS ring

Package ring provides a high performance and thread safe Go implementation of a bloom filter.
go-rquad

4.4 0.0 mspm VS go-rquad

:pushpin: State of the art point location and neighbour finding algorithms for region quadtrees, in Go
memlog

4.2 5.2 mspm VS memlog

A Kafka log inspired in-memory and append-only data structure
skiplist

4.2 0.0 mspm VS skiplist

skiplist for golang
go-mcache

4.1 0.0 mspm VS go-mcache

Fast in-memory key:value store/cache with TTL
crunch

4.0 0.0 mspm VS crunch

take bytes out of things easily ✨🍪
nan

3.8 3.0 mspm VS nan

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

3.8 3.7 mspm VS cmap

a thread-safe concurrent map for go
set

3.7 0.0 mspm VS set

A simple Set data structure implementation in Go (Golang) using LinkedHashMap.
go-tuple

3.5 3.2 mspm VS go-tuple

Go 1.18+ generic tuple
timedmap

3.5 6.2 mspm VS timedmap

A thread safe map which has expiring key-value pairs.
hide

3.4 0.0 mspm VS hide

A Go type to prevent internal numeric IDs from being exposed to clients using HashIDs and JSON.
goset

3.3 0.0 mspm VS goset

Set is a useful collection but there is no built-in implementation in Go lang.
ptrie

3.2 4.5 mspm VS ptrie

A prefix tree implementation in go
count-min-log

3.2 2.1 mspm VS count-min-log

Go implementation of Count-Min-Log

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

Add another 'Data Structures' Package

Popular Comparisons

README

Multi-String Pattern Matching algorithm.

This implementation is inspired from Aho-Corasick algorithm

Getting Started

modelA = mspm.NewModel("mspm_model_A")
patternsToSearch = strings.NewReader(words) // words is newline seperated list of words/keywords

// build mspm model with patterns
modelA.Build(patternsToSearch)

inputString := "input document where the above pattern is searched for."
document := strings.NewReader(inputString)
output, err := modelA.MultiTermMatch(document)

// output ~= [{matched_word: n_count}, ..]

Test Coverage

TrieNode vs TrieHashNode benchmark

$ cd github.com/BlackRabbitt/mspm/ds/trie
$ go test -bench=.
goos: darwin
goarch: amd64
pkg: github.com/BlackRabbitt/mspm/ds/trie
BenchmarkTrieNodeInsert-4             500000          2582 ns/op
BenchmarkTrieNodeSearch-4           10000000           205 ns/op
BenchmarkTrieHashNodeInsert-4        1000000          1491 ns/op
BenchmarkTrieHashNodeSearch-4       10000000           206 ns/op
PASS
ok      github.com/BlackRabbitt/mspm/ds/trie    8.795s