Struct World

pub struct World<R: Rule, A: Algorithm<R>> { /* private fields */ }

The world.

Implementations

impl<R: Rule, A: Algorithm<R>> World<R, A>

pub fn search(&mut self, max_step: Option<u64>) -> Status

The search function.

Returns Status::Found if a result is found, Status::None if such pattern does not exist, Status::Searching if the number of steps exceeds max_step and no results are found.

impl<R: Rule> World<R, LifeSrc>

pub fn new_with_rule<A: Algorithm<R>>(config: &Config, rule: R) -> World<R, A>

Creates a new world from the configuration and the rule.

pub fn new_lifesrc(config: &Config, rule: R) -> Self

Creates a new world from the configuration and the rule, using the LifeSrc algorithm.

impl<R: Rule<IsGen = False>> World<R, Backjump<R>>

pub fn new_backjump(config: &Config, rule: R) -> Self

Creates a new world from the configuration and the rule, using the Backjump algorithm.

impl<R: Rule, A: Algorithm<R>> World<R, A>

pub fn get_cell_state(&self, coord: Coord) -> Option<State>

Gets the state of a cell. Returns Err(()) if there is no such cell.

pub const fn config(&self) -> &Config

World configuration.

pub const fn is_gen_rule(&self) -> bool

Whether the rule is a Generations rule.

pub fn is_b0_rule(&self) -> bool

Whether the rule contains B0.

In other words, whether a cell would become ALIVE in the next generation, if all its neighbors in this generation are dead.

pub fn cell_count_gen(&self, t: i32) -> u32

Number of known living cells in some generation.

For Generations rules, dying cells are not counted.

pub fn cell_count(&self) -> u32

Minimum number of known living cells in all generation.

For Generations rules, dying cells are not counted.

pub const fn conflicts(&self) -> u64

Number of conflicts during the search.

pub fn set_max_cell_count(&mut self, max_cell_count: Option<u32>)

Set the max cell counts.

Currently this is the only parameter that you can change during the search.

pub fn rle_gen(&self, t: i32) -> String

Displays the whole world in some generation, in a mix of Plaintext and RLE format.

• Dead cells are represented by .;
• Living cells are represented by o for rules with 2 states, A for rules with more states;
• Dying cells are represented by uppercase letters starting from B;
• Unknown cells are represented by ?;
• Each line is ended with $;
• The whole pattern is ended with !.

pub fn plaintext_gen(&self, t: i32) -> String

Displays the whole world in some generation in Plaintext format.

Do not use this for Generations rules.

• Dead cells are represented by .;
• Living and Dying cells are represented by o;
• Unknown cells are represented by ?.

impl<R: Rule, A: Algorithm<R>> World<R, A>

pub fn ser(&self) -> WorldSer

Available on crate feature serde only.

Saves the world as a WorldSer.

pub fn deser(&mut self, ser: &WorldSer) -> Result<(), Error>

Available on crate feature serde only.

Restores the world from the WorldSer.

Trait Implementations

impl From<World<Life, Backjump<Life>>> for PolyWorld

Convert into LifeBackjump variant.

fn from(v: World<Life, Backjump<Life>>) -> Self

Converts to this type from the input type.

impl From<World<Life, LifeSrc>> for PolyWorld

Convert into Life variant.

fn from(v: World<Life, LifeSrc>) -> Self

Converts to this type from the input type.

impl From<World<LifeGen, LifeSrc>> for PolyWorld

Convert into LifeGen variant.

fn from(v: World<LifeGen, LifeSrc>) -> Self

Converts to this type from the input type.

impl From<World<NtLife, Backjump<NtLife>>> for PolyWorld

Convert into NtLifeBackjump variant.

fn from(v: World<NtLife, Backjump<NtLife>>) -> Self

Converts to this type from the input type.

impl From<World<NtLife, LifeSrc>> for PolyWorld

Convert into NtLife variant.

fn from(v: World<NtLife, LifeSrc>) -> Self

Converts to this type from the input type.

impl From<World<NtLifeGen, LifeSrc>> for PolyWorld

Convert into NtLifeGen variant.

fn from(v: World<NtLifeGen, LifeSrc>) -> Self

Converts to this type from the input type.