Enum Plan 

pub enum Plan {
    Probe,
    Accumulate,
    Merge,
}

How to answer a set operation.

Variants

Probe

Walk the smallest set and question the others about each member.

Accumulate

Walk everything once into one counting table.

Merge

Step through every set at once, in order, comparing and never hashing.

Only possible when every operand is an intset, because that is the only representation that holds its members in order. inter_with will refuse this plan for anything else rather than answer wrongly.

Trait Implementations

impl Clone for Plan

fn clone(&self) -> Plan

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Plan

impl Debug for Plan

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

Formats the value using the given formatter.

impl Eq for Plan

impl PartialEq for Plan

fn eq(&self, other: &Plan) -> bool

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Plan