Enum VisualRDFNode 

pub enum VisualRDFNode {
    Reifies,
    Iri {
        label: String,
        url: String,
    },
    BlankNode {
        label: String,
    },
    Literal {
        value: String,
    },
    Predicate {
        label: String,
        url: String,
    },
    NonAssertedTriple(Box<VisualRDFNode>, Box<VisualRDFNode>, Box<VisualRDFNode>),
    AssertedTriple(Box<VisualRDFNode>, Box<VisualRDFNode>, Box<VisualRDFNode>),
}

Represents a visual node in an RDF graph for visualization purposes. Each variant corresponds to different types of RDF terms or special constructs used in rendering RDF graphs.

Variants

Reifies

Special node representing the “reifies” predicate.

Iri

An IRI node with a qualified label and full URL.

Fields

label: String

url: String

BlankNode

A blank node with a label.

Fields

label: String

Literal

A literal value node.

Fields

value: String

Predicate

A predicate IRI node with a qualified label and full URL.

Fields

label: String

url: String

NonAssertedTriple(Box<VisualRDFNode>, Box<VisualRDFNode>, Box<VisualRDFNode>)

A non-asserted triple (subject, predicate, object) as a node.

AssertedTriple(Box<VisualRDFNode>, Box<VisualRDFNode>, Box<VisualRDFNode>)

An asserted triple (subject, predicate, object) as a node.

Implementations

impl VisualRDFNode

Implementation of methods for VisualRDFNode.

pub fn from_predicate<R: Rdf>(rdf: &R, predicate: &R::IRI) -> VisualRDFNode

Creates a VisualRDFNode from a predicate IRI. If the predicate is the special “reifies” IRI, returns Reifies. Otherwise, returns a Predicate with qualified label and URL.

Arguments

• rdf - The RDF data source
• predicate - The predicate IRI

Returns

• VisualRDFNode - The created visual node

pub fn from_subject<R: NeighsRDF>( rdf: &R, subject: &R::Subject, graph: &mut VisualRDFGraph, ) -> Result<Self, RDFError>

Creates a VisualRDFNode from a subject term. Converts the subject to a term and delegates to term_to_visual_node.

Arguments

• rdf - The RDF data source
• subject - The subject term
• graph - The visual graph

Returns

• Result<Self, RDFError> - The visual node or an error

pub fn from_term<R: NeighsRDF>( rdf: &R, term: &R::Term, graph: &mut VisualRDFGraph, ) -> Result<Self, RDFError>

Creates a VisualRDFNode from a general term. Delegates to term_to_visual_node.

Arguments

• rdf - The RDF data source
• term - The term to convert
• graph - The visual graph

Returns

• Result<Self, RDFError> - The visual node or an error

pub fn non_asserted_triple( s: VisualRDFNode, p: VisualRDFNode, o: VisualRDFNode, ) -> Self

Creates a NonAssertedTriple node from subject, predicate, and object nodes.

Arguments

• s - The subject node
• p - The predicate node
• o - The object node

Returns

• Self - The non-asserted triple node

pub fn asserted_triple( s: VisualRDFNode, p: VisualRDFNode, o: VisualRDFNode, ) -> Self

Creates an AssertedTriple node from subject, predicate, and object nodes.

Arguments

• s - The subject node
• p - The predicate node
• o - The object node

Returns

• Self - The asserted triple node

pub fn as_plantuml( &self, node_id: NodeId, show_if_predicate: bool, _graph: &VisualRDFGraph, ) -> Result<String, RdfVisualizerError>

Converts the node to a PlantUML string representation. The node_id is used for unique identification in the diagram. show_if_predicate controls whether predicate nodes are displayed. Returns a string suitable for PlantUML rendering or an error.

Arguments

• node_id - The unique ID for the node
• show_if_predicate - Whether to show predicate nodes
• _graph - The visual graph (unused)

Returns

• Result<String, RdfVisualizerError> - The PlantUML string or an error

Trait Implementations

impl Clone for VisualRDFNode

fn clone(&self) -> VisualRDFNode

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for VisualRDFNode

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

Formats the value using the given formatter.

impl Display for VisualRDFNode

Implementation of Display for VisualRDFNode. Provides a human-readable string representation of the node.

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

Formats the visual node as a string.

impl Hash for VisualRDFNode

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 VisualRDFNode

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

impl StructuralPartialEq for VisualRDFNode