Struct CoordGraph

pub struct CoordGraph<C> { /* private fields */ }

Implementations

impl<C> CoordGraph<C>

pub fn new() -> Self

impl<C> CoordGraph<C>

where C: Ord,

pub fn contains_node<C0>(&self, location: CoordPair<&C0>) -> bool

where C: Borrow<C0>, C0: Ord,

pub fn node<C0>(&self, location: CoordPair<&C0>) -> Option<Node>

where C: Borrow<C0>, C0: Ord,

pub fn node_with_location<C0>( &self, location: CoordPair<&C0>, ) -> Option<(CoordPair<&C>, Node)>

where C: Borrow<C0>, C0: Ord,

impl<C> CoordGraph<C>

where C: Ord + Clone,

pub fn insert_node(&mut self, node: CoordPair<C>) -> bool

impl<C> CoordGraph<C>

where C: Ord + Clone + Add<Output = C> + Sub<Output = C>,

pub fn remove_node( &mut self, location: CoordPair<C>, ) -> Result<bool, ConnectError<C>>

pub fn connected( &self, origin: CoordPair<C>, destiny: CoordPair<C>, ) -> Result<bool, ConnectError<C>>

pub fn connect( &mut self, origin: CoordPair<C>, destiny: CoordPair<C>, ) -> Result<bool, ConnectError<C>>

pub fn disconnect( &mut self, origin: CoordPair<C>, destiny: CoordPair<C>, ) -> Result<bool, ConnectError<C>>

impl<C> CoordGraph<C>

pub fn iter(&self, higher_axis: Axis) -> Iter<'_, C>

pub fn rows(&self) -> Iter<'_, C>

pub fn columns(&self) -> Iter<'_, C>

pub fn locations(&self, higher_axis: Axis) -> Locations<'_, C>

pub fn location_rows(&self) -> Locations<'_, C>

pub fn location_columns(&self) -> Locations<'_, C>

pub fn nodes(&self, higher_axis: Axis) -> Nodes<'_, C>

pub fn node_rows(&self) -> Nodes<'_, C>

pub fn node_columns(&self) -> Nodes<'_, C>

impl<C> CoordGraph<C>

where C: Clone,

pub fn into_iter_with(self, higher_axis: Axis) -> IntoIter<C>

pub fn into_rows(self) -> IntoIter<C>

pub fn into_columns(self) -> IntoIter<C>

pub fn into_locations(self, higher_axis: Axis) -> IntoLocations<C>

pub fn into_location_rows(self) -> IntoLocations<C>

pub fn into_location_columns(self) -> IntoLocations<C>

impl<C> CoordGraph<C>

pub fn into_nodes(self, higher_axis: Axis) -> IntoNodes<C>

pub fn into_node_rows(self) -> IntoNodes<C>

pub fn into_node_columns(self) -> IntoNodes<C>

impl<C> CoordGraph<C>

where C: Ord,

pub fn neighbors<'q, 'a, C0>( &'a self, location: CoordPair<&'q C0>, direction: Direction, ) -> Neighbors<'q, 'a, C0, C>

where C: Borrow<C0>, C0: Ord,

pub fn neighbors_inclusive<'q, 'a, C0>( &'a self, location: CoordPair<&'q C0>, direction: Direction, ) -> Neighbors<'q, 'a, C0, C>

where C: Borrow<C0>, C0: Ord,

Trait Implementations

impl<C: Clone> Clone for CoordGraph<C>

fn clone(&self) -> CoordGraph<C>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<C: Debug> Debug for CoordGraph<C>

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

Formats the value using the given formatter.

impl<C> Default for CoordGraph<C>

fn default() -> Self

Returns the “default value” for a type.

impl<C: Hash> Hash for CoordGraph<C>

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<'a, C> IntoIterator for &'a CoordGraph<C>

where C: Clone,

type IntoIter = Iter<'a, C>

Which kind of iterator are we turning this into?

type Item = (CoordPair<&'a C>, Node)

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<C> IntoIterator for CoordGraph<C>

where C: Clone,

type IntoIter = IntoIter<C>

Which kind of iterator are we turning this into?

type Item = (CoordPair<C>, Node)

The type of the elements being iterated over.

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<C: Ord> Ord for CoordGraph<C>

fn cmp(&self, other: &CoordGraph<C>) -> 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<C: PartialEq> PartialEq for CoordGraph<C>

fn eq(&self, other: &CoordGraph<C>) -> 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<C: PartialOrd> PartialOrd for CoordGraph<C>

fn partial_cmp(&self, other: &CoordGraph<C>) -> 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<C: Eq> Eq for CoordGraph<C>

impl<C> StructuralPartialEq for CoordGraph<C>