Trait binary_merge::MergeState[−][src]

pub trait MergeState {
    type A;
    type B;
    fn a_slice(&self) -> &[Self::A]ⓘ
Notable traits for &'_ mut [u8]
impl<'_> Write for &'_ mut [u8]impl<'_> Read for &'_ [u8]
;

    fn b_slice(&self) -> &[Self::B]ⓘ
Notable traits for &'_ mut [u8]
impl<'_> Write for &'_ mut [u8]impl<'_> Read for &'_ [u8]
;
}
Expand description

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

Associated Types

Element type for a

Element type for b

Required methods

The remaining data in a

The remaining data in b

Implementors