pub enum Predicate {
Compare {
lhs: Expr,
op: Comparison,
rhs: Expr,
},
And(Box<Self>, Box<Self>),
Or(Box<Self>, Box<Self>),
Not(Box<Self>),
Between {
value: Expr,
lower: Expr,
upper: Expr,
closure: IntervalClosure,
},
}Expand description
Boolean expression used to select events from a dataset.
Variants§
Compare
Compare two scalar expressions.
Fields
§
op: ComparisonComparison operation.
And(Box<Self>, Box<Self>)
Require both child predicates to hold.
Or(Box<Self>, Box<Self>)
Require either child predicate to hold.
Not(Box<Self>)
Negate a predicate.
Between
Test whether a value lies between two bounds.
Implementations§
Source§impl Predicate
impl Predicate
Sourcepub fn compare(
lhs: impl Into<Expr>,
op: Comparison,
rhs: impl Into<Expr>,
) -> Self
pub fn compare( lhs: impl Into<Expr>, op: Comparison, rhs: impl Into<Expr>, ) -> Self
Creates a comparison predicate.
Sourcepub fn le(lhs: impl Into<Expr>, rhs: impl Into<Expr>) -> Self
pub fn le(lhs: impl Into<Expr>, rhs: impl Into<Expr>) -> Self
Creates a less-than-or-equal predicate.
Sourcepub fn gt(lhs: impl Into<Expr>, rhs: impl Into<Expr>) -> Self
pub fn gt(lhs: impl Into<Expr>, rhs: impl Into<Expr>) -> Self
Creates a greater-than predicate.
Sourcepub fn ge(lhs: impl Into<Expr>, rhs: impl Into<Expr>) -> Self
pub fn ge(lhs: impl Into<Expr>, rhs: impl Into<Expr>) -> Self
Creates a greater-than-or-equal predicate.
Sourcepub fn between(
value: impl Into<Expr>,
lower: impl Into<Expr>,
upper: impl Into<Expr>,
) -> Self
pub fn between( value: impl Into<Expr>, lower: impl Into<Expr>, upper: impl Into<Expr>, ) -> Self
Creates a closed-interval predicate.
Sourcepub fn between_with(
value: impl Into<Expr>,
lower: impl Into<Expr>,
upper: impl Into<Expr>,
closure: IntervalClosure,
) -> Self
pub fn between_with( value: impl Into<Expr>, lower: impl Into<Expr>, upper: impl Into<Expr>, closure: IntervalClosure, ) -> Self
Creates an interval predicate with an explicit endpoint policy.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Predicate
impl RefUnwindSafe for Predicate
impl Send for Predicate
impl Sync for Predicate
impl Unpin for Predicate
impl UnsafeUnpin for Predicate
impl UnwindSafe for Predicate
Blanket Implementations§
impl<T> Allocation for T
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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
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.