Enum FilterResolved

pub enum FilterResolved {
    Eq(Attribute, PartialValue, Option<NonZeroU8>),
    Cnt(Attribute, PartialValue, Option<NonZeroU8>),
    Stw(Attribute, PartialValue, Option<NonZeroU8>),
    Enw(Attribute, PartialValue, Option<NonZeroU8>),
    Pres(Attribute, Option<NonZeroU8>),
    LessThan(Attribute, PartialValue, Option<NonZeroU8>),
    Or(Vec<FilterResolved>, Option<NonZeroU8>),
    And(Vec<FilterResolved>, Option<NonZeroU8>),
    Inclusion(Vec<FilterResolved>, Option<NonZeroU8>),
    AndNot(Box<FilterResolved>, Option<NonZeroU8>),
}

This is the fully resolved internal representation. Note the lack of Not and selfUUID because these are resolved into And(Pres(class), AndNot(term)) and Eq(uuid, …). Importantly, we make this accessible to Entry so that it can then match on filters internally.

Each filter that has been resolved also has been enriched with metadata about its index, and index slope. For the purpose of this module, consider slope as a “weight” where small value - faster index, larger value - slower index. This metadata is extremely important for the query optimiser to make decisions about how to re-arrange queries correctly.

Variants

Eq(Attribute, PartialValue, Option<NonZeroU8>)

Cnt(Attribute, PartialValue, Option<NonZeroU8>)

Stw(Attribute, PartialValue, Option<NonZeroU8>)

Enw(Attribute, PartialValue, Option<NonZeroU8>)

Pres(Attribute, Option<NonZeroU8>)

LessThan(Attribute, PartialValue, Option<NonZeroU8>)

Or(Vec<FilterResolved>, Option<NonZeroU8>)

And(Vec<FilterResolved>, Option<NonZeroU8>)

Inclusion(Vec<FilterResolved>, Option<NonZeroU8>)

AndNot(Box<FilterResolved>, Option<NonZeroU8>)

Implementations

impl FilterResolved

pub fn is_andnot(&self) -> bool

Trait Implementations

impl Clone for FilterResolved

fn clone(&self) -> FilterResolved

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for FilterResolved

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

Formats the value using the given formatter.

impl Ord for FilterResolved

fn cmp(&self, rhs: &FilterResolved) -> Ordering

Ordering of filters for optimisation and subsequent dead term elimination.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for FilterResolved

fn eq(&self, rhs: &FilterResolved) -> 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 PartialOrd for FilterResolved

fn partial_cmp(&self, rhs: &FilterResolved) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Eq for FilterResolved