Struct Node 

pub struct Node {
    pub id: String,
    pub kind: String,
    pub label: String,
    pub summary: Option<String>,
    pub route: Option<String>,
    pub source: Option<String>,
    pub status: Option<String>,
    pub external: bool,
    pub facts: BTreeMap<String, Fact>,
}

One node. id is unique within the graph; kind is what the graph’s node_kinds declares it to be; route is where the Cockpit shows the thing itself, when it shows it anywhere.

Fields

id: String

Unique within the graph.

kind: String

One of the graph’s declared node kinds.

label: String

The short label a renderer draws.

summary: Option<String>

One line about the thing, when the source holds one.

route: Option<String>

Where the Cockpit shows this thing, when it shows it.

source: Option<String>

The repository-relative file the node was derived from, when one file owns it.

status: Option<String>

A status word the graph’s own vocabulary defines (accepted, active, query).

external: bool

True when the node stands for something the graph names but does not hold: a reference that resolves to nothing in this repository.

facts: BTreeMap<String, Fact>

What the object’s own kind declares about it, as its schema validated it: the fields of its front matter that are facts about the thing rather than the document itself. A rule carries its class and its statement, a skill its inputs and outputs, a decision its date — the vocabulary that makes each kind worth having, rather than the four fields every kind happens to share.

Trait Implementations

impl Clone for Node

fn clone(&self) -> Node

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Node

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Node

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for Node

impl JsonSchema for Node

fn schema_name() -> Cow<'static, str>

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(generator: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn inline_schema() -> bool

Whether JSON Schemas generated for this type should be included directly in parent schemas, rather than being re-used where possible using the $ref keyword.

impl Ord for Node

fn cmp(&self, other: &Node) -> 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 PartialEq for Node

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

fn partial_cmp(&self, other: &Node) -> 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 Serialize for Node

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Node