Trait MergeState

pub trait MergeState {
    type A;
    type B;

    // Required methods
    fn a_slice(&self) -> &[Self::A];
    fn b_slice(&self) -> &[Self::B];
}

The read part of the merge state that is needed for the binary merge algorithm it just needs random access for the remainder of a and b

Very often A and B are the same type, but this is not strictly necessary

Required Associated Types

type A

Element type for a

type B

Element type for b

Required Methods

fn a_slice(&self) -> &[Self::A]

The remaining data in a

fn b_slice(&self) -> &[Self::B]

The remaining data in b

Implementors