Enum RHS 

pub enum RHS<'a, R> {
    Unsorted(&'a [R]),
    Sorted(&'a [R]),
}

A wrapper around the right-hand side of your join.

Variants

Unsorted(&'a [R])

Input which is not (necessarily) sorted. Searches of RHS will be O(n).

This variant can be explicitly created with RHS::new_unsorted or implicitly via the impl From<&[R]>.

Sorted(&'a [R])

Input which is known to be sorted according to the join predicate. Searches of RHS will be O(lg n)

This variant is explicitly created with RHS::new_sorted

Implementations

impl<'a, R> RHS<'a, R>

pub fn new_unsorted(rhs: &'a [R]) -> Self

Create a new RHS from the given slice.

Provided records will be searched linearly.

pub fn new_sorted(rhs: &'a [R]) -> Self

Create a new RHS from the given slice where records are assumed to be sorted according to how they will be searched.

Provided records will be binary searched, yielding faster searches.

Trait Implementations

impl<'a, R> From<&'a [R]> for RHS<'a, R>

fn from(rhs: &'a [R]) -> Self

Converts to this type from the input type.