Struct TileSizes 

pub struct TileSizes(/* private fields */);

Container representing an ordered, checked list of tile sizes

This object wraps a Vec<usize>, guaranteeing three invariants:

• There must be at least one tile size
• Tiles must be ordered from largest to smallest
• Each tile size must be exactly divisible by subsequent tile sizes

Implementations

impl TileSizes

pub fn new(sizes: &[usize]) -> Result<Self, Error>

Builds a new tile size list, checking invariants

pub fn len(&self) -> usize

Returns the length of the tile list

pub fn iter(&self) -> impl Iterator<Item = &usize>

Returns an iterator over tile sizes (largest to smallest)

Trait Implementations

impl Debug for TileSizes

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

Formats the value using the given formatter.

impl Index<RangeFrom<usize>> for TileSizes

type Output = [usize]

The returned type after indexing.

fn index(&self, index: RangeFrom<usize>) -> &Self::Output

Performs the indexing (container[index]) operation.

impl Index<usize> for TileSizes

type Output = usize

The returned type after indexing.

fn index(&self, i: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl PartialEq for TileSizes

fn eq(&self, other: &TileSizes) -> 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 TileSizes

impl StructuralPartialEq for TileSizes