Struct const_type_layout::TypeLayoutGraph

pub struct TypeLayoutGraph<'a, F: Deref<Target = [Field<'a>]> = &'a [Field<'a>], V: Deref<Target = [Variant<'a, F>]> = &'a [Variant<'a, F>], I: Deref<Target = TypeLayoutInfo<'a, F, V>> = &'a TypeLayoutInfo<'a, F, V>, G: Deref<Target = [I]> = &'a [I]> {
    pub ty: &'a str,
    pub tys: G,
}

Available on crate feature derive only.

Description of the deep layout of a type.

Fields

ty: &'a str

The type’s fully-qualified name.

tys: G

The list of types that make up the complete graph describing the deep layout of this type.

Implementations

impl TypeLayoutGraph<'static>

pub const fn new<T: TypeLayout + ComputeTypeSet>() -> Self

Construct the deep type layout descriptor for a type T.

impl<'a> TypeLayoutGraph<'a>

pub const fn serialised_len(&self) -> usize

Compute the number of bytes that this TypeLayoutGraph serialises into.

pub const fn serialise(&self, bytes: &mut [u8])

Serialise this TypeLayoutGraph into the mutable byte slice. bytes must have a length of at least Self::serialised_len.

Use serialise_type_graph instead to serialise the TypeLayoutGraph of a type T into a byte array of the appropriate length.

Panics

This method panics iff bytes has a length of less than Self::serialised_len.

Trait Implementations

impl<'a, F: Clone + Deref<Target = [Field<'a>]>, V: Clone + Deref<Target = [Variant<'a, F>]>, I: Clone + Deref<Target = TypeLayoutInfo<'a, F, V>>, G: Clone + Deref<Target = [I]>> Clone for TypeLayoutGraph<'a, F, V, I, G>

fn clone(&self) -> TypeLayoutGraph<'a, F, V, I, G>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'a, F: Deref<Target = [Field<'a>]> + Debug, V: Deref<Target = [Variant<'a, F>]> + Debug, I: Deref<Target = TypeLayoutInfo<'a, F, V>> + Debug, G: Deref<Target = [I]> + Debug> Debug for TypeLayoutGraph<'a, F, V, I, G>

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

Formats the value using the given formatter.

impl<'de: 'a, 'a, F, V, I, G> Deserialize<'de> for TypeLayoutGraph<'a, F, V, I, G>

where F: Deserialize<'a> + Deref<Target = [Field<'a>]>, V: Deserialize<'a> + Deref<Target = [Variant<'a, F>]>, I: Deserialize<'a> + Deref<Target = TypeLayoutInfo<'a, F, V>>, G: Deserialize<'a> + Deref<Target = [I]>, 'a: 'de,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'a, F: Hash + Deref<Target = [Field<'a>]>, V: Hash + Deref<Target = [Variant<'a, F>]>, I: Hash + Deref<Target = TypeLayoutInfo<'a, F, V>>, G: Hash + Deref<Target = [I]>> Hash for TypeLayoutGraph<'a, F, V, I, G>

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

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<'a, F: Ord + Deref<Target = [Field<'a>]>, V: Ord + Deref<Target = [Variant<'a, F>]>, I: Ord + Deref<Target = TypeLayoutInfo<'a, F, V>>, G: Ord + Deref<Target = [I]>> Ord for TypeLayoutGraph<'a, F, V, I, G>

fn cmp(&self, other: &TypeLayoutGraph<'a, F, V, I, G>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl<'a, F: PartialEq + Deref<Target = [Field<'a>]>, V: PartialEq + Deref<Target = [Variant<'a, F>]>, I: PartialEq + Deref<Target = TypeLayoutInfo<'a, F, V>>, G: PartialEq + Deref<Target = [I]>> PartialEq for TypeLayoutGraph<'a, F, V, I, G>

fn eq(&self, other: &TypeLayoutGraph<'a, F, V, I, G>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<'a, F: PartialOrd + Deref<Target = [Field<'a>]>, V: PartialOrd + Deref<Target = [Variant<'a, F>]>, I: PartialOrd + Deref<Target = TypeLayoutInfo<'a, F, V>>, G: PartialOrd + Deref<Target = [I]>> PartialOrd for TypeLayoutGraph<'a, F, V, I, G>

fn partial_cmp( &self, other: &TypeLayoutGraph<'a, F, V, I, G> ) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<'a, F, V, I, G> Serialize for TypeLayoutGraph<'a, F, V, I, G>

where F: Serialize + Deref<Target = [Field<'a>]>, V: Serialize + Deref<Target = [Variant<'a, F>]>, I: Serialize + Deref<Target = TypeLayoutInfo<'a, F, V>>, G: Serialize + Deref<Target = [I]>,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<'a, F: Eq + Deref<Target = [Field<'a>]>, V: Eq + Deref<Target = [Variant<'a, F>]>, I: Eq + Deref<Target = TypeLayoutInfo<'a, F, V>>, G: Eq + Deref<Target = [I]>> Eq for TypeLayoutGraph<'a, F, V, I, G>

impl<'a, F: Deref<Target = [Field<'a>]>, V: Deref<Target = [Variant<'a, F>]>, I: Deref<Target = TypeLayoutInfo<'a, F, V>>, G: Deref<Target = [I]>> StructuralEq for TypeLayoutGraph<'a, F, V, I, G>

impl<'a, F: Deref<Target = [Field<'a>]>, V: Deref<Target = [Variant<'a, F>]>, I: Deref<Target = TypeLayoutInfo<'a, F, V>>, G: Deref<Target = [I]>> StructuralPartialEq for TypeLayoutGraph<'a, F, V, I, G>