Enum rdf::node::Node
[−]
[src]
pub enum Node { UriNode { uri: Uri, }, LiteralNode { literal: String, data_type: Option<Uri>, language: Option<String>, }, BlankNode { id: String, }, }
Node representation.
Variants
UriNode
Node for representing a URI.
Fields of UriNode
uri: Uri |
LiteralNode
Node for representing literals.
Fields of LiteralNode
literal: String | |
data_type: Option<Uri> | |
language: Option<String> |
BlankNode
Node for representing blanks.
Fields of BlankNode
id: String |
Trait Implementations
impl Clone for Node
[src]
fn clone(&self) -> Node
[src]
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl PartialEq for Node
[src]
fn eq(&self, __arg_0: &Node) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, __arg_0: &Node) -> bool
[src]
This method tests for !=
.
impl PartialOrd for Node
[src]
fn partial_cmp(&self, __arg_0: &Node) -> Option<Ordering>
[src]
This method returns an ordering between self
and other
values if one exists. Read more
fn lt(&self, __arg_0: &Node) -> bool
[src]
This method tests less than (for self
and other
) and is used by the <
operator. Read more
fn le(&self, __arg_0: &Node) -> bool
[src]
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
fn gt(&self, __arg_0: &Node) -> bool
[src]
This method tests greater than (for self
and other
) and is used by the >
operator. Read more
fn ge(&self, __arg_0: &Node) -> bool
[src]
This method tests greater than or equal to (for self
and other
) and is used by the >=
operator. Read more
impl Eq for Node
[src]
impl Ord for Node
[src]
fn cmp(&self, __arg_0: &Node) -> Ordering
[src]
This method returns an Ordering
between self
and other
. Read more
fn max(self, other: Self) -> Self
1.21.0[src]
Compares and returns the maximum of two values. Read more
fn min(self, other: Self) -> Self
1.21.0[src]
Compares and returns the minimum of two values. Read more