Says where the fields are located within the layout.
Encodes information about multi-variant layouts.
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 defines how this data is passed between functions, and it defines
value restrictions via
Note that this is entirely orthogonal to the recursive structure defined by
fields; for example,
ManuallyDrop<Result<isize, isize>> has
Abi::ScalarPair! So, even with non-
have to be taken into account to find all fields of this layout.
The leaf scalar with the largest number of invalid values
(i.e. outside of its
valid_range), if it exists.
pub fn hash_slice<H>(data: &[Self], state: &mut H) where1.3.0[src]
impl<__CTX> HashStable<__CTX> for Layout where[src]
impl StructuralEq for Layout[src]
impl StructuralPartialEq for Layout[src]
Auto Trait Implementations
impl RefUnwindSafe for Layout[src]
impl UnwindSafe for Layout[src]
impl<T> MaybeResult<T> for T[src]
pub fn from(Result<T, <T as MaybeResult<T>>::Error>) -> T[src]
pub fn to_result(Self) -> Result<T, <T as MaybeResult<T>>::Error>[src]
type Error = Infallible
The type returned in the event of a conversion error.