Struct advent_of_code_2021::day_4::BingoCard

struct BingoCard {
    numbers: HashMap<u8, (usize, usize)>,
    rows: [u8; 5],
    columns: [u8; 5],
}

This represents the key information to know if a 5 x 5 bingo card has won.

Fields

numbers: HashMap<u8, (usize, usize)>

A Map indexing the remaining numbers to their co-ordinates on the grid

rows: [u8; 5]

A counter for each row, tracking how many numbers in that row have been removed

columns: [u8; 5]

A counter for each column, tracking how many numbers in that column have been removed

Implementations

impl BingoCard

fn mark_number(&mut self, number: u8) -> bool

If the card contains the provided number, remove it from the unmarked numbers, increment the count of marked numbers in the relevant row and column, then if either of these are now 5, the card has won - return true, otherwise return false.

If the number is not on the card, nothing changes, and return false.

fn sum_remaining(&self) -> usize

The remaining numbers are the keys of the numbers hash map, as marked numbers are removed from the map.

Trait Implementations

impl Clone for BingoCard

fn clone(&self) -> BingoCard

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for BingoCard

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

Formats the value using the given formatter.

impl PartialEq<BingoCard> for BingoCard

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

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

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

This method tests for !=.

impl Eq for BingoCard

impl StructuralEq for BingoCard

impl StructuralPartialEq for BingoCard