Struct columnar::lookback::Lookbacks

pub struct Lookbacks<TC, VC = Vec<u8>, const N: u8 = u8::MAX> {
    pub inner: Results<TC, VC>,
}

Fields

inner: Results<TC, VC>

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

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

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

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

Returns the “default value” for a type.

impl<'de, TC, VC, const N: u8> Deserialize<'de> for Lookbacks<TC, VC, N>

where TC: Deserialize<'de>, VC: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<TC: HeapSize, VC: HeapSize, const N: u8> HeapSize for Lookbacks<TC, VC, N>

fn heap_size(&self) -> (usize, usize)

Active (len) and allocated (cap) heap sizes in bytes. This should not include the size of self itself.

impl<'a, TC, const N: u8> Index for &'a Lookbacks<TC, Vec<u8>, 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

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

where Self: Len,

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

fn into_iter(self) -> IterOwn<Self>

where Self: Sized,

impl<TC: Index, VC: Index<Ref = u8>, const N: u8> Index for Lookbacks<TC, VC, N>

type Ref = <TC as Index>::Ref

The type returned by the get method.

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

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

where Self: Len,

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

fn into_iter(self) -> IterOwn<Self>

where Self: Sized,

impl<TC, VC, const N: u8> Len for Lookbacks<TC, VC, 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, const N: u8> PartialEq for Lookbacks<TC, VC, N>

fn eq(&self, other: &Lookbacks<TC, VC, 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, 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, VC, const N: u8> Serialize for Lookbacks<TC, VC, N>

where TC: Serialize, VC: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

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