Struct TileSet32 

pub struct TileSet32<const WIDTH: u8, const HEIGHT: u8, const SIZE: usize>(/* private fields */);

A grid A map from tiles to bools. Can store up to 256 tiles.

Implementations

impl<const WIDTH: u8, const HEIGHT: u8, const SIZE: usize> TileSet32<WIDTH, HEIGHT, SIZE>

pub const EMPTY: Self

The set where all tiles are missing

pub const ALL: Self

The set where all tiles are present

pub fn from_fn<F: FnMut(Tile<WIDTH, HEIGHT>) -> bool>(cb: F) -> Self

pub const fn from_inner(inner: u32) -> Self

pub const fn into_inner(self) -> u32

pub const fn is_empty(self) -> bool

pub const fn set_bit(&mut self, tile: &Tile<WIDTH, HEIGHT>, bit: bool)

pub const fn insert(&mut self, tile: &Tile<WIDTH, HEIGHT>) -> bool

pub const fn remove(&mut self, tile: &Tile<WIDTH, HEIGHT>) -> bool

pub const fn with_bit_set(&self, tile: &Tile<WIDTH, HEIGHT>, bit: bool) -> Self

Returns a copy of self with the bit at tile set to bit

pub const fn get_bit(&self, tile: &Tile<WIDTH, HEIGHT>) -> bool

pub const fn iter( &self, ) -> impl DoubleEndedIterator<Item = bool> + ExactSizeIterator

pub const fn row( &self, y: u8, ) -> impl DoubleEndedIterator<Item = bool> + ExactSizeIterator

pub const fn col( &self, x: u8, ) -> impl DoubleEndedIterator<Item = bool> + ExactSizeIterator

pub const fn shift_north(&self, rows: u8) -> Self

pub const fn shift_south(&self, rows: u8) -> Self

pub const fn shift_east(&self) -> Self

pub const fn shift_west(&self) -> Self

pub const fn row_mask(y: u8) -> Self

pub const fn col_mask(x: u8) -> Self

pub fn enumerate( &self, ) -> impl DoubleEndedIterator<Item = (Tile<WIDTH, HEIGHT>, bool)> + ExactSizeIterator

pub const fn iter_true_tiles( &self, ) -> impl ExactSizeIterator<Item = Tile<WIDTH, HEIGHT>> + Clone + Debug + FusedIterator + DoubleEndedIterator

pub const fn count(&self) -> u32

pub const fn get_scale(total_width: f32, total_height: f32) -> f32

Get the scale to make the grid take up as much as possible of a given area

pub const fn intersect(&self, rhs: &Self) -> Self

pub const fn union(&self, rhs: &Self) -> Self

pub const fn except(&self, rhs: &Self) -> Self

pub const fn is_subset(&self, rhs: &Self) -> bool

pub const fn is_superset(&self, rhs: &Self) -> bool

pub const fn symmetric_difference(&self, rhs: &Self) -> Self

Returns a new set containing all elements which belong to one set but not both

pub const fn negate(&self) -> Self

pub const fn first(&self) -> Option<Tile<WIDTH, HEIGHT>>

The first tile in this set

pub const fn pop(&mut self) -> Option<Tile<WIDTH, HEIGHT>>

Removes the first tile in this set and returns it Returns None if the set is empty

pub const fn pop_last(&mut self) -> Option<Tile<WIDTH, HEIGHT>>

Removes the first tile in this set and returns it Returns None if the set is empty

pub const fn last(&self) -> Option<Tile<WIDTH, HEIGHT>>

The last tile in this set

pub const fn tiles_before(&self, tile: Tile<WIDTH, HEIGHT>) -> u32

Returns the number of tiles in the set which are less than this tile. Note that it returns the same result whether or not the given tile is in the set

pub const fn nth(&self, n: u32) -> Option<Tile<WIDTH, HEIGHT>>

Returns the nth tile in the set, if it is present

Trait Implementations

impl<const W: u8, const H: u8, const SIZE: usize> Binary for TileSet32<W, H, SIZE>

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

Formats the value using the given formatter.

impl<const WIDTH: u8, const HEIGHT: u8, const SIZE: usize> Clone for TileSet32<WIDTH, HEIGHT, SIZE>

fn clone(&self) -> TileSet32<WIDTH, HEIGHT, SIZE>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const WIDTH: u8, const HEIGHT: u8, const SIZE: usize> Debug for TileSet32<WIDTH, HEIGHT, SIZE>

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

Formats the value using the given formatter.

impl<const WIDTH: u8, const HEIGHT: u8, const SIZE: usize> Default for TileSet32<WIDTH, HEIGHT, SIZE>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, const WIDTH: u8, const HEIGHT: u8, const SIZE: usize> Deserialize<'de> for TileSet32<WIDTH, HEIGHT, SIZE>

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<const W: u8, const H: u8, const SIZE: usize> Display for TileSet32<W, H, SIZE>

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

Formats the value using the given formatter.

impl<const WIDTH: u8, const HEIGHT: u8, const SIZE: usize> FromIterator<Tile<WIDTH, HEIGHT>> for TileSet32<WIDTH, HEIGHT, SIZE>

fn from_iter<T>(iter: T) -> Self

where T: IntoIterator<Item = Tile<WIDTH, HEIGHT>>,

Creates a value from an iterator.

impl<const WIDTH: u8, const HEIGHT: u8, const SIZE: usize> Hash for TileSet32<WIDTH, HEIGHT, SIZE>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<const WIDTH: u8, const HEIGHT: u8, const SIZE: usize> Ord for TileSet32<WIDTH, HEIGHT, SIZE>

fn cmp(&self, other: &TileSet32<WIDTH, HEIGHT, SIZE>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<const WIDTH: u8, const HEIGHT: u8, const SIZE: usize> PartialEq for TileSet32<WIDTH, HEIGHT, SIZE>

fn eq(&self, other: &TileSet32<WIDTH, HEIGHT, SIZE>) -> 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<const WIDTH: u8, const HEIGHT: u8, const SIZE: usize> PartialOrd for TileSet32<WIDTH, HEIGHT, SIZE>

fn partial_cmp( &self, other: &TileSet32<WIDTH, HEIGHT, SIZE>, ) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<const WIDTH: u8, const HEIGHT: u8, const SIZE: usize> Serialize for TileSet32<WIDTH, HEIGHT, SIZE>

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<const WIDTH: u8, const HEIGHT: u8, const SIZE: usize> Copy for TileSet32<WIDTH, HEIGHT, SIZE>

impl<const WIDTH: u8, const HEIGHT: u8, const SIZE: usize> Eq for TileSet32<WIDTH, HEIGHT, SIZE>

impl<const WIDTH: u8, const HEIGHT: u8, const SIZE: usize> StructuralPartialEq for TileSet32<WIDTH, HEIGHT, SIZE>