Enum ActiveGraph 

pub enum ActiveGraph {
    DefaultGraph,
    AllGraphs,
    Union(Vec<GraphName>),
    AnyNamedGraph,
}

The active graph defines which graphs can partake in the pattern matching process.

Variants

DefaultGraph

Only the default graph forms the active graph.

AllGraphs

Any graph, including the default graph, form the active graph.

Union(Vec<GraphName>)

A set of graphs form the active graph. This allows expressing the user-intent of queries that use the FROM and FROM NAMED clause.

AnyNamedGraph

Any named graph is part of the active graph. This corresponds to GRAPH ?x { ... } patterns with no explicitly defined set of named graphs in the RDF data set.

Trait Implementations

impl Clone for ActiveGraph

fn clone(&self) -> ActiveGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ActiveGraph

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

Formats the value using the given formatter.

impl Default for ActiveGraph

fn default() -> ActiveGraph

Returns the “default value” for a type.

impl Display for ActiveGraph

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

Formats the value using the given formatter.

impl Hash for ActiveGraph

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 PartialEq for ActiveGraph

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

impl StructuralPartialEq for ActiveGraph