struct LazyTable<I, T> {
    position: NonZeroUsize,
    encoded_size: 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: NonZeroUsizeencoded_size: usize_marker: PhantomData<fn(_: I) -> T>

Implementations

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

Size of the table in entries, including possible gaps.

Trait Implementations

Returns a copy of the value. Read more
Performs copy-assignment from source. Read more

Auto Trait Implementations

Blanket Implementations

Gets the TypeId of self. Read more
Immutably borrows from an owned value. Read more
Mutably borrows from an owned value. Read more

Returns the argument unchanged.

Calls U::from(self).

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

The resulting type after obtaining ownership.
Creates owned data from borrowed data, usually by cloning. Read more
Uses borrowed data to replace owned data, usually by cloning. Read more
The type returned in the event of a conversion error.
Performs the conversion.
The type returned in the event of a conversion 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: 16 bytes