Enum FieldsShape

pub enum FieldsShape<FieldIdx>
where
    FieldIdx: Idx,
{
    Primitive,
    Union(NonZero<usize>),
    Array {
        stride: Size,
        count: u64,
    },
    Arbitrary {
        offsets: IndexVec<FieldIdx, Size>,
        memory_index: IndexVec<FieldIdx, u32>,
    },
}

Describes how the fields of a type are located in memory.

Variants

Primitive

Scalar primitives and !, which never have fields.

Union(NonZero<usize>)

All fields start at no offset. The usize is the field count.

Array

Array/vector-like placement, with all fields of identical types.

Fields

stride: Size

count: u64

Arbitrary

Struct-like placement, with precomputed offsets.

Fields are guaranteed to not overlap, but note that gaps before, between and after all the fields are NOT always padding, and as such their contents may not be discarded. For example, enum variants leave a gap at the start, where the discriminant field in the enum layout goes.

Fields

offsets: IndexVec<FieldIdx, Size>

Offsets for the first byte of each field, ordered to match the source definition order. This vector does not go in increasing order.

memory_index: IndexVec<FieldIdx, u32>

Maps source order field indices to memory order indices, depending on how the fields were reordered (if at all). This is a permutation, with both the source order and the memory order using the same (0..n) index ranges.

Note that during computation of memory_index, sometimes it is easier to operate on the inverse mapping (that is, from memory order to source order), and that is usually named inverse_memory_index.

Implementations

impl<FieldIdx> FieldsShape<FieldIdx>

where FieldIdx: Idx,

pub fn count(&self) -> usize

pub fn offset(&self, i: usize) -> Size

pub fn memory_index(&self, i: usize) -> usize

pub fn index_by_increasing_offset(&self) -> impl ExactSizeIterator

Gets source indices of the fields by increasing offsets.

Trait Implementations

impl<FieldIdx> Clone for FieldsShape<FieldIdx>

where FieldIdx: Clone + Idx,

fn clone(&self) -> FieldsShape<FieldIdx>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<FieldIdx> Debug for FieldsShape<FieldIdx>

where FieldIdx: Debug + Idx,

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

Formats the value using the given formatter.

impl<FieldIdx> Hash for FieldsShape<FieldIdx>

where FieldIdx: Hash + Idx,

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<FieldIdx, __CTX> HashStable<__CTX> for FieldsShape<FieldIdx>

where FieldIdx: Idx + HashStable<__CTX>, __CTX: HashStableContext,

fn hash_stable( &self, __hcx: &mut __CTX, __hasher: &mut StableHasher<SipHasher128>, )

impl<FieldIdx> PartialEq for FieldsShape<FieldIdx>

where FieldIdx: PartialEq + Idx,

fn eq(&self, other: &FieldsShape<FieldIdx>) -> 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<FieldIdx> Eq for FieldsShape<FieldIdx>

where FieldIdx: Eq + Idx,

impl<FieldIdx> StructuralPartialEq for FieldsShape<FieldIdx>

where FieldIdx: Idx,

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: 48 bytes

Size for each variant:

• Primitive: 0 bytes
• Union: 16 bytes
• Array: 24 bytes
• Arbitrary: 48 bytes