Struct timely_container::flatcontainer::impls::tuple::TupleABCDEFGHIJKLMNORegion

pub struct TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O> { /* private fields */ }

A region for a tuple.

Trait Implementations

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O> Clone for TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>

where A: Region + Clone, B: Region + Clone, C: Region + Clone, D: Region + Clone, E: Region + Clone, F: Region + Clone, G: Region + Clone, H: Region + Clone, I: Region + Clone, J: Region + Clone, K: Region + Clone, L: Region + Clone, M: Region + Clone, N: Region + Clone, O: Region + Clone, <A as Region>::Index: Index, <B as Region>::Index: Index, <C as Region>::Index: Index, <D as Region>::Index: Index, <E as Region>::Index: Index, <F as Region>::Index: Index, <G as Region>::Index: Index, <H as Region>::Index: Index, <I as Region>::Index: Index, <J as Region>::Index: Index, <K as Region>::Index: Index, <L as Region>::Index: Index, <M as Region>::Index: Index, <N as Region>::Index: Index, <O as Region>::Index: Index,

fn clone( &self, ) -> TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>

Returns a copy of the value.

fn clone_from( &mut self, source: &TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>, )

Performs copy-assignment from source.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O> Debug for TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>

where A: Debug, B: Debug, C: Debug, D: Debug, E: Debug, F: Debug, G: Debug, H: Debug, I: Debug, J: Debug, K: Debug, L: Debug, M: Debug, N: Debug, O: Debug,

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

Formats the value using the given formatter.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O> Default for TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>

where A: Default, B: Default, C: Default, D: Default, E: Default, F: Default, G: Default, H: Default, I: Default, J: Default, K: Default, L: Default, M: Default, N: Default, O: Default,

fn default() -> TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>

Returns the “default value” for a type.

impl<'de, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O> Deserialize<'de> for TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>

where A: Deserialize<'de>, B: Deserialize<'de>, C: Deserialize<'de>, D: Deserialize<'de>, E: Deserialize<'de>, F: Deserialize<'de>, G: Deserialize<'de>, H: Deserialize<'de>, I: Deserialize<'de>, J: Deserialize<'de>, K: Deserialize<'de>, L: Deserialize<'de>, M: Deserialize<'de>, N: Deserialize<'de>, O: Deserialize<'de>,

fn deserialize<__D>( __deserializer: __D, ) -> Result<TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'a, A, A_C, B, B_C, C, C_C, D, D_C, E, E_C, F, F_C, G, G_C, H, H_C, I, I_C, J, J_C, K, K_C, L, L_C, M, M_C, N, N_C, O, O_C> Push<&'a (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O)> for TupleABCDEFGHIJKLMNORegion<A_C, B_C, C_C, D_C, E_C, F_C, G_C, H_C, I_C, J_C, K_C, L_C, M_C, N_C, O_C>

where A_C: Region + Push<&'a A>, B_C: Region + Push<&'a B>, C_C: Region + Push<&'a C>, D_C: Region + Push<&'a D>, E_C: Region + Push<&'a E>, F_C: Region + Push<&'a F>, G_C: Region + Push<&'a G>, H_C: Region + Push<&'a H>, I_C: Region + Push<&'a I>, J_C: Region + Push<&'a J>, K_C: Region + Push<&'a K>, L_C: Region + Push<&'a L>, M_C: Region + Push<&'a M>, N_C: Region + Push<&'a N>, O_C: Region + Push<&'a O>,

fn push( &mut self, item: &'a (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O), ) -> <TupleABCDEFGHIJKLMNORegion<A_C, B_C, C_C, D_C, E_C, F_C, G_C, H_C, I_C, J_C, K_C, L_C, M_C, N_C, O_C> as Region>::Index

Push item into self, returning an index that allows to look up the corresponding read item.

impl<A, A_C, B, B_C, C, C_C, D, D_C, E, E_C, F, F_C, G, G_C, H, H_C, I, I_C, J, J_C, K, K_C, L, L_C, M, M_C, N, N_C, O, O_C> Push<(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O)> for TupleABCDEFGHIJKLMNORegion<A_C, B_C, C_C, D_C, E_C, F_C, G_C, H_C, I_C, J_C, K_C, L_C, M_C, N_C, O_C>

where A_C: Region + Push<A>, B_C: Region + Push<B>, C_C: Region + Push<C>, D_C: Region + Push<D>, E_C: Region + Push<E>, F_C: Region + Push<F>, G_C: Region + Push<G>, H_C: Region + Push<H>, I_C: Region + Push<I>, J_C: Region + Push<J>, K_C: Region + Push<K>, L_C: Region + Push<L>, M_C: Region + Push<M>, N_C: Region + Push<N>, O_C: Region + Push<O>,

fn push( &mut self, item: (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O), ) -> <TupleABCDEFGHIJKLMNORegion<A_C, B_C, C_C, D_C, E_C, F_C, G_C, H_C, I_C, J_C, K_C, L_C, M_C, N_C, O_C> as Region>::Index

Push item into self, returning an index that allows to look up the corresponding read item.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O> Region for TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>

where A: Region, B: Region, C: Region, D: Region, E: Region, F: Region, G: Region, H: Region, I: Region, J: Region, K: Region, L: Region, M: Region, N: Region, O: Region, <A as Region>::Index: Index, <B as Region>::Index: Index, <C as Region>::Index: Index, <D as Region>::Index: Index, <E as Region>::Index: Index, <F as Region>::Index: Index, <G as Region>::Index: Index, <H as Region>::Index: Index, <I as Region>::Index: Index, <J as Region>::Index: Index, <K as Region>::Index: Index, <L as Region>::Index: Index, <M as Region>::Index: Index, <N as Region>::Index: Index, <O as Region>::Index: Index,

type Owned = (<A as Region>::Owned, <B as Region>::Owned, <C as Region>::Owned, <D as Region>::Owned, <E as Region>::Owned, <F as Region>::Owned, <G as Region>::Owned, <H as Region>::Owned, <I as Region>::Owned, <J as Region>::Owned, <K as Region>::Owned, <L as Region>::Owned, <M as Region>::Owned, <N as Region>::Owned, <O as Region>::Owned)

An owned type that can be constructed from a read item.

type ReadItem<'a> = (<A as Region>::ReadItem<'a>, <B as Region>::ReadItem<'a>, <C as Region>::ReadItem<'a>, <D as Region>::ReadItem<'a>, <E as Region>::ReadItem<'a>, <F as Region>::ReadItem<'a>, <G as Region>::ReadItem<'a>, <H as Region>::ReadItem<'a>, <I as Region>::ReadItem<'a>, <J as Region>::ReadItem<'a>, <K as Region>::ReadItem<'a>, <L as Region>::ReadItem<'a>, <M as Region>::ReadItem<'a>, <N as Region>::ReadItem<'a>, <O as Region>::ReadItem<'a>) where TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>: 'a

