Struct rlifesrc_lib::rules::life::LifeGen

pub struct LifeGen {
    b0: bool,
    s8: bool,
    gen: usize,
    impl_table: [ImplFlags; 4096],
}

Totalistic Life-like Generations rules.

Fields

b0: bool

Whether the rule contains B0.

s8: bool

Whether the rule contains S8.

gen: usize

Number of states.

impl_table: [ImplFlags; 4096]

An array of actions for all neighborhood descriptors.

Implementations

impl LifeGen

pub fn new(b: &[u8], s: &[u8], gen: usize) -> Self

Constructs a new rule from the b and s data and the number of states.

pub const fn non_gen(self) -> Life

Converts to the corresponding non-Generations rule.

Trait Implementations

impl Clone for LifeGen

fn clone(&self) -> LifeGen

Returns a copy of the value.

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

Performs copy-assignment from source.

impl FromStr for LifeGen

type Err = Error

The associated error which can be returned from parsing.

fn from_str(input: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type.

impl ParseLifeGen for LifeGen

A parser for the rule.

fn from_bsg(b: Vec<u8>, s: Vec<u8>, gen: usize) -> Self

Construct the rule from b / s data and the number of states.

fn parse_rule(input: &str) -> Result<Self, ParseRuleError>where Self: Sized,

The parser.

impl Rule for LifeGen

NOTE: This implementation does work when the number of states is 2.

type Desc = NbhdDescGen

The type of neighborhood descriptor of the rule.

type IsGen = True

Whether the rule is a Generations rule.

fn has_b0(&self) -> bool

Whether the rule contains B0.

fn has_b0_s8(&self) -> bool

Whether the rule contains both B0 and S8.

fn gen(&self) -> usize

The number of states.

fn symmetry(&self) -> Symmetry

The symmetry of the rule.

fn new_desc(state: State, succ_state: State) -> Self::Desc

Generates a neighborhood descriptor which says that all neighboring cells have states state, and the successor has state succ_state.

fn update_desc(cell: &LifeCell<Self>, state: State, new: bool)

Updates the neighborhood descriptors of all neighbors and the predecessor when the state of one cell is changed.

fn consistify<A: Algorithm<Self>>( world: &mut World<Self, A>, cell: CellRef<Self> ) -> Result<(), A::ConflReason>

Consistifies a cell.

impl Sealed for LifeGen