Struct Permutations
#[must_use = "iterator adaptors are lazy and do nothing unless consumed"]
pub struct Permutations<I: Iterator> { /* private fields */ }An iterator adaptor that iterates through all the k-permutations of the
elements from an iterator.
See .permutations() for
more information.
Trait Implementations
impl<I> Clone for Permutations<I>
where
I: Clone + Iterator,
I::Item: Clone,
fn clone(&self) -> Self
impl<I> Debug for Permutations<I>
where
I: Iterator + Debug,
I::Item: Debug,
fn fmt(&self, f: &mut Formatter<'_>) -> Result
impl<I> FusedIterator for Permutations<I>
where
I: Iterator,
I::Item: Clone,
impl<I> Iterator for Permutations<I>
where
I: Iterator,
I::Item: Clone,
type Item = Vec<<I as Iterator>::Item>;fn next(&mut self) -> Option<Self::Item>fn count(self) -> usizefn size_hint(&self) -> (usize, Option<usize>)
Auto Trait Implementations
impl<I> Freeze for Permutations<I>
where
LazyBuffer<I>: Freeze,
impl<I> RefUnwindSafe for Permutations<I>
where
LazyBuffer<I>: RefUnwindSafe,
impl<I> Send for Permutations<I>
where
LazyBuffer<I>: Send,
impl<I> Sync for Permutations<I>
where
LazyBuffer<I>: Sync,
impl<I> Unpin for Permutations<I>
where
LazyBuffer<I>: Unpin,
impl<I> UnsafeUnpin for Permutations<I>
where
LazyBuffer<I>: UnsafeUnpin,
impl<I> UnwindSafe for Permutations<I>
where
LazyBuffer<I>: UnwindSafe,
Blanket Implementations
impl<I> IntoIterator for Permutations<I>
where
I: Iterator,
type Item = <I as Iterator>::Item;type IntoIter = I;fn into_iter(self) -> I
impl<T> Any for Permutations<I>
where
T: 'static + ?Sized,
fn type_id(&self) -> TypeId
impl<T> Borrow<T> for Permutations<I>
where
T: ?Sized,
fn borrow(&self) -> &T
impl<T> BorrowMut<T> for Permutations<I>
where
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
impl<T> CloneToUninit for Permutations<I>
where
T: Clone,
unsafe fn clone_to_uninit(&self, dest: *mut u8)
impl<T> From<T> for Permutations<I>
fn from(t: T) -> TReturns the argument unchanged.
impl<T> IntoEither for Permutations<I>
impl<T> Itertools for Permutations<I>
where
T: Iterator + ?Sized,
impl<T> ToOwned for Permutations<I>
where
T: Clone,
type Owned = T;fn to_owned(&self) -> Tfn clone_into(&self, target: &mut T)
impl<T, U> Into<U> for Permutations<I>
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 Permutations<I>
where
U: Into<T>,
type Error = never;fn try_from(value: U) -> Result<T, never>
impl<T, U> TryInto<U> for Permutations<I>
where
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error;fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>