mspm Alternatives - Go Data Structures

Popularity

1.7

Growing

Activity

0.0

Stable

Stars 9

Watchers 3

Forks 1

Last Commit about 2 years ago

Programming language: Go

Tags: Data Structures

mspm alternatives and similar packages

Based on the "Data Structures" category

gods

9.7 3.5 mspm VS gods

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

9.5 1.3 mspm VS go-datastructures

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

8.3 0.0 mspm VS golang-set

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

8.1 3.3 mspm VS gota

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

7.9 0.0 mspm VS boomfilters

probabilistic data structures for processing continuous, unbounded streams
roaring

7.5 6.5 mspm VS roaring

Go package implementing compressed bitsets.
willf/bloom

7.5 0.0 mspm VS willf/bloom

Go package implementing Bloom filters.
bitset

7.2 2.1 mspm VS bitset

Go package implementing bitsets.
hyperloglog

7.2 2.2 mspm VS hyperloglog

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

7.1 3.2 mspm VS cuckoofilter

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

6.9 2.2 mspm VS trie

Trie implementation in Go
go-geoindex

6.7 0.0 mspm VS go-geoindex

In-memory geo index.
algorithms

6.7 0.0 mspm VS algorithms

Algorithms and data structures.CLRS study.
gocache

6.4 6.9 mspm VS gocache

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

6.0 0.0 mspm VS goskiplist

A skip list implementation in Go.
mafsa

6.0 0.1 mspm VS mafsa

MA-FSA implementation with Minimal Perfect Hashing
hilbert

5.8 0.0 mspm VS hilbert

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

5.7 2.0 mspm VS merkletree

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

5.6 3.2 mspm VS ttlcache

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

5.2 0.0 mspm VS binpacker

Binary packer and unpacker helps user build custom binary stream.
Bloomfilter

5.2 1.7 mspm VS Bloomfilter

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

5.1 0.4 mspm VS go-adaptive-radix-tree

A Go implementation of Adaptive Radix Tree.
bloom

4.9 0.0 mspm VS bloom

Bloom filters implemented in Go.
conjungo

4.7 0.0 mspm VS conjungo

A small, powerful and flexible merge library.
gostl

4.7 8.0 mspm VS gostl

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

4.6 7.2 mspm VS iter

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

4.5 0.0 mspm VS encoding

Integer Compression Libraries for Go.
ring

4.4 2.9 mspm VS ring

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

4.3 0.0 mspm VS skiplist

Skiplist implementation in Go
bit

4.3 0.0 mspm VS bit

Golang set data structure with bonus bit-twiddling functions.
go-rquad

4.2 4.1 mspm VS go-rquad

Region quadtrees with efficient point location and neighbour finding.
goconcurrentqueue

3.9 5.6 mspm VS goconcurrentqueue

Concurrent FIFO queue.
levenshtein

3.9 3.5 mspm VS levenshtein

Implmentation to calculate levenshtein distance in Go.
go-mcache

3.5 3.7 mspm VS go-mcache

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

3.3 3.5 mspm VS remember-go

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

3.2 0.5 mspm VS set

Simple set data structure implementation in Go using LinkedHashMap.
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).
crunch

2.9 6.8 mspm VS crunch

Go package implementing buffers for handling various datatypes easily.
goset

2.3 0.8 mspm VS goset

A useful Set collection implementation for Go.
ptrie

2.2 5.1 mspm VS ptrie

An implementation of prefix tree.
pipeline

2.0 0.0 mspm VS pipeline

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

2.0 0.0 mspm VS hide

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

1.7 5.5 mspm VS timedmap

Map with expiring key-value pairs.
null

1.5 1.7 mspm VS null

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

1.5 5.7 mspm VS deque

A highly optimized double-ended queue.
dict

1.3 0.0 mspm VS dict

Python-like dictionaries (dict) for Go.
go-ef

1.3 0.0 mspm VS go-ef

A Go implementation of the Elias-Fano encoding.
treap

1.3 2.1 mspm VS treap

Persistent, fast ordered map using tree heaps.
gofal

0.7 5.9 mspm VS gofal

fractional api for Go.
parsefields

0.6 0.0 mspm VS parsefields

Tools for parse JSON-like logs for collecting unique fields and events.

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 for information retrieval.