Struct NamedNodeRef

pub struct NamedNodeRef<'a> { /* private fields */ }

A borrowed RDF IRI.

The default string formatter is returning an N-Triples, Turtle, and SPARQL compatible representation:

use oxrdf::NamedNodeRef;

assert_eq!(
    "<http://example.com/foo>",
    NamedNodeRef::new("http://example.com/foo")?.to_string()
);

Implementations

impl<'a> NamedNodeRef<'a>

pub fn new(iri: &'a str) -> Result<NamedNodeRef<'a>, IriParseError>

Builds and validate an RDF IRI

pub const fn new_unchecked(iri: &'a str) -> NamedNodeRef<'a>

Builds an RDF IRI from a string.

It is the caller’s responsibility to ensure that iri is a valid IRI.

NamedNode::new() is a safe version of this constructor and should be used for untrusted data.

pub const fn as_str(self) -> &'a str

pub fn into_owned(self) -> NamedNode

Trait Implementations

impl<'a> Clone for NamedNodeRef<'a>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for NamedNodeRef<'a>

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

Formats the value using the given formatter.

impl Display for NamedNodeRef<'_>

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

Formats the value using the given formatter.

impl<'a> From<&'a NamedNode> for NamedNodeRef<'a>

fn from(node: &'a NamedNode) -> NamedNodeRef<'a>

Converts to this type from the input type.

impl<'a> From<Iri<&'a str>> for NamedNodeRef<'a>

fn from(iri: Iri<&'a str>) -> NamedNodeRef<'a>

Converts to this type from the input type.

impl From<NamedNodeRef<'_>> for GraphName

fn from(node: NamedNodeRef<'_>) -> GraphName

Converts to this type from the input type.

impl From<NamedNodeRef<'_>> for NamedNode

fn from(node: NamedNodeRef<'_>) -> NamedNode

Converts to this type from the input type.

impl From<NamedNodeRef<'_>> for NamedOrBlankNode

fn from(node: NamedNodeRef<'_>) -> NamedOrBlankNode

Converts to this type from the input type.

impl From<NamedNodeRef<'_>> for Subject

fn from(node: NamedNodeRef<'_>) -> Subject

Converts to this type from the input type.

impl From<NamedNodeRef<'_>> for Term

fn from(node: NamedNodeRef<'_>) -> Term

Converts to this type from the input type.

impl<'a> From<NamedNodeRef<'a>> for GraphNameRef<'a>

fn from(node: NamedNodeRef<'a>) -> GraphNameRef<'a>

Converts to this type from the input type.

impl<'a> From<NamedNodeRef<'a>> for NamedOrBlankNodeRef<'a>

fn from(node: NamedNodeRef<'a>) -> NamedOrBlankNodeRef<'a>

Converts to this type from the input type.

impl<'a> From<NamedNodeRef<'a>> for SubjectRef<'a>

fn from(node: NamedNodeRef<'a>) -> SubjectRef<'a>

Converts to this type from the input type.

impl<'a> From<NamedNodeRef<'a>> for TermRef<'a>

fn from(node: NamedNodeRef<'a>) -> TermRef<'a>

Converts to this type from the input type.

impl<'a> Hash for NamedNodeRef<'a>

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<'a> Ord for NamedNodeRef<'a>

fn cmp(&self, other: &NamedNodeRef<'a>) -> 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<&str> for NamedNodeRef<'_>

fn eq(&self, other: &&str) -> 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 PartialEq<NamedNode> for NamedNodeRef<'_>

fn eq(&self, other: &NamedNode) -> 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 PartialEq<NamedNodeRef<'_>> for &str

fn eq(&self, other: &NamedNodeRef<'_>) -> 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 PartialEq<NamedNodeRef<'_>> for NamedNode

fn eq(&self, other: &NamedNodeRef<'_>) -> 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 PartialEq<NamedNodeRef<'_>> for str

fn eq(&self, other: &NamedNodeRef<'_>) -> 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 PartialEq<str> for NamedNodeRef<'_>

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

fn eq(&self, other: &NamedNodeRef<'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 PartialOrd<NamedNode> for NamedNodeRef<'_>

fn partial_cmp(&self, other: &NamedNode) -> 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 PartialOrd<NamedNodeRef<'_>> for NamedNode

fn partial_cmp(&self, other: &NamedNodeRef<'_>) -> 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<'a> PartialOrd for NamedNodeRef<'a>

fn partial_cmp(&self, other: &NamedNodeRef<'a>) -> 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<'a> Copy for NamedNodeRef<'a>

impl<'a> Eq for NamedNodeRef<'a>

impl<'a> StructuralPartialEq for NamedNodeRef<'a>