Struct TileSet 

pub struct TileSet { /* private fields */ }

A set of tiles of a width × height map, stored as a bitset. Iterates in row-major order. Positions outside the map are never members.

Implementations

impl TileSet

pub fn new(width: u16, height: u16) -> Self

An empty set for a width × height map.

pub fn width(&self) -> u16

Map width.

pub fn height(&self) -> u16

Map height.

pub fn contains(&self, pos: Pos) -> bool

Whether pos is in the set.

pub fn insert(&mut self, pos: Pos) -> bool

Adds pos; returns whether it was newly added (false if already a member or outside the map).

pub fn union_with(&mut self, other: &TileSet)

Adds every member of other that lies inside this set’s map.

pub fn len(&self) -> usize

Number of members.

pub fn is_empty(&self) -> bool

Whether the set has no members.

pub fn iter(&self) -> impl Iterator<Item = Pos> + '_

Every member, row-major.

Trait Implementations

impl Clone for TileSet

fn clone(&self) -> TileSet

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TileSet

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

Formats the value using the given formatter.

impl Eq for TileSet

impl PartialEq for TileSet

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for TileSet