Struct ArchivedTuple7

#[repr(C)]
pub struct ArchivedTuple7<T0, T1, T2, T3, T4, T5, T6>(pub T0, pub T1, pub T2, pub T3, pub T4, pub T5, pub T6);

Available on crate feature dep_rkyv only.

An archived tuple with 7 elements

Tuple Fields

0: T0

1: T1

2: T2

3: T3

4: T4

5: T5

6: T6

Trait Implementations

impl<T0, T1, T2, T3, T4, T5, T6, __C> CheckBytes<__C> for ArchivedTuple7<T0, T1, T2, T3, T4, T5, T6>

where __C: Fallible + ?Sized, <__C as Fallible>::Error: Trace, T0: CheckBytes<__C>, T1: CheckBytes<__C>, T2: CheckBytes<__C>, T3: CheckBytes<__C>, T4: CheckBytes<__C>, T5: CheckBytes<__C>, T6: CheckBytes<__C>,

unsafe fn check_bytes( value: *const ArchivedTuple7<T0, T1, T2, T3, T4, T5, T6>, context: &mut __C, ) -> Result<(), <__C as Fallible>::Error>

Checks whether the given pointer points to a valid value within the given context.

impl<T0, T1, T2, T3, T4, T5, T6> Debug for ArchivedTuple7<T0, T1, T2, T3, T4, T5, T6>

where T0: Debug, T1: Debug, T2: Debug, T3: Debug, T4: Debug, T5: Debug, T6: Debug,

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

Formats the value using the given formatter.

impl<T0, T1, T2, T3, T4, T5, T6> Default for ArchivedTuple7<T0, T1, T2, T3, T4, T5, T6>

where T0: Default, T1: Default, T2: Default, T3: Default, T4: Default, T5: Default, T6: Default,

fn default() -> ArchivedTuple7<T0, T1, T2, T3, T4, T5, T6>

Returns the “default value” for a type.

impl<T0, T1, T2, T3, T4, T5, T6, D> Deserialize<(T0, T1, T2, T3, T4, T5, T6), D> for ArchivedTuple7<<T0 as Archive>::Archived, <T1 as Archive>::Archived, <T2 as Archive>::Archived, <T3 as Archive>::Archived, <T4 as Archive>::Archived, <T5 as Archive>::Archived, <T6 as Archive>::Archived>

where D: Fallible + ?Sized, T0: Archive, T1: Archive, T2: Archive, T3: Archive, T4: Archive, T5: Archive, T6: Archive, <T0 as Archive>::Archived: Deserialize<T0, D>, <T1 as Archive>::Archived: Deserialize<T1, D>, <T2 as Archive>::Archived: Deserialize<T2, D>, <T3 as Archive>::Archived: Deserialize<T3, D>, <T4 as Archive>::Archived: Deserialize<T4, D>, <T5 as Archive>::Archived: Deserialize<T5, D>, <T6 as Archive>::Archived: Deserialize<T6, D>,

fn deserialize( &self, deserializer: &mut D, ) -> Result<(T0, T1, T2, T3, T4, T5, T6), <D as Fallible>::Error>

Deserializes using the given deserializer

impl<T0, T1, T2, T3, T4, T5, T6> Hash for ArchivedTuple7<T0, T1, T2, T3, T4, T5, T6>

where T0: Hash, T1: Hash, T2: Hash, T3: Hash, T4: Hash, T5: Hash, T6: Hash,

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<T0, T1, T2, T3, T4, T5, T6> Ord for ArchivedTuple7<T0, T1, T2, T3, T4, T5, T6>

where T0: Ord, T1: Ord, T2: Ord, T3: Ord, T4: Ord, T5: Ord, T6: Ord,

fn cmp(&self, other: &ArchivedTuple7<T0, T1, T2, T3, T4, T5, T6>) -> 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,

Restrict a value to a certain interval.

impl<T0, T1, T2, T3, T4, T5, T6, U0, U1, U2, U3, U4, U5, U6> PartialEq<(U0, U1, U2, U3, U4, U5, U6)> for ArchivedTuple7<T0, T1, T2, T3, T4, T5, T6>

where T0: PartialEq<U0>, T1: PartialEq<U1>, T2: PartialEq<U2>, T3: PartialEq<U3>, T4: PartialEq<U4>, T5: PartialEq<U5>, T6: PartialEq<U6>,

fn eq(&self, other: &(U0, U1, U2, U3, U4, U5, U6)) -> 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<T0, T1, T2, T3, T4, T5, T6> PartialEq for ArchivedTuple7<T0, T1, T2, T3, T4, T5, T6>

where T0: PartialEq, T1: PartialEq, T2: PartialEq, T3: PartialEq, T4: PartialEq, T5: PartialEq, T6: PartialEq,

fn eq(&self, other: &ArchivedTuple7<T0, T1, T2, T3, T4, T5, T6>) -> 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<T0, T1, T2, T3, T4, T5, T6> PartialOrd for ArchivedTuple7<T0, T1, T2, T3, T4, T5, T6>

where T0: PartialOrd, T1: PartialOrd, T2: PartialOrd, T3: PartialOrd, T4: PartialOrd, T5: PartialOrd, T6: PartialOrd,

fn partial_cmp( &self, other: &ArchivedTuple7<T0, T1, T2, T3, T4, T5, T6>, ) -> Option<Ordering>

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

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

Tests less than (for self and other) and is used by the < operator.

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

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

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

Tests greater than (for self and other) and is used by the > operator.

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

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

impl<T0, T1, T2, T3, T4, T5, T6> Eq for ArchivedTuple7<T0, T1, T2, T3, T4, T5, T6>

where T0: Eq, T1: Eq, T2: Eq, T3: Eq, T4: Eq, T5: Eq, T6: Eq,

impl<T0, T1, T2, T3, T4, T5, T6> Portable for ArchivedTuple7<T0, T1, T2, T3, T4, T5, T6>

where T0: Portable, T1: Portable, T2: Portable, T3: Portable, T4: Portable, T5: Portable, T6: Portable,

impl<T0, T1, T2, T3, T4, T5, T6> StructuralPartialEq for ArchivedTuple7<T0, T1, T2, T3, T4, T5, T6>