pub enum Representability {
Representable,
ContainsRecursive,
SelfRecursive(Vec<(Span, Option<HirId>)>),
}Expand description
Describes whether a type is representable. For types that are not representable, ‘SelfRecursive’ and ‘ContainsRecursive’ are used to distinguish between types that are recursive with themselves and types that contain a different recursive type. These cases can therefore be treated differently when reporting errors.
The ordering of the cases is significant. They are sorted so that cmp::max will keep the “more erroneous” of two values.
Variants
Representable
ContainsRecursive
SelfRecursive(Vec<(Span, Option<HirId>)>)
Return a list of types that are included in themselves: the spans where they are self-included, and (if found) the HirId of the FieldDef that defines the self-inclusion.
Trait Implementations
sourceimpl Clone for Representability
impl Clone for Representability
sourcefn clone(&self) -> Representability
fn clone(&self) -> Representability
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source. Read more
sourceimpl Debug for Representability
impl Debug for Representability
sourceimpl Ord for Representability
impl Ord for Representability
sourcefn cmp(&self, other: &Representability) -> Ordering
fn cmp(&self, other: &Representability) -> Ordering
1.21.0 · sourcefn max(self, other: Self) -> Self
fn max(self, other: Self) -> Self
Compares and returns the maximum of two values. Read more
1.21.0 · sourcefn min(self, other: Self) -> Self
fn min(self, other: Self) -> Self
Compares and returns the minimum of two values. Read more
1.50.0 · sourcefn clamp(self, min: Self, max: Self) -> Self where
Self: PartialOrd<Self>,
fn clamp(self, min: Self, max: Self) -> Self where
Self: PartialOrd<Self>,
Restrict a value to a certain interval. Read more
sourceimpl PartialEq<Representability> for Representability
impl PartialEq<Representability> for Representability
sourcefn eq(&self, other: &Representability) -> bool
fn eq(&self, other: &Representability) -> bool
This method tests for self and other values to be equal, and is used
by ==. Read more
sourcefn ne(&self, other: &Representability) -> bool
fn ne(&self, other: &Representability) -> bool
This method tests for !=.
sourceimpl PartialOrd<Representability> for Representability
impl PartialOrd<Representability> for Representability
sourcefn partial_cmp(&self, other: &Representability) -> Option<Ordering>
fn partial_cmp(&self, other: &Representability) -> Option<Ordering>
This method returns an ordering between self and other values if one exists. Read more
1.0.0 · sourcefn lt(&self, other: &Rhs) -> bool
fn lt(&self, other: &Rhs) -> bool
This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for self and other) and is used by the <=
operator. Read more
impl Eq for Representability
impl StructuralEq for Representability
impl StructuralPartialEq for Representability
Auto Trait Implementations
impl RefUnwindSafe for Representability
impl !Send for Representability
impl !Sync for Representability
impl Unpin for Representability
impl UnwindSafe for Representability
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
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: 32 bytes
Size for each variant:
Representable: 0 bytesContainsRecursive: 0 bytesSelfRecursive: 24 bytes