pub struct LayoutS<V: Idx> {
pub fields: FieldsShape,
pub variants: Variants<V>,
pub abi: Abi,
pub largest_niche: Option<Niche>,
pub align: AbiAndPrefAlign,
pub size: Size,
}Fields§
§fields: FieldsShapeSays where the fields are located within the layout.
variants: Variants<V>Encodes information about multi-variant layouts.
Even with Multiple variants, a layout still has its own fields! Those are then
shared between all variants. One of them will be the discriminant,
but e.g. generators can have more.
To access all fields of this layout, both fields and the fields of the active variant
must be taken into account.
abi: AbiThe abi defines how this data is passed between functions, and it defines
value restrictions via valid_range.
Note that this is entirely orthogonal to the recursive structure defined by
variants and fields; for example, ManuallyDrop<Result<isize, isize>> has
Abi::ScalarPair! So, even with non-Aggregate abi, fields and variants
have to be taken into account to find all fields of this layout.
largest_niche: Option<Niche>The leaf scalar with the largest number of invalid values
(i.e. outside of its valid_range), if it exists.
align: AbiAndPrefAlign§size: SizeImplementations§
Trait Implementations§
source§impl<V, __CTX> HashStable<__CTX> for LayoutS<V>where
__CTX: HashStableContext,
V: HashStable<__CTX> + Idx,
impl<V, __CTX> HashStable<__CTX> for LayoutS<V>where
__CTX: HashStableContext,
V: HashStable<__CTX> + Idx,
fn hash_stable(&self, __hcx: &mut __CTX, __hasher: &mut StableHasher)
source§impl<V: PartialEq + Idx> PartialEq<LayoutS<V>> for LayoutS<V>
impl<V: PartialEq + Idx> PartialEq<LayoutS<V>> for LayoutS<V>
impl<V: Eq + Idx> Eq for LayoutS<V>
impl<V: Idx> StructuralEq for LayoutS<V>
impl<V: Idx> StructuralPartialEq for LayoutS<V>
Auto Trait Implementations§
impl<V> RefUnwindSafe for LayoutS<V>where
V: RefUnwindSafe,
impl<V> Send for LayoutS<V>where
V: Send,
impl<V> Sync for LayoutS<V>where
V: Sync,
impl<V> Unpin for LayoutS<V>where
V: Unpin,
impl<V> UnwindSafe for LayoutS<V>where
V: UnwindSafe,
Blanket Implementations§
Layout§
Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.