Struct Lookbacks 

pub struct Lookbacks<TC, VC = Vec<u8>, CC = Vec<u64>, RC = Vec<u64>, WC = [u64; 2], const N: u8 = u8::MAX> {
    pub inner: Results<TC, VC, CC, RC, WC>,
}

Fields

inner: Results<TC, VC, CC, RC, WC>

Ok(x) encodes a value, and Err(y) indicates a value y back.

Trait Implementations

impl<'a, TC: AsBytes<'a>, VC: AsBytes<'a>, CC: AsBytes<'a>, RC: AsBytes<'a>> AsBytes<'a> for Lookbacks<TC, VC, CC, RC, &'a [u64]>

fn as_bytes(&self) -> impl Iterator<Item = (u64, &'a [u8])>

Presents self as a sequence of byte slices, with their required alignment.

impl<TC: Borrow, const N: u8> Borrow for Lookbacks<TC, Vec<u8>, Vec<u64>, Vec<u64>, [u64; 2], N>

type Ref<'a> = <TC as Borrow>::Ref<'a> where TC: 'a

For each lifetime, a reference with that lifetime.

type Borrowed<'a> = Lookbacks<<TC as Borrow>::Borrowed<'a>, &'a [u8], &'a [u64], &'a [u64], &'a [u64], N> where TC: 'a

The type of a borrowed container.

fn borrow<'a>(&'a self) -> Self::Borrowed<'a>

Converts a reference to the type to a borrowed variant.

fn reborrow<'b, 'a: 'b>(thing: Self::Borrowed<'a>) -> Self::Borrowed<'b>

where TC: 'a,

Reborrows the borrowed type to a shorter lifetime. See Columnar::reborrow for details.

fn reborrow_ref<'b, 'a: 'b>(thing: Self::Ref<'a>) -> Self::Ref<'b>

where Self: 'a,

Reborrows the borrowed type to a shorter lifetime. See Columnar::reborrow for details.

impl<TC: Clear, const N: u8> Clear for Lookbacks<TC, Vec<u8>, Vec<u64>, Vec<u64>, [u64; 2], N>

fn clear(&mut self)

Clears self, without changing its capacity.

impl<TC: Clone, VC: Clone, CC: Clone, RC: Clone, WC: Clone, const N: u8> Clone for Lookbacks<TC, VC, CC, RC, WC, N>

fn clone(&self) -> Lookbacks<TC, VC, CC, RC, WC, N>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<TC: Container, const N: u8> Container for Lookbacks<TC, Vec<u8>, Vec<u64>, Vec<u64>, [u64; 2], N>

where for<'a> &'a TC: Index, for<'a> TC::Ref<'a>: PartialEq, for<'a, 'b> <&'a TC as Index>::Ref: PartialEq<TC::Ref<'b>>,

fn reserve_for<'a, I>(&mut self, selves: I)

where Self: 'a, I: Iterator<Item = Self::Borrowed<'a>> + Clone,

fn with_capacity_for<'a, I>(selves: I) -> Self

where Self: 'a, I: Iterator<Item = Self::Borrowed<'a>> + Clone,

Allocates an empty container that can be extended by selves without reallocation.

fn extend_from_self(&mut self, other: Self::Borrowed<'_>, range: Range<usize>)

Extends self by a range in other.

impl<TC: Debug, VC: Debug, CC: Debug, RC: Debug, WC: Debug, const N: u8> Debug for Lookbacks<TC, VC, CC, RC, WC, N>

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

Formats the value using the given formatter.

impl<TC: Default, VC: Default, CC: Default, RC: Default, WC: Default, const N: u8> Default for Lookbacks<TC, VC, CC, RC, WC, N>

fn default() -> Lookbacks<TC, VC, CC, RC, WC, N>

Returns the “default value” for a type.

impl<'a, TC: FromBytes<'a>, VC: FromBytes<'a>, CC: FromBytes<'a>, RC: FromBytes<'a>> FromBytes<'a> for Lookbacks<TC, VC, CC, RC, &'a [u64]>

const SLICE_COUNT: usize = Results<TC, VC, CC, RC, &'a [u64]>::SLICE_COUNT

The number of byte slices this type consumes when reconstructed.

fn from_bytes(bytes: &mut impl Iterator<Item = &'a [u8]>) -> Self

Reconstructs self from a sequence of correctly aligned and sized bytes slices.

fn from_store(store: &DecodedStore<'a>, offset: &mut usize) -> Self

Reconstructs self from a DecodedStore, using direct random access at a given offset.

fn element_sizes(sizes: &mut Vec<usize>) -> Result<(), String>

Reports the element sizes (in bytes) for each slice this type consumes.

fn validate(slices: &[(&[u64], u8)]) -> Result<(), String>

where Self: Sized,

Validates that the given slices are compatible with this type.

impl<'a, TC, const N: u8> Index for &'a Lookbacks<TC, Vec<u8>, Vec<u64>, Vec<u64>, [u64; 2], N>

where &'a TC: Index,

type Ref = <&'a TC as Index>::Ref

The type returned by the get method.

fn get(&self, index: usize) -> Self::Ref

Returns the reference type for location index.

fn last(&self) -> Option<Self::Ref>

where Self: Len,

fn index_iter(&self) -> IterOwn<&Self>

Converts &self into an iterator.

fn into_index_iter(self) -> IterOwn<Self>

where Self: Sized,

Converts self into an iterator.

impl<TC: Index, VC: IndexAs<u8>, CC: IndexAs<u64> + Len, RC: IndexAs<u64> + Len, WC: IndexAs<u64>, const N: u8> Index for Lookbacks<TC, VC, CC, RC, WC, N>

type Ref = <TC as Index>::Ref

The type returned by the get method.

fn get(&self, index: usize) -> Self::Ref

Returns the reference type for location index.

fn last(&self) -> Option<Self::Ref>

where Self: Len,

fn index_iter(&self) -> IterOwn<&Self>

Converts &self into an iterator.

fn into_index_iter(self) -> IterOwn<Self>

where Self: Sized,

Converts self into an iterator.

impl<TC, VC, CC, RC: Len, WC: IndexAs<u64>, const N: u8> Len for Lookbacks<TC, VC, CC, RC, WC, N>

fn len(&self) -> usize

The number of contained elements.

fn is_empty(&self) -> bool

Whether this contains no elements.

impl<TC: PartialEq, VC: PartialEq, CC: PartialEq, RC: PartialEq, WC: PartialEq, const N: u8> PartialEq for Lookbacks<TC, VC, CC, RC, WC, N>

fn eq(&self, other: &Lookbacks<TC, VC, CC, RC, WC, N>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: PartialEq, TC: Push<T> + Len, VC: Push<u8>, const N: u8> Push<T> for Lookbacks<TC, VC, Vec<u64>, Vec<u64>, [u64; 2], N>

where for<'a> &'a TC: Index, for<'a> <&'a TC as Index>::Ref: PartialEq<T>,

fn push(&mut self, item: T)

Pushes an item onto self.

fn extend(&mut self, iter: impl IntoIterator<Item = T>)

Pushes elements of an iterator onto self.

impl<TC: Copy, VC: Copy, CC: Copy, RC: Copy, WC: Copy, const N: u8> Copy for Lookbacks<TC, VC, CC, RC, WC, N>

impl<TC, VC, CC, RC, WC, const N: u8> StructuralPartialEq for Lookbacks<TC, VC, CC, RC, WC, N>