Struct rkyv::tuple::ArchivedTuple12

#[repr(C)]
pub struct ArchivedTuple12<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11>(pub T0, pub T1, pub T2, pub T3, pub T4, pub T5, pub T6, pub T7, pub T8, pub T9, pub T10, pub T11);

An archived tuple with 12 elements

Tuple Fields

0: T0

1: T1

2: T2

3: T3

4: T4

5: T5

6: T6

7: T7

8: T8

9: T9

10: T10

11: T11

Trait Implementations

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, __C: Fallible + ?Sized> CheckBytes<__C> for ArchivedTuple12<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11>

where <__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>, T7: CheckBytes<__C>, T8: CheckBytes<__C>, T9: CheckBytes<__C>, T10: CheckBytes<__C>, T11: CheckBytes<__C>,

unsafe fn check_bytes( value: *const Self, context: &mut __C, ) -> Result<(), <__C as Fallible>::Error>

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

impl<T0: Debug, T1: Debug, T2: Debug, T3: Debug, T4: Debug, T5: Debug, T6: Debug, T7: Debug, T8: Debug, T9: Debug, T10: Debug, T11: Debug> Debug for ArchivedTuple12<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11>

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

Formats the value using the given formatter.

impl<T0: Default, T1: Default, T2: Default, T3: Default, T4: Default, T5: Default, T6: Default, T7: Default, T8: Default, T9: Default, T10: Default, T11: Default> Default for ArchivedTuple12<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11>

fn default() -> ArchivedTuple12<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11>

Returns the “default value” for a type.

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, D> Deserialize<(T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11), D> for ArchivedTuple12<T0::Archived, T1::Archived, T2::Archived, T3::Archived, T4::Archived, T5::Archived, T6::Archived, T7::Archived, T8::Archived, T9::Archived, T10::Archived, T11::Archived>

where D: Fallible + ?Sized, T0: Archive, T1: Archive, T2: Archive, T3: Archive, T4: Archive, T5: Archive, T6: Archive, T7: Archive, T8: Archive, T9: Archive, T10: Archive, T11: Archive, T0::Archived: Deserialize<T0, D>, T1::Archived: Deserialize<T1, D>, T2::Archived: Deserialize<T2, D>, T3::Archived: Deserialize<T3, D>, T4::Archived: Deserialize<T4, D>, T5::Archived: Deserialize<T5, D>, T6::Archived: Deserialize<T6, D>, T7::Archived: Deserialize<T7, D>, T8::Archived: Deserialize<T8, D>, T9::Archived: Deserialize<T9, D>, T10::Archived: Deserialize<T10, D>, T11::Archived: Deserialize<T11, D>,

fn deserialize( &self, deserializer: &mut D, ) -> Result<(T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11), D::Error>

Deserializes using the given deserializer

impl<T0: Hash, T1: Hash, T2: Hash, T3: Hash, T4: Hash, T5: Hash, T6: Hash, T7: Hash, T8: Hash, T9: Hash, T10: Hash, T11: Hash> Hash for ArchivedTuple12<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11>

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<T0: Ord, T1: Ord, T2: Ord, T3: Ord, T4: Ord, T5: Ord, T6: Ord, T7: Ord, T8: Ord, T9: Ord, T10: Ord, T11: Ord> Ord for ArchivedTuple12<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11>

fn cmp( &self, other: &ArchivedTuple12<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11>, ) -> 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<T0: PartialEq, T1: PartialEq, T2: PartialEq, T3: PartialEq, T4: PartialEq, T5: PartialEq, T6: PartialEq, T7: PartialEq, T8: PartialEq, T9: PartialEq, T10: PartialEq, T11: PartialEq> PartialEq for ArchivedTuple12<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11>

fn eq( &self, other: &ArchivedTuple12<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11>, ) -> 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: PartialOrd, T1: PartialOrd, T2: PartialOrd, T3: PartialOrd, T4: PartialOrd, T5: PartialOrd, T6: PartialOrd, T7: PartialOrd, T8: PartialOrd, T9: PartialOrd, T10: PartialOrd, T11: PartialOrd> PartialOrd for ArchivedTuple12<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11>

fn partial_cmp( &self, other: &ArchivedTuple12<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11>, ) -> 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: Eq, T1: Eq, T2: Eq, T3: Eq, T4: Eq, T5: Eq, T6: Eq, T7: Eq, T8: Eq, T9: Eq, T10: Eq, T11: Eq> Eq for ArchivedTuple12<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11>

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> Portable for ArchivedTuple12<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11>

where T0: Portable, T1: Portable, T2: Portable, T3: Portable, T4: Portable, T5: Portable, T6: Portable, T7: Portable, T8: Portable, T9: Portable, T10: Portable, T11: Portable,

impl<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11> StructuralPartialEq for ArchivedTuple12<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11>