Struct Path 

pub struct Path<Node, Cost>
where
    Cost: Copy + Default,
{ /* private fields */ }

A node path.

Implementations

impl<Node, Cost> Path<Node, Cost>

where Cost: Copy + Default,

Construction

pub fn new(capacity: usize) -> Self

Creates a new path with the given initial capacity.

impl<Node, Cost> Path<Node, Cost>

where Cost: Copy + Default,

Properties

pub fn nodes(&self) -> &[Node]

Gets the nodes.

pub fn cost(&self) -> Cost

Gets the path cost.

impl<Node, Cost> Path<Node, Cost>

where Cost: Copy + Default,

Mutations

pub fn clear(&mut self)

Clears the path.

pub fn set_cost(&mut self, cost: Cost)

Sets the cost.

pub fn push(&mut self, node: Node)

Adds the node.

pub fn reverse(&mut self)

Reverses the nodes.

Trait Implementations

impl<Node: Clone, Cost> Clone for Path<Node, Cost>

where Cost: Copy + Default + Clone,

fn clone(&self) -> Path<Node, Cost>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<Node: Debug, Cost> Debug for Path<Node, Cost>

where Cost: Copy + Default + Debug,

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

Formats the value using the given formatter.

impl<Node: Hash, Cost> Hash for Path<Node, Cost>

where Cost: Copy + Default + Hash,

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<Node: Ord, Cost> Ord for Path<Node, Cost>

where Cost: Copy + Default + Ord,

fn cmp(&self, other: &Path<Node, Cost>) -> 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<Node: PartialEq, Cost> PartialEq for Path<Node, Cost>

where Cost: Copy + Default + PartialEq,

fn eq(&self, other: &Path<Node, Cost>) -> 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<Node: PartialOrd, Cost> PartialOrd for Path<Node, Cost>

where Cost: Copy + Default + PartialOrd,

fn partial_cmp(&self, other: &Path<Node, Cost>) -> 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<Node: Eq, Cost> Eq for Path<Node, Cost>

where Cost: Copy + Default + Eq,

impl<Node, Cost> StructuralPartialEq for Path<Node, Cost>

where Cost: Copy + Default,