Struct rlifesrc_lib::rules::life::Life

pub struct Life {
    b0: bool,
    s8: bool,
    impl_table: [ImplFlags; 4096],
}

Totalistic Life-like rules.

Fields

b0: bool

Whether the rule contains B0.

s8: bool

Whether the rule contains S8.

impl_table: [ImplFlags; 4096]

An array of actions for all neighborhood descriptors.

Implementations

impl Life

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

Constructs a new rule from the b and s data.

fn init_trans(self, b: &[u8], s: &[u8]) -> Self

Deduces the implication for the successor.

fn init_conflict(self) -> Self

Deduces the conflicts.

fn init_impl(self) -> Self

Deduces the implication for the cell itself.

fn init_impl_nbhd(self) -> Self

Deduces the implication for the neighbors.

Trait Implementations

impl Clone for Life

fn clone(&self) -> Life

Returns a copy of the value.

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

Performs copy-assignment from source.

impl FromStr for Life

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 ParseLife for Life

A parser for the rule.

fn from_bs(b: Vec<u8>, s: Vec<u8>) -> Self

Construct the rule from b / s data.

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

The parser.

impl Rule for Life

type Desc = NbhdDesc

The type of neighborhood descriptor of the rule.

type IsGen = False

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 Life