Struct Arrows 

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

A non-empty subset of the six directions, as a bitmask.

Two pieces with equal Arrows are interchangeable: the uniqueness guarantee counts placements of the multiset of arrow sets, so swapping identical pieces is not a second solution.

Implementations

impl Arrows

pub fn from_dir(dir: Dir) -> Self

The set containing exactly one direction.

pub fn all() -> Self

The set containing all six directions.

pub fn contains(self, dir: Dir) -> bool

Whether dir is in the set.

pub fn with(self, dir: Dir) -> Self

The set plus dir.

pub fn without(self, dir: Dir) -> Self

The set minus dir.

pub fn len(self) -> usize

How many directions the set holds.

pub fn is_empty(self) -> bool

Whether the set is empty.

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

The directions, clockwise.

Trait Implementations

impl Clone for Arrows

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Arrows

impl Debug for Arrows

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

Formats the value using the given formatter.

impl Default for Arrows

fn default() -> Self

Returns the “default value” for a type.

impl Eq for Arrows

impl Hash for Arrows

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 IntoIterator for Arrows

type Item = Dir

The type of the elements being iterated over.

type IntoIter = IntoIter<Dir>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for Arrows

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Arrows