sparopt::algebra

Enum GraphPattern

Source
pub enum GraphPattern {
Show 17 variants QuadPattern { subject: GroundTermPattern, predicate: NamedNodePattern, object: GroundTermPattern, graph_name: Option<NamedNodePattern>, }, Path { subject: GroundTermPattern, path: PropertyPathExpression, object: GroundTermPattern, graph_name: Option<NamedNodePattern>, }, Join { left: Box<Self>, right: Box<Self>, algorithm: JoinAlgorithm, }, LeftJoin { left: Box<Self>, right: Box<Self>, expression: Expression, algorithm: LeftJoinAlgorithm, }, Lateral { left: Box<Self>, right: Box<Self>, }, Filter { expression: Expression, inner: Box<Self>, }, Union { inner: Vec<Self>, }, Extend { inner: Box<Self>, variable: Variable, expression: Expression, }, Minus { left: Box<Self>, right: Box<Self>, algorithm: MinusAlgorithm, }, Values { variables: Vec<Variable>, bindings: Vec<Vec<Option<GroundTerm>>>, }, OrderBy { inner: Box<Self>, expression: Vec<OrderExpression>, }, Project { inner: Box<Self>, variables: Vec<Variable>, }, Distinct { inner: Box<Self>, }, Reduced { inner: Box<Self>, }, Slice { inner: Box<Self>, start: usize, length: Option<usize>, }, Group { inner: Box<Self>, variables: Vec<Variable>, aggregates: Vec<(Variable, AggregateExpression)>, }, Service { name: NamedNodePattern, inner: Box<Self>, silent: bool, },
}
Expand description

A SPARQL query graph pattern.

Variants§

§

QuadPattern

§

Path

§

Join

Fields

§left: Box<Self>
§right: Box<Self>
§algorithm: JoinAlgorithm
§

LeftJoin

Fields

§left: Box<Self>
§right: Box<Self>
§expression: Expression
§

Lateral

Lateral join i.e. evaluate right for all result row of left

Fields

§left: Box<Self>
§right: Box<Self>
§

Filter

Fields

§expression: Expression
§inner: Box<Self>
§

Union

Fields

§inner: Vec<Self>
§

Extend

Fields

§inner: Box<Self>
§variable: Variable
§expression: Expression
§

Minus

Fields

§left: Box<Self>
§right: Box<Self>
§algorithm: MinusAlgorithm
§

Values

A table used to provide inline values

Fields

§variables: Vec<Variable>
§bindings: Vec<Vec<Option<GroundTerm>>>
§

OrderBy

Fields

§inner: Box<Self>
§expression: Vec<OrderExpression>
§

Project

Fields

§inner: Box<Self>
§variables: Vec<Variable>
§

Distinct

Fields

§inner: Box<Self>
§

Reduced

Fields

§inner: Box<Self>
§

Slice

Fields

§inner: Box<Self>
§start: usize
§length: Option<usize>
§

Group

Fields

§inner: Box<Self>
§variables: Vec<Variable>
§

Service

Fields

§inner: Box<Self>
§silent: bool

Implementations§

Source§

impl GraphPattern

Source

pub fn empty() -> Self

Source

pub fn empty_singleton() -> Self

Source

pub fn is_empty_singleton(&self) -> bool

Source

pub fn join(left: Self, right: Self, algorithm: JoinAlgorithm) -> Self

Source

pub fn lateral(left: Self, right: Self) -> Self

Source

pub fn left_join( left: Self, right: Self, expression: Expression, algorithm: LeftJoinAlgorithm, ) -> Self

Source

pub fn minus(left: Self, right: Self, algorithm: MinusAlgorithm) -> Self

Source

pub fn union(left: Self, right: Self) -> Self

Source

pub fn union_all(args: impl IntoIterator<Item = Self>) -> Self

Source

pub fn filter(inner: Self, expression: Expression) -> Self

Source

pub fn extend(inner: Self, variable: Variable, expression: Expression) -> Self

Source

pub fn values( variables: Vec<Variable>, bindings: Vec<Vec<Option<GroundTerm>>>, ) -> Self

Source

pub fn order_by(inner: Self, expression: Vec<OrderExpression>) -> Self

Source

pub fn project(inner: Self, variables: Vec<Variable>) -> Self

Source

pub fn distinct(inner: Self) -> Self

Source

pub fn reduced(inner: Self) -> Self

Source

pub fn slice(inner: Self, start: usize, length: Option<usize>) -> Self

Source

pub fn group( inner: Self, variables: Vec<Variable>, aggregates: Vec<(Variable, AggregateExpression)>, ) -> Self

Source

pub fn service(inner: Self, name: NamedNodePattern, silent: bool) -> Self

Source

pub fn lookup_used_variables<'a>( &'a self, callback: &mut impl FnMut(&'a Variable), )

Trait Implementations§

Source§

impl Clone for GraphPattern

Source§

fn clone(&self) -> GraphPattern

Returns a copy of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for GraphPattern

Source§

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

Formats the value using the given formatter. Read more
Source§

impl From<&GraphPattern> for GraphPattern

Source§

fn from(pattern: &AlGraphPattern) -> Self

Converts to this type from the input type.
Source§

impl From<&GraphPattern> for GraphPattern

Source§

fn from(pattern: &GraphPattern) -> Self

Converts to this type from the input type.
Source§

impl Hash for GraphPattern

Source§

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher. Read more
1.3.0 · Source§

fn hash_slice<H>(data: &[Self], state: &mut H)
where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher. Read more
Source§

impl PartialEq for GraphPattern

Source§

fn eq(&self, other: &GraphPattern) -> bool

Tests for self and other values to be equal, and is used by ==.
1.0.0 · Source§

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
Source§

impl Eq for GraphPattern

Source§

impl StructuralPartialEq for GraphPattern

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dst: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dst. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V