Struct Vertex

pub struct Vertex<K, V>
where
    K: Key,
    V: Value,
{ /* private fields */ }

A structure describing a vertex with a Key and a Value.

Implementations

impl<K, V> Vertex<K, V>

where K: Key, V: Value,

pub fn new(key: K) -> Self

Create a new vertex with the default value.

pub fn with_value(key: K, value: V) -> Self

Create a new vertex with a value.

pub fn key(&self) -> &K

Get the key of the vertex.

pub fn value(&self) -> &V

Get the value of the vertex.

pub fn set_value(&mut self, value: V)

Set the value of the vertex.

Trait Implementations

impl<K, V> Clone for Vertex<K, V>

where K: Key + Clone, V: Value + Clone,

fn clone(&self) -> Vertex<K, V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K, V> Debug for Vertex<K, V>

where K: Key + Debug, V: Value + Debug,

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

Formats the value using the given formatter.

impl<K, V> Hash for Vertex<K, V>

where K: Key, V: Value,

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<K, V> Ord for Vertex<K, V>

where K: Key, V: Value,

fn cmp(&self, other: &Self) -> 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<K, V> PartialEq for Vertex<K, V>

where K: Key, V: Value,

fn eq(&self, other: &Self) -> 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<K, V> PartialOrd for Vertex<K, V>

where K: Key, V: Value,

fn partial_cmp(&self, other: &Self) -> 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<K, V> Copy for Vertex<K, V>

where K: Key + Copy, V: Value + Copy,

impl<K, V> Eq for Vertex<K, V>

where K: Key, V: Value,