Struct NodeID

pub struct NodeID {
    pub label: String,
    pub uuid: Uuid,
}

A unique identifier for a node in the graph, it’s composed of a label and a UUID. By design the only thing the runtime needs to know about a node is its UUID. But for debugging purposes, we also keep the label.

Fields

label: String

uuid: Uuid

Implementations

impl NodeID

pub fn new(label: impl Into<String>) -> NodeID

Creates a new NodeID with a random UUID and the given label.

pub fn input(&self, input: impl Into<String>) -> InputID

Creates a new InputID with the given label. The UUID is generated from its label and the node’s UUID.

pub fn output(&self, output: impl Into<String>) -> OutputID

Creates a new OutputID with the given label. The UUID is generated from its label and the node’s UUID.

pub fn query(&self, query: impl Into<String>) -> QueryID

Creates a new QueryID with the given label. The UUID is generated from its label and the node’s UUID.

pub fn queryable(&self, queryable: impl Into<String>) -> QueryableID

Creates a new QueryableID with the given label. The UUID is generated from its label and the node’s UUID.

Trait Implementations

impl Clone for NodeID

fn clone(&self) -> NodeID

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NodeID

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

Formats the value using the given formatter.

impl Hash for NodeID

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

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 PartialEq for NodeID

fn eq(&self, other: &NodeID) -> 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 Eq for NodeID

impl StructuralPartialEq for NodeID