Struct Node 

pub struct Node<'a> {
    pub id: Option<u32>,
    pub other: HashMap<Cow<'a, str>, Value<'a>>,
}

A graph node with an id and other key-value pairs.

Fields

id: Option<u32>

other: HashMap<Cow<'a, str>, Value<'a>>

Implementations

impl<'a> Node<'a>

pub fn new<K>(id: Option<u32>, other: HashMap<K, Value<'a>>) -> Self

where K: Into<Cow<'a, str>>,

pub fn upgrade_to_owned(&self) -> Node<'static>

Convert any borrowed references to owned values.

Trait Implementations

impl<'a> Clone for Node<'a>

fn clone(&self) -> Node<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for Node<'a>

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

Formats the value using the given formatter.

impl<'a> PartialEq for Node<'a>

fn eq(&self, other: &Node<'a>) -> 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<'a> StructuralPartialEq for Node<'a>