Struct Reach 

pub struct Reach { /* private fields */ }

Where a walker can go from one tile on a budget, with the cheapest path to each tile. Built by reachable.

Implementations

impl Reach

pub fn origin(&self) -> Pos

The tile the walk starts on.

pub fn budget(&self) -> u32

The budget the walk had.

pub fn cost(&self, pos: Pos) -> Option<u32>

The cheapest cost to reach pos, or None if it is out of reach.

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

Whether pos is within reach.

pub fn tiles(&self) -> TileSet

Every tile within reach, the origin included (unless it lies outside the grid).

pub fn path_to(&self, dest: Pos) -> Option<Vec<Pos>>

The cheapest path from the origin to dest, both included, or None if dest is out of reach. Deterministic (see the module docs).

Trait Implementations

impl Clone for Reach

fn clone(&self) -> Reach

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Reach

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

Formats the value using the given formatter.

impl Eq for Reach

impl PartialEq for Reach

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Reach