pub struct Membership {
pub over: Core,
pub key: Core,
pub param: VarId,
pub keep: Presence,
}Expand description
One membership test, as the restriction that answers it.
Lookup’s sibling, and the difference is what comes out: a lookup produces a row and this
produces the element the filter was given, kept or dropped. So there is no rewritten body here
— the operator has no per-element function beyond the key, because a predicate the index
answers is not a predicate any more.
Fields§
§over: CoreThe collection whose keys decide, in the caller’s variables: the first argument of the
map_contains.
key: CoreThe key to probe it by, as a function of the element. This is the Fun body of
crate::plan::Op::Restrict.
param: VarIdThe parameter key is written over — the filtered element.
keep: PresenceWhich answer keeps the row: the predicate as written, or its negation.
Auto Trait Implementations§
impl Freeze for Membership
impl RefUnwindSafe for Membership
impl Send for Membership
impl Sync for Membership
impl Unpin for Membership
impl UnwindSafe for Membership
Blanket Implementations§
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