Struct Automaton 

pub struct Automaton { /* private fields */ }

The humble 2D cellular automaton.

Implementations

impl Automaton

pub fn new( rules: AutomataRules, bounds: Vec2, start_cells: Vec<Vec2>, ) -> Result<Automaton, u8>

Creates a new flat (2D) automaton with the given rules, bounds, and starting cells. This can fail if your survival and birth rules exceeds the amount of neighbors a cell could have, given your chosen neighbor counting method. If that happens, this function will error out and return the maximum amount of neighbors.

pub fn tick(&mut self)

Advances the automaton by one time step (or tick).

pub fn get_cells(&self) -> HashMap<Vec2, u8>

Get a copy of the automaton’s internal state (the cells).