Struct Grid 

pub struct Grid {
    pub rows: usize,
    pub tile_cost: NonZeroUsize,
}

A grid that Strategy::run_tiles can cut, made of rows passes over the run’s columns. Finishing a tile costs a fixed tile_cost cells.

A tile is one row over a contiguous range of columns, and a run pays tile_cost once per tile, so every cut of a row adds a finish. Three rows over eight columns, as a serial run and as two workers A and B might cut them ([ ] marks a tile):

             serial              whole rows           shares of cells
row 0   [A A A A A A A A]     [A A A A A A A A]     [A A A A A A A A]
row 1   [A A A A A A A A]     [B B B B B B B B]     [A A A A][B B B B]
row 2   [A A A A A A A A]     [A A A A A A A A]     [B B B B B B B B]

        3 tiles on the        3 tiles: A claimed    4 tiles: 12 cells and
        calling thread        row 2 after row 0     2 finishes per worker

Here whole rows leave A 16 cells and two finishes against B’s eight and one, while shares balance the cells at the price of a cut in row 1. Which cut finishes first depends on tile_cost, and Tiles describes how a run chooses and how workers claim.

Fields

rows: usize

Passes over the columns.

tile_cost: NonZeroUsize

The cost of finishing a tile, in cells.

Trait Implementations

impl Clone for Grid

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Grid

impl Debug for Grid

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

Formats the value using the given formatter.

impl Eq for Grid

impl PartialEq for Grid

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Grid