Enum GraphName 

pub enum GraphName {
    NamedNode(NamedNode),
    BlankNode(BlankNode),
    Variable(Variable),
    DefaultGraph,
}

Union type for terms that can be graph names

Variants

NamedNode(NamedNode)

BlankNode(BlankNode)

Variable(Variable)

DefaultGraph

Implementations

impl GraphName

pub fn is_default_graph(&self) -> bool

Returns true if this is the default graph

Trait Implementations

impl AsRef<str> for GraphName

fn as_ref(&self) -> &str

Converts this type into a shared reference of the (usually inferred) input type.

impl Clone for GraphName

fn clone(&self) -> GraphName

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphName

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for GraphName

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Display for GraphName

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

Formats the value using the given formatter.

impl Eq for GraphName

impl<'a> From<&'a GraphName> for GraphNameRef<'a>

fn from(graph_name: &'a GraphName) -> Self

Converts to this type from the input type.

impl From<BlankNode> for GraphName

fn from(node: BlankNode) -> Self

Converts to this type from the input type.

impl From<NamedNode> for GraphName

fn from(node: NamedNode) -> Self

Converts to this type from the input type.

impl From<NamedOrBlankNode> for GraphName

fn from(node: NamedOrBlankNode) -> Self

Converts to this type from the input type.

impl From<Variable> for GraphName

fn from(variable: Variable) -> Self

Converts to this type from the input type.

impl Hash for GraphName

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 Ord for GraphName

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

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

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

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 GraphName