Popularity

2.1

Growing

Activity

0.0

Stable

Stars 22

Watchers 3

Forks 4

Last Commit about 5 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 5.1 mspm VS gods

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

9.5 7.9 mspm VS go-datastructures

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

Static code analysis for 29 languages.

Your projects are multi-language. So is SonarQube analysis. Find Bugs, Vulnerabilities, Security Hotspots, and Code Smells so you can release quality code every time. Get started analyzing your projects today for free.

Promo www.sonarqube.org

golang-set

8.7 3.2 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.4 3.9 mspm VS FSM for Go

Finite State Machine for Go
roaring

8.3 3.5 mspm VS roaring

Roaring bitmaps in Go (golang)
willf/bloom

8.2 6.8 mspm VS willf/bloom

Go package implementing Bloom filters
gocache

8.1 5.7 mspm VS gocache

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

7.9 0.0 mspm VS boomfilters

Probabilistic data structures for processing continuous, unbounded streams.
bitset

7.6 3.2 mspm VS bitset

Go package implementing bitsets
cuckoofilter

7.4 0.0 mspm VS cuckoofilter

Cuckoo Filter: Practically Better Than Bloom
gostl

7.3 0.0 mspm VS gostl

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

7.2 0.0 mspm VS hyperloglog

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

7.2 0.0 mspm VS algorithms

CLRS study. Codes are written with golang.
trie

7.1 0.0 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

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

6.5 0.0 mspm VS go-geoindex

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

6.2 0.0 mspm VS conjungo

A small flexible merge library in go
mafsa

6.0 0.0 mspm VS mafsa

MA-FSA implementation with Minimal Perfect Hashing
hilbert

6.0 0.0 mspm VS hilbert

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

6.0 0.0 mspm VS Bloomfilter

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

5.9 0.0 mspm VS go-adaptive-radix-tree

Adaptive Radix Trees implemented in Go
goskiplist

5.9 0.0 mspm VS goskiplist

A skip list implementation in Go
goconcurrentqueue

5.7 0.0 mspm VS goconcurrentqueue

Go concurrent-safe, goroutine-safe, thread-safe queue
levenshtein

5.7 0.0 mspm VS levenshtein

Go implementation to calculate Levenshtein Distance.
binpacker

5.5 0.0 mspm VS binpacker

A binary stream packer and unpacker
cuckoo-filter

5.5 0.0 mspm VS cuckoo-filter

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

5.3 3.2 mspm VS bitmap

Simple dense bitmap index in Go with binary operators
bit

5.1 0.0 mspm VS bit

Bitset data structure
iter

5.0 0.0 mspm VS iter

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

4.9 0.0 mspm VS bloom

Bloom filters implemented in Go.
encoding

4.7 0.0 mspm VS encoding

Integer Compression Libraries for Go
ring

4.6 0.0 mspm VS ring

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

4.4 0.0 mspm VS remember-go

Cache Slow Database Queries
skiplist

4.4 0.0 mspm VS skiplist

skiplist for golang
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
deque

4.4 5.3 mspm VS deque

A highly optimized double-ended queue
go-mcache

4.2 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 ✨🍪
set

3.8 0.0 mspm VS set

A simple Set data structure implementation in Go (Golang) using LinkedHashMap.
nan

3.7 0.0 mspm VS nan

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

3.7 0.0 mspm VS memlog

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

3.4 0.0 mspm VS goset

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

3.4 0.0 mspm VS timedmap

A thread safe map which has expiring key-value pairs.
count-min-log

3.2 0.0 mspm VS count-min-log

Go implementation of Count-Min-Log
hide

3.2 0.0 mspm VS hide

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

3.1 1.3 mspm VS cmap

a thread-safe concurrent map for go
ptrie

3.1 0.0 mspm VS ptrie

A prefix tree implementation in go
pipeline

3.0 0.0 mspm VS pipeline

Pipelines using goroutines

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

Resources

Trie
mspm - Multi-String Pattern Matching algorithm. Generally used for Information Retrieval.
Aho-Corasick algorithm

mspm

Multi-String Pattern Matching Algorithm Using TrieNode