struct LazyTable<I, T> {
    position: NonZeroUsize,
    width: usize,
    len: usize,
    _marker: PhantomData<fn(_: I) -> T>,
}
Expand description

A list of lazily-decoded values, with the added capability of random access.

Random-access table (i.e. offering constant-time get/set), similar to LazyArray<T>, but without requiring encoding or decoding all the values eagerly and in-order.

Fields§

§position: NonZeroUsize§width: usize

The encoded size of the elements of a table is selected at runtime to drop trailing zeroes. This is the number of bytes used for each table element.

§len: usize

How many elements are in the table.

§_marker: PhantomData<fn(_: I) -> T>

Implementations§

source§

impl<I: Idx, const N: usize, T: FixedSizeEncoding<ByteArray = [u8; N]> + ParameterizedOverTcx> LazyTable<I, T>where for<'tcx> T::Value<'tcx>: FixedSizeEncoding<ByteArray = [u8; N]>,

source

pub(super) fn get<'a, 'tcx, M: Metadata<'a, 'tcx>>( &self, metadata: M, i: I ) -> T::Value<'tcx>

Given the metadata, extract out the value at a particular index (if any).

source

pub(super) fn size(&self) -> usize

Size of the table in entries, including possible gaps.

source§

impl<I, T> LazyTable<I, T>

Trait Implementations§

source§

impl<I, T> Clone for LazyTable<I, T>

source§

fn clone(&self) -> Self

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl<'a, 'tcx, I: Idx, T> Decodable<DecodeContext<'a, 'tcx>> for LazyTable<I, T>

source§

fn decode(decoder: &mut DecodeContext<'a, 'tcx>) -> Self

source§

impl<'a, 'tcx, I, T> Encodable<EncodeContext<'a, 'tcx>> for LazyTable<I, T>

source§

fn encode(&self, e: &mut EncodeContext<'a, 'tcx>)

source§

impl<I: 'static, T: ParameterizedOverTcx> ParameterizedOverTcx for LazyTable<I, T>

§

type Value<'tcx> = LazyTable<I, <T as ParameterizedOverTcx>::Value<'tcx>>

source§

impl<I, T> Copy for LazyTable<I, T>

Auto Trait Implementations§

§

impl<I, T> RefUnwindSafe for LazyTable<I, T>

§

impl<I, T> Send for LazyTable<I, T>

§

impl<I, T> Sync for LazyTable<I, T>

§

impl<I, T> Unpin for LazyTable<I, T>

§

impl<I, T> UnwindSafe for LazyTable<I, T>

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.

Layout§

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 24 bytes