Struct radicle_dag::Node

pub struct Node<K, V> {
    pub key: K,
    pub value: V,
    pub dependencies: BTreeSet<K>,
    pub dependents: BTreeSet<K>,
}

A node in the graph.

Fields

key: K

The node key.

value: V

The node value, stored by the user.

dependencies: BTreeSet<K>

Nodes depended on.

dependents: BTreeSet<K>

Nodes depending on this node.

Trait Implementations

impl<K, V> Borrow<V> for &Node<K, V>

fn borrow(&self) -> &V

Immutably borrows from an owned value.

impl<K: Clone, V: Clone> Clone for Node<K, V>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for Node<K, V>

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

Formats the value using the given formatter.

impl<K, V> Deref for Node<K, V>

type Target = V

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<K: PartialEq, V: PartialEq> PartialEq for Node<K, V>

fn eq(&self, other: &Node<K, V>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K: Eq, V: Eq> Eq for Node<K, V>

impl<K, V> StructuralPartialEq for Node<K, V>