Struct GraphReportNode

#[non_exhaustive]
pub struct GraphReportNode {
    pub id: String,
    pub label: String,
}

Stable node identity and display label in a graph report snapshot.

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

id: String

Deterministic renderer-safe identifier assigned after label sorting.

label: String

Collapsed or original graph node label.

Implementations

impl GraphReportNode

pub fn new(id: impl Into<String>, label: impl Into<String>) -> Self

Creates one report node.

Trait Implementations

impl Clone for GraphReportNode

fn clone(&self) -> GraphReportNode

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for GraphReportNode

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

Formats the value using the given formatter.

impl Hash for GraphReportNode

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

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

impl StructuralPartialEq for GraphReportNode