Struct TileSet37 

pub struct TileSet37(pub [u8; 37]);

Histogram for all 37 kinds of tiles (including reds). Can be directly indexed with Tile.

Tuple Fields

0: [u8; 37]

Implementations

impl TileSet37

pub fn new(__0: [u8; 37]) -> TileSet37

impl TileSet37

pub const fn empty_set() -> Self

An empty tile set.

pub const fn complete_set(num_reds: [u8; 3]) -> Self

The complete set of tiles in a game, given the number of red 5’s in play. Each red 5 replaces its corresponding normal 5; the total number of tiles remains 136 (34 x 4).

pub fn packed_34(&self) -> [u32; 4]

Same as super::TileSet34::packed_34, but collapsing red 5’s into normal 5’s.

pub fn iter_tiles(&self) -> impl Iterator<Item = Tile>

Iterates through all tiles in this tile set, in encoding order (i.e. reds come after honors).

Trait Implementations

impl Clone for TileSet37

fn clone(&self) -> TileSet37

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TileSet37

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

Formats the value using the given formatter.

impl Default for TileSet37

fn default() -> Self

Returns the “default value” for a type.

impl Display for TileSet37

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

Formats the value using the given formatter.

impl From<&TileSet37> for TileSet34

fn from(original: &TileSet37) -> Self

Converts to this type from the input type.

impl From<[u8; 37]> for TileSet37

fn from(original: [u8; 37]) -> TileSet37

Converts to this type from the input type.

impl From<TileSet37> for [u8; 37]

fn from(original: TileSet37) -> Self

Converts to this type from the input type.

impl From<TileSet37> for TileMask34

fn from(ts37: TileSet37) -> Self

Converts to this type from the input type.

impl FromIterator<Tile> for TileSet37

fn from_iter<T: IntoIterator<Item = Tile>>(tiles: T) -> Self

Creates a value from an iterator.

impl Index<Tile> for TileSet37

type Output = u8

The returned type after indexing.

fn index(&self, tile: Tile) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<__IdxT> Index<__IdxT> for TileSet37

where [u8; 37]: Index<__IdxT>,

type Output = <[u8; 37] as Index<__IdxT>>::Output

The returned type after indexing.

fn index(&self, idx: __IdxT) -> &Self::Output

Performs the indexing (container[index]) operation.

impl IndexMut<Tile> for TileSet37

fn index_mut(&mut self, tile: Tile) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<__IdxT> IndexMut<__IdxT> for TileSet37

where [u8; 37]: IndexMut<__IdxT>,

fn index_mut(&mut self, idx: __IdxT) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl IntoIterator for TileSet37

type Item = <[u8; 37] as IntoIterator>::Item

The type of the elements being iterated over.

type IntoIter = <[u8; 37] as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for TileSet37

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

impl StructuralPartialEq for TileSet37