Struct SearchAllPlan 

pub struct SearchAllPlan<P = u32, V = Comparand, N = Count> {
    pub index: P,
    pub store: StorePlan,
    pub count: N,
    pub keys: Vec<SearchKey<V>>,
}

SEARCH ALL’s binary search. The op returns Arm(0) on an occurrence whose keys equal their WHEN terms, for a Branch on the whole condition, and Arm(1) when the search ends without one.

Fields

index: P

The table’s first index, stored by store at each occurrence tried.

store: StorePlan

count: N

keys: Vec<SearchKey<V>>

The keys the WHEN condition tests for equality, in the table’s KEY order.

Trait Implementations

impl<P, V, N> Clone for SearchAllPlan<P, V, N>

where P: Clone, V: Clone, N: Clone,

fn clone(&self) -> SearchAllPlan<P, V, N>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<P, V, N> Debug for SearchAllPlan<P, V, N>

where P: Debug, V: Debug, N: Debug,

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

Formats the value using the given formatter.

impl Decode for SearchAllPlan

fn decode(r: &mut Reader<'_>) -> Result<SearchAllPlan, ModuleError>

impl Encode for SearchAllPlan

fn encode(&self, w: &mut Writer)

impl<P, V, N> Eq for SearchAllPlan<P, V, N>

where P: Eq, V: Eq, N: Eq,

impl<P, V, N> PartialEq for SearchAllPlan<P, V, N>

where P: PartialEq, V: PartialEq, N: PartialEq,

fn eq(&self, other: &SearchAllPlan<P, V, N>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<P, V, N> StructuralPartialEq for SearchAllPlan<P, V, N>

where P: PartialEq, V: PartialEq, N: PartialEq,