PicoMachine: javascript version of the ruby MicroMachine
No description provided.
PicoMachine: minimal finite state machine
Small Finite State Machine implementation in JavaScript.
Minimal state machine implementation.
The Windows 64-bit binary for micromachine.dev.
The Linux ARM binary for micromachine.dev.
The Linux 64-bit binary for micromachine.dev, a JavaScript bundler.
The macOS ARM 64-bit binary for micromachine.dev.
The Linux ARM 64-bit binary for micromachine.dev
The macOS 64-bit binary for micromachine.dev.
The Windows ARM 64-bit binary for micromachine.dev.
Finite state machine, inspired by micromachine
Platform-agnostic driver for the ASM330LHH high-accuracy 3D accelerometer and gyroscope with ultra-low noise, smart FIFO and advanced industrial features.
Platform-agnostic driver for the ASM330LHHX high-accuracy 3D accelerometer and gyroscope with ultra-low noise, smart FIFO, sensor hub, MLC, FSM, and advanced industrial features.
Platform-agnostic driver for the ISM330DHCX high-accuracy 3D accelerometer and gyroscope with ultra-low noise, smart FIFO, sensor hub, MLC, FSM, and advanced industrial features.
Driver for the IIS2DLPC ultra-low-power three-axis accelerometer with selectable full scale, multiple power modes, FIFO, and advanced motion detection.
Platform-agnostic Rust driver for the MMA8451, MMA8452, MMA8453, MMA8652 and MMA8653 tri-axis accelerators.
Minimal State Machines
There are many finite state machine implementations for Ruby, and they all provide a nice DSL for declaring events, exceptions, callbacks, and all kinds of niceties in general. But if all you want is a finite state machine, look no further: this has less than 50 lines of code and provides everything a finite state machine must have, and nothing more.
There are many finite state machine implementations for Ruby, and they all provide a nice DSL for declaring events, exceptions, callbacks, and all kinds of niceties in general. But if all you want is a finite state machine, look no further: this is only 22 lines of code and provides everything a finite state machine must have, and nothing more.
A nanoscopic Finite State Machine. Like micromachine, but smaller.
FMM is a small finite state machine implementation based on Michael Martens' micromachine, but recast in the idioms of functional programming: instead of mutable state we use arguments and return values, and instead of methods bound to an instance of a class like MicroMachine, we provide utility functions that operate on any suitable data structure.