Popularity

8.5

Growing

Activity

0.0

Stars 2,402

Watchers 49

Forks 307

Last Commit 8 months ago

Description

FSM is a finite state machine for Go.

Programming language: Go

License: Apache License 2.0

Tags: Data Structures Golang State Machine

FSM for Go alternatives and similar packages

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

gods

9.7 3.9 FSM for Go VS gods

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

9.5 6.6 FSM for Go VS go-datastructures

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

Collect and Analyze Billions of Data Points in Real Time

Manage all types of time series data in a single, purpose-built database. Run at any scale in any environment in the cloud, on-premises, or at the edge.

Promo www.influxdata.com

golang-set

8.7 0.0 FSM for Go 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 FSM for Go VS gota

Gota: DataFrames and data wrangling in Go (Golang)
willf/bloom

8.3 0.0 FSM for Go VS willf/bloom

Go package implementing Bloom filters
roaring

8.3 0.0 FSM for Go VS roaring

Roaring bitmaps in Go (golang)
gocache

8.2 0.0 FSM for Go VS gocache

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

7.9 0.0 FSM for Go VS boomfilters

Probabilistic data structures for processing continuous, unbounded streams.
bitset

7.7 0.0 FSM for Go VS bitset

Go package implementing bitsets
cuckoofilter

7.4 0.0 FSM for Go VS cuckoofilter

Cuckoo Filter: Practically Better Than Bloom
gostl

7.4 0.0 FSM for Go VS gostl

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

7.3 0.0 FSM for Go VS algorithms

CLRS study. Codes are written with golang.
hyperloglog

7.2 0.0 FSM for Go VS hyperloglog

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

7.1 0.0 FSM for Go VS trie

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

6.7 0.0 FSM for Go VS merkletree

A Merkle Tree implementation written in Go.
go-geoindex

6.6 0.0 FSM for Go VS go-geoindex

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

6.5 6.4 FSM for Go VS ttlcache

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

6.2 0.0 FSM for Go VS conjungo

A small flexible merge library in go
go-adaptive-radix-tree

6.0 0.0 FSM for Go VS go-adaptive-radix-tree

Adaptive Radix Trees implemented in Go
Bloomfilter

6.0 0.0 FSM for Go VS Bloomfilter

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

6.0 0.0 FSM for Go VS hilbert

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

6.0 0.0 FSM for Go VS mafsa

MA-FSA implementation with Minimal Perfect Hashing
goskiplist

5.9 0.0 FSM for Go VS goskiplist

A skip list implementation in Go
goconcurrentqueue

5.9 0.0 FSM for Go VS goconcurrentqueue

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

5.8 0.0 FSM for Go VS levenshtein

Go implementation to calculate Levenshtein Distance.
cuckoo-filter

5.6 0.0 FSM for Go VS cuckoo-filter

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

5.5 0.0 FSM for Go VS binpacker

A binary stream packer and unpacker
bitmap

5.4 0.0 FSM for Go VS bitmap

Simple dense bitmap index in Go with binary operators
bit

5.1 0.0 FSM for Go VS bit

Bitset data structure
iter

5.0 0.0 FSM for Go VS iter

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

4.9 0.0 FSM for Go VS bloom

Bloom filters implemented in Go.
encoding

4.7 0.0 FSM for Go VS encoding

Integer Compression Libraries for Go
remember-go

4.6 0.0 FSM for Go VS remember-go

Cache Slow Database Queries
ring

4.6 0.0 FSM for Go VS ring

Package ring provides a high performance and thread safe Go implementation of a bloom filter.
deque

4.6 0.0 FSM for Go VS deque

A highly optimized double-ended queue
skiplist

4.4 0.0 FSM for Go VS skiplist

skiplist for golang
go-rquad

4.4 0.0 FSM for Go VS go-rquad

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

4.2 0.0 FSM for Go VS go-mcache

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

4.0 0.0 FSM for Go VS memlog

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

4.0 0.0 FSM for Go VS crunch

take bytes out of things easily ✨🍪
set

3.9 0.0 FSM for Go VS set

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

3.7 0.0 FSM for Go VS nan

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

3.5 0.0 FSM for Go VS goset

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

3.5 0.0 FSM for Go VS timedmap

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

3.3 0.0 FSM for Go VS count-min-log

Go implementation of Count-Min-Log
go-tuple

3.2 0.0 FSM for Go VS go-tuple

Go 1.18 generic tuples
cmap

3.2 0.0 FSM for Go VS cmap

a thread-safe concurrent map for go
hide

3.2 0.0 FSM for Go VS hide

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

3.1 0.0 FSM for Go VS ptrie

A prefix tree implementation in go
pipeline

3.1 0.0 FSM for Go VS pipeline

Pipelines using goroutines

Do you think we are missing an alternative of FSM for Go or a related project?

Add another 'Data Structures' Package

Popular Comparisons

README

FSM for Go

FSM is a finite state machine for Go.

It is heavily based on two FSM implementations:

Javascript Finite State Machine, https://github.com/jakesgordon/javascript-state-machine
Fysom for Python, https://github.com/oxplot/fysom (forked at https://github.com/mriehl/fysom)

For API docs and examples see http://godoc.org/github.com/looplab/fsm

Basic Example

From examples/simple.go:

package main

import (
    "context"
    "fmt"

    "github.com/looplab/fsm"
)

func main() {
    fsm := fsm.NewFSM(
        "closed",
        fsm.Events{
            {Name: "open", Src: []string{"closed"}, Dst: "open"},
            {Name: "close", Src: []string{"open"}, Dst: "closed"},
        },
        fsm.Callbacks{},
    )

    fmt.Println(fsm.Current())

    err := fsm.Event(context.Background(), "open")
    if err != nil {
        fmt.Println(err)
    }

    fmt.Println(fsm.Current())

    err = fsm.Event(context.Background(), "close")
    if err != nil {
        fmt.Println(err)
    }

    fmt.Println(fsm.Current())
}

Usage as a struct field

From examples/struct.go:

package main

import (
    "context"
    "fmt"

    "github.com/looplab/fsm"
)

type Door struct {
    To  string
    FSM *fsm.FSM
}

func NewDoor(to string) *Door {
    d := &Door{
        To: to,
    }

    d.FSM = fsm.NewFSM(
        "closed",
        fsm.Events{
            {Name: "open", Src: []string{"closed"}, Dst: "open"},
            {Name: "close", Src: []string{"open"}, Dst: "closed"},
        },
        fsm.Callbacks{
            "enter_state": func(_ context.Context, e *fsm.Event) { d.enterState(e) },
        },
    )

    return d
}

func (d *Door) enterState(e *fsm.Event) {
    fmt.Printf("The door to %s is %s\n", d.To, e.Dst)
}

func main() {
    door := NewDoor("heaven")

    err := door.FSM.Event(context.Background(), "open")
    if err != nil {
        fmt.Println(err)
    }

    err = door.FSM.Event(context.Background(), "close")
    if err != nil {
        fmt.Println(err)
    }
}