Struct AutomataRules 

pub struct AutomataRules { /* private fields */ }

Any cellular automata has four different rules that govern how it works.

Any given cell has a certain amount of neighbors. Whether any cell is a neighbor of said cell is up to the neighbor method, which is either Moore or Von Neumann.

A cell must have a certain amount of neighbors to either become alive or stay alive.

Finally, cells in an automaton have a certain amount of ‘states’. Live cells have a state equal to whatever value you put in here, minus 1.

You can think of these states as the amount of time steps (or ticks) it takes for a cell to die. Given a cell which is alive but no longer has enough neighbors to survive, its state value will be decremented to 0 (dead) each tick.

Implementations

impl AutomataRules

pub fn new( to_survive: Rule, to_be_born: Rule, cell_states: u8, neighbor_method: Method, ) -> AutomataRules

Creates a new set of cellular automaton rules.

Trait Implementations

impl Clone for AutomataRules

fn clone(&self) -> AutomataRules

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.