Struct PatternTreeNode

struct PatternTreeNode {
    is_match: bool,
    w: Option<Rc<RefCell<PatternTreeNode>>>,
    u: Option<Rc<RefCell<PatternTreeNode>>>,
    b: Option<Rc<RefCell<PatternTreeNode>>>,
    r: Option<Rc<RefCell<PatternTreeNode>>>,
    g: Option<Rc<RefCell<PatternTreeNode>>>,
}

A tree with branching factor of 5 for encoding the Set of all the possible patterns

Fields

is_match: bool

w: Option<Rc<RefCell<PatternTreeNode>>>

u: Option<Rc<RefCell<PatternTreeNode>>>

b: Option<Rc<RefCell<PatternTreeNode>>>

r: Option<Rc<RefCell<PatternTreeNode>>>

g: Option<Rc<RefCell<PatternTreeNode>>>

Implementations

impl PatternTreeNode

fn new() -> Self

Create an empty node

fn into_ref(self) -> Rc<RefCell<PatternTreeNode>>

helper for getting a reference to a node

fn get_node(&self, colour: &Colour) -> Option<Rc<RefCell<PatternTreeNode>>>

Helper to map a given colour to its child node if that exists

fn upsert_node(&mut self, colour: &Colour) -> Rc<RefCell<PatternTreeNode>>

Get a reference to the node for a colour, creating it if it doesn’t exist

fn insert(&mut self, colours: impl Iterator<Item = Colour>)

Recursively insert a pattern into the tree, creating the required nodes and marking the final node as terminating a pattern

fn matches(&self, design: &Vec<Colour>) -> bool

Does this tree match the design? he inner recursive function walks the tree matching the characters in the design, jumping back to the root node when patterns are matched

fn count_matches(&self, designs: &Vec<Vec<Colour>>) -> usize

Solves part 1 by counting the designs that the pattern tree can match

fn combinations(&self, design: &Vec<Colour>) -> usize

Similar to Self::matches, but doesn’t bail early when the root node matches the rest of the pattern, instead increments a count. Caches combinations that start at the root node for performance.

fn sum_combinations(&self, designs: &Vec<Vec<Colour>>) -> usize

Solves part, by calling Self::combinations for all designs and summing the result,

Trait Implementations

impl Clone for PatternTreeNode

fn clone(&self) -> PatternTreeNode

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for PatternTreeNode

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

Formats the value using the given formatter.

impl PartialEq for PatternTreeNode

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl Eq for PatternTreeNode

impl StructuralPartialEq for PatternTreeNode