Struct TileSet34 

pub struct TileSet34(pub [u8; 34]);

Histogram for all 34 kinds of normal tiles (red 5’s are treated as normal 5’s). Can be directly indexed with Tile.

Tuple Fields

0: [u8; 34]

Implementations

impl TileSet34

pub fn new(__0: [u8; 34]) -> TileSet34

impl TileSet34

pub const fn empty_set() -> Self

An empty tile set.

pub const fn complete_set() -> Self

The complete set of tiles in a game, without differentiating red 5’s from normal 5’s. The total number of tiles is 136 (34 x 4).

pub fn from_packed(packed: [u32; 4]) -> Self

Reconstructs the histogram from its packed representation.

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

Compresses the histogram so that each element takes 3 bits (valid range 0..=4). This results in 4 x 27-bit integers, one for each suit.

Conveniently, this is 1 digit per element in octal.

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

Iterates through all tiles in this tile set, in encoding order.

Trait Implementations

impl Clone for TileSet34

fn clone(&self) -> TileSet34

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TileSet34

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

Formats the value using the given formatter.

impl Default for TileSet34

fn default() -> Self

Returns the “default value” for a type.

impl Display for TileSet34

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; 34]> for TileSet34

fn from(original: [u8; 34]) -> TileSet34

Converts to this type from the input type.

impl From<TileSet34> for [u8; 34]

fn from(original: TileSet34) -> Self

Converts to this type from the input type.

impl From<TileSet34> for TileMask34

fn from(ts34: TileSet34) -> Self

Converts to this type from the input type.

impl FromIterator<Tile> for TileSet34

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

Creates a value from an iterator.

impl Index<Tile> for TileSet34

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 TileSet34

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

type Output = <[u8; 34] 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 TileSet34

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

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

impl<__IdxT> IndexMut<__IdxT> for TileSet34

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

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

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

impl IntoIterator for TileSet34

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

The type of the elements being iterated over.

type IntoIter = <[u8; 34] 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 TileSet34

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

impl StructuralPartialEq for TileSet34