The type of the data that one gets out of the container.

type Index = (<A as Region>::Index, <B as Region>::Index, <C as Region>::Index, <D as Region>::Index, <E as Region>::Index, <F as Region>::Index, <G as Region>::Index, <H as Region>::Index, <I as Region>::Index, <J as Region>::Index, <K as Region>::Index, <L as Region>::Index, <M as Region>::Index, <N as Region>::Index, <O as Region>::Index)

The type to index into the container. Should be treated as an opaque type, even if known.

fn merge_regions<'a>( regions: impl Iterator<Item = &'a TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>> + Clone, ) -> TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>

where TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>: 'a,

Construct a region that can absorb the contents of regions in the future.

fn index( &self, index: <TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O> as Region>::Index, ) -> <TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O> as Region>::ReadItem<'_>

Index into the container. The index must be obtained by pushing data into the container.

fn reserve_regions<'a, It>(&mut self, regions: It)

where TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>: 'a, It: Iterator<Item = &'a TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>> + Clone,

Ensure that the region can absorb the items of regions without reallocation

fn clear(&mut self)

Remove all elements from this region, but retain allocations if possible.

fn heap_size<Fn>(&self, callback: Fn)

where Fn: FnMut(usize, usize),

Heap size, size - capacity

fn reborrow<'b, 'a>( item: <TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O> as Region>::ReadItem<'a>, ) -> <TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O> as Region>::ReadItem<'b>

where 'a: 'b, TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>: 'a,

Converts a read item into one with a narrower lifetime.

impl<'a, A, A_C, B, B_C, C, C_C, D, D_C, E, E_C, F, F_C, G, G_C, H, H_C, I, I_C, J, J_C, K, K_C, L, L_C, M, M_C, N, N_C, O, O_C> ReserveItems<&'a (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O)> for TupleABCDEFGHIJKLMNORegion<A_C, B_C, C_C, D_C, E_C, F_C, G_C, H_C, I_C, J_C, K_C, L_C, M_C, N_C, O_C>

where A_C: Region + ReserveItems<&'a A>, B_C: Region + ReserveItems<&'a B>, C_C: Region + ReserveItems<&'a C>, D_C: Region + ReserveItems<&'a D>, E_C: Region + ReserveItems<&'a E>, F_C: Region + ReserveItems<&'a F>, G_C: Region + ReserveItems<&'a G>, H_C: Region + ReserveItems<&'a H>, I_C: Region + ReserveItems<&'a I>, J_C: Region + ReserveItems<&'a J>, K_C: Region + ReserveItems<&'a K>, L_C: Region + ReserveItems<&'a L>, M_C: Region + ReserveItems<&'a M>, N_C: Region + ReserveItems<&'a N>, O_C: Region + ReserveItems<&'a O>,

fn reserve_items<It>(&mut self, items: It)

where It: Iterator<Item = &'a (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O)> + Clone,

Ensure that the region can absorb items without reallocation.

impl<A, A_C, B, B_C, C, C_C, D, D_C, E, E_C, F, F_C, G, G_C, H, H_C, I, I_C, J, J_C, K, K_C, L, L_C, M, M_C, N, N_C, O, O_C> ReserveItems<(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O)> for TupleABCDEFGHIJKLMNORegion<A_C, B_C, C_C, D_C, E_C, F_C, G_C, H_C, I_C, J_C, K_C, L_C, M_C, N_C, O_C>

where A_C: Region + ReserveItems<A>, B_C: Region + ReserveItems<B>, C_C: Region + ReserveItems<C>, D_C: Region + ReserveItems<D>, E_C: Region + ReserveItems<E>, F_C: Region + ReserveItems<F>, G_C: Region + ReserveItems<G>, H_C: Region + ReserveItems<H>, I_C: Region + ReserveItems<I>, J_C: Region + ReserveItems<J>, K_C: Region + ReserveItems<K>, L_C: Region + ReserveItems<L>, M_C: Region + ReserveItems<M>, N_C: Region + ReserveItems<N>, O_C: Region + ReserveItems<O>,

fn reserve_items<It>(&mut self, items: It)

where It: Iterator<Item = (A, B, C, D, E, F, G, H, I, J, K, L, M, N, O)> + Clone,

Ensure that the region can absorb items without reallocation.

impl<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O> Serialize for TupleABCDEFGHIJKLMNORegion<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O>

where A: Serialize, B: Serialize, C: Serialize, D: Serialize, E: Serialize, F: Serialize, G: Serialize, H: Serialize, I: Serialize, J: Serialize, K: Serialize, L: Serialize, M: Serialize, N: Serialize, O: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.