pub struct AggregateExecutor;Expand description
Executes SPARQL 1.1 aggregate operations.
Implementations§
Source§impl AggregateExecutor
impl AggregateExecutor
Sourcepub fn group_by(
rows: &[HashMap<String, String>],
group_vars: &[String],
) -> HashMap<GroupKey, Vec<HashMap<String, String>>>
pub fn group_by( rows: &[HashMap<String, String>], group_vars: &[String], ) -> HashMap<GroupKey, Vec<HashMap<String, String>>>
Partition rows into groups based on the values of group_vars.
Rows that do not bind a group variable get an empty string for that variable.
If group_vars is empty, all rows form a single group with an empty key.
Sourcepub fn apply(
func: &AggregateFunc,
var: &str,
group: &[HashMap<String, String>],
) -> AggregateValue
pub fn apply( func: &AggregateFunc, var: &str, group: &[HashMap<String, String>], ) -> AggregateValue
Apply an aggregate function over a single group.
var is the name of the variable being aggregated.
Sourcepub fn execute(
rows: &[HashMap<String, String>],
group_vars: &[String],
aggregates: &[(String, AggregateFunc, String)],
) -> Vec<AggregateResult>
pub fn execute( rows: &[HashMap<String, String>], group_vars: &[String], aggregates: &[(String, AggregateFunc, String)], ) -> Vec<AggregateResult>
Execute aggregate functions over all groups, returning sorted results.
aggregates is a list of (input_var, func, output_var) triples.
Sourcepub fn having_filter(
results: &[AggregateResult],
var: &str,
op: &str,
value: &str,
) -> Vec<AggregateResult>
pub fn having_filter( results: &[AggregateResult], var: &str, op: &str, value: &str, ) -> Vec<AggregateResult>
Filter aggregate results using a HAVING-like condition.
Compares the AggregateValue bound to var against value using op.
Supported operators: "=", "!=", "<", ">", "<=", ">=".
Auto Trait Implementations§
impl Freeze for AggregateExecutor
impl RefUnwindSafe for AggregateExecutor
impl Send for AggregateExecutor
impl Sync for AggregateExecutor
impl Unpin for AggregateExecutor
impl UnsafeUnpin for AggregateExecutor
impl UnwindSafe for AggregateExecutor
Blanket Implementations§
Source§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
Source§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Converts
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Converts
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further
downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Converts
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Converts
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> DowncastSend for T
impl<T> DowncastSend for T
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
impl<T> Fruit for T
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.