Enum Eligibility 

pub enum Eligibility {
    Eligible,
    Ineligible(Vec<Boundary>),
}

Verdict for a single rule.

Variants

Eligible

The rule could be planned as a multiway join. Note: this is eligibility, not requirement — the eventual planner is free to lower an Eligible rule as a binary join if its cost model says so. Two-atom rules are Eligible: both multiway and binary are valid lowerings.

Ineligible(Vec<Boundary>)

The rule must fall back to binary-join lowering. Each Boundary in the vector is one independent reason; the list is non-empty.

Implementations

impl Eligibility

pub fn boundaries(&self) -> &[Boundary]

Iterate over boundaries (empty for Eligibility::Eligible).

Trait Implementations

impl Clone for Eligibility

fn clone(&self) -> Eligibility

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Eligibility

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

Formats the value using the given formatter.

impl PartialEq for Eligibility

fn eq(&self, other: &Eligibility) -> 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 Eq for Eligibility

impl StructuralPartialEq for Eligibility