Struct TupleCombinations
#[must_use = "this iterator adaptor is not lazy but does nearly nothing unless consumed"]
pub struct TupleCombinations<I, T>
where
I: Iterator,
T: HasCombination<I>, { /* private fields */ }An iterator to iterate through all combinations in a Clone-able iterator that produces tuples
of a specific size.
See .tuple_combinations() for more
information.
Trait Implementations
impl<I, T> Clone for TupleCombinations<I, T>
where
I: Iterator + Clone,
T: HasCombination<I> + Clone,
T::Combination: Clone,
fn clone(&self) -> TupleCombinations<I, T>
impl<I, T> Debug for TupleCombinations<I, T>
where
I: Iterator + Debug,
T: HasCombination<I> + Debug,
T::Combination: Debug,
fn fmt(&self, f: &mut Formatter<'_>) -> Result
impl<I, T> FusedIterator for TupleCombinations<I, T>
where
I: FusedIterator,
T: HasCombination<I>,
impl<I, T> Iterator for TupleCombinations<I, T>
where
I: Iterator,
T: HasCombination<I>,
type Item = T;fn next(&mut self) -> Option<Self::Item>fn size_hint(&self) -> (usize, Option<usize>)fn count(self) -> usizefn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B,
Auto Trait Implementations
impl<I, T> Freeze for TupleCombinations<I, T>
where
<T as HasCombination<I>>::Combination: Freeze,
PhantomData<I>: Freeze,
impl<I, T> RefUnwindSafe for TupleCombinations<I, T>
where
<T as HasCombination<I>>::Combination: RefUnwindSafe,
PhantomData<I>: RefUnwindSafe,
impl<I, T> Send for TupleCombinations<I, T>
where
<T as HasCombination<I>>::Combination: Send,
PhantomData<I>: Send,
impl<I, T> Sync for TupleCombinations<I, T>
where
<T as HasCombination<I>>::Combination: Sync,
PhantomData<I>: Sync,
impl<I, T> Unpin for TupleCombinations<I, T>
where
<T as HasCombination<I>>::Combination: Unpin,
PhantomData<I>: Unpin,
impl<I, T> UnsafeUnpin for TupleCombinations<I, T>
where
<T as HasCombination<I>>::Combination: UnsafeUnpin,
PhantomData<I>: UnsafeUnpin,
impl<I, T> UnwindSafe for TupleCombinations<I, T>
where
<T as HasCombination<I>>::Combination: UnwindSafe,
PhantomData<I>: UnwindSafe,
Blanket Implementations
impl<I> IntoIterator for TupleCombinations<I, T>
where
I: Iterator,
type Item = <I as Iterator>::Item;type IntoIter = I;fn into_iter(self) -> I
impl<IT, A, FromA> MultiUnzip<(FromA,)> for TupleCombinations<I, T>
where
IT: Iterator<Item = (A,)>,
FromA: Default + Extend<A>,
fn multiunzip(self) -> (FromA,)
impl<IT, A, FromA, B, FromB> MultiUnzip<(FromA, FromB)> for TupleCombinations<I, T>
where
IT: Iterator<Item = (A, B)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
fn multiunzip(self) -> (FromA, FromB)
impl<IT, A, FromA, B, FromB, C, FromC> MultiUnzip<(FromA, FromB, FromC)> for TupleCombinations<I, T>
where
IT: Iterator<Item = (A, B, C)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
fn multiunzip(self) -> (FromA, FromB, FromC)
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD> MultiUnzip<(FromA, FromB, FromC, FromD)> for TupleCombinations<I, T>
where
IT: Iterator<Item = (A, B, C, D)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
fn multiunzip(self) -> (FromA, FromB, FromC, FromD)
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE> MultiUnzip<(FromA, FromB, FromC, FromD, FromE)> for TupleCombinations<I, T>
where
IT: Iterator<Item = (A, B, C, D, E)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE)
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF)> for TupleCombinations<I, T>
where
IT: Iterator<Item = (A, B, C, D, E, F)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF)
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG)> for TupleCombinations<I, T>
where
IT: Iterator<Item = (A, B, C, D, E, F, G)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG)
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH)> for TupleCombinations<I, T>
where
IT: Iterator<Item = (A, B, C, D, E, F, G, H)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH)
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI)> for TupleCombinations<I, T>
where
IT: Iterator<Item = (A, B, C, D, E, F, G, H, I)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
FromI: Default + Extend<I>,
fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI)
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ)> for TupleCombinations<I, T>
where
IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
FromI: Default + Extend<I>,
FromJ: Default + Extend<J>,
fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ)
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ, K, FromK> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK)> for TupleCombinations<I, T>
where
IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J, K)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
FromI: Default + Extend<I>,
FromJ: Default + Extend<J>,
FromK: Default + Extend<K>,
fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK)
impl<IT, A, FromA, B, FromB, C, FromC, D, FromD, E, FromE, F, FromF, G, FromG, H, FromH, I, FromI, J, FromJ, K, FromK, L, FromL> MultiUnzip<(FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)> for TupleCombinations<I, T>
where
IT: Iterator<Item = (A, B, C, D, E, F, G, H, I, J, K, L)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
FromC: Default + Extend<C>,
FromD: Default + Extend<D>,
FromE: Default + Extend<E>,
FromF: Default + Extend<F>,
FromG: Default + Extend<G>,
FromH: Default + Extend<H>,
FromI: Default + Extend<I>,
FromJ: Default + Extend<J>,
FromK: Default + Extend<K>,
FromL: Default + Extend<L>,
fn multiunzip(self) -> (FromA, FromB, FromC, FromD, FromE, FromF, FromG, FromH, FromI, FromJ, FromK, FromL)
impl<T> Any for TupleCombinations<I, T>
where
T: 'static + ?Sized,
fn type_id(&self) -> TypeId
impl<T> Borrow<T> for TupleCombinations<I, T>
where
T: ?Sized,
fn borrow(&self) -> &T
impl<T> BorrowMut<T> for TupleCombinations<I, T>
where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
impl<T> CloneToUninit for TupleCombinations<I, T>
where
T: Clone,
unsafe fn clone_to_uninit(&self, dest: *mut u8)
impl<T> From<T> for TupleCombinations<I, T>
fn from(t: T) -> TReturns the argument unchanged.
impl<T> IntoEither for TupleCombinations<I, T>
impl<T> Itertools for TupleCombinations<I, T>
where
T: Iterator + ?Sized,
impl<T> ToOwned for TupleCombinations<I, T>
where
T: Clone,
type Owned = T;fn to_owned(&self) -> Tfn clone_into(&self, target: &mut T)
impl<T, U> Into<U> for TupleCombinations<I, T>
where
U: From<T>,
fn into(self) -> UCalls
U::from(self).That is, this conversion is whatever the implementation of
[From]<T> for Uchooses to do.
impl<T, U> TryFrom<U> for TupleCombinations<I, T>
where
U: Into<T>,
type Error = never;fn try_from(value: U) -> Result<T, never>
impl<T, U> TryInto<U> for TupleCombinations<I, T>
where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error;fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>