Enum ca_formats::macrocell::NodeData

pub enum NodeData {
    Level1 {
        nw: u8,
        ne: u8,
        sw: u8,
        se: u8,
    },
    Level3(u64),
    Node {
        level: u8,
        nw: usize,
        ne: usize,
        sw: usize,
        se: usize,
    },
}

Data in a Node.

Variants

Level1

Fields

nw: u8

ne: u8

sw: u8

se: u8

A level 1 leaf, representing a 2x2 square, in rules with more than 2 states.

The data contains the states of four cells in the square.

Level3(u64)

A level 3 leaf, representing a 8x8 square, in rules with 2 states.

The data is represented by a 64-bit integer.

Node

Fields

level: u8

nw: usize

ne: usize

sw: usize

se: usize

A non-leaf node.

The data contains the level of the node, and the ids of four children.

Implementations

impl NodeData

pub const fn level(&self) -> u8

Trait Implementations

impl Clone for NodeData

fn clone(&self) -> NodeData

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for NodeData

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Hash for NodeData

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for NodeData

fn cmp(&self, other: &NodeData) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Selfwhere Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Selfwhere Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl PartialEq for NodeData

fn eq(&self, other: &NodeData) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for NodeData

fn partial_cmp(&self, other: &NodeData) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl Copy for NodeData

impl Eq for NodeData

impl StructuralEq for NodeData

impl StructuralPartialEq for NodeData