# Struct std::collections::binary_heap::IntoIterSorted
[−][src]

    pub struct IntoIterSorted<T> { /* fields omitted */ }

🔬 This is a nightly-only experimental API. (`binary_heap_into_iter_sorted` #59278)

## Trait Implementations

[src]
`impl<T> Clone for IntoIterSorted<T> where
T: Clone,`
[src]
`pub fn clone(&self) -> IntoIterSorted<T>ⓘ

### Notable traits for IntoIterSorted<T>

`impl<T> Iterator for IntoIterSorted<T> where
T: Ord, type Item = T;`
`

Returns a copy of the value. Read more

1.0.0[src]
`fn clone_from(&mut self, source: &Self)`

Performs copy-assignment from `source`. Read more

[src]
`impl<T> Debug for IntoIterSorted<T> where
T: Debug,`
[src]
`pub fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>`

Formats the value using the given formatter. Read more

[src]
`impl<T> ExactSizeIterator for IntoIterSorted<T> where
T: Ord,`
1.0.0[src]
`fn len(&self) -> usize`

Returns the exact length of the iterator. Read more

[src]
`fn is_empty(&self) -> bool`
🔬 This is a nightly-only experimental API. (`exact_size_is_empty` #35428)

Returns `true` if the iterator is empty. Read more

[src]
`impl<T> Iterator for IntoIterSorted<T> where
T: Ord,`
`type Item = T`

The type of the elements being iterated over.

[src]
`pub fn next(&mut self) -> Option<T>`

Advances the iterator and returns the next value. Read more

[src]
`pub fn size_hint(&self) -> (usize, Option<usize>)`

Returns the bounds on the remaining length of the iterator. Read more

1.0.0[src]
`fn count(self) -> usize`

Consumes the iterator, counting the number of iterations and returning it. Read more

1.0.0[src]
`fn last(self) -> Option<Self::Item>`

Consumes the iterator, returning the last element. Read more

[src]
`fn advance_by(&mut self, n: usize) -> Result<(), usize>`
🔬 This is a nightly-only experimental API. (`iter_advance_by` #77404)

recently added

Advances the iterator by `n` elements. Read more

1.0.0[src]
`fn nth(&mut self, n: usize) -> Option<Self::Item>`

Returns the `n`th element of the iterator. Read more

1.28.0[src]
`fn step_by(self, step: usize) -> StepBy<Self>ⓘ

### Notable traits for StepBy<I>

`impl<I> Iterator for StepBy<I> where
I: Iterator, type Item = <I as Iterator>::Item;`
`

Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Read more

1.0.0[src]
`fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter>ⓘ

### Notable traits for Chain<A, B>

`impl<A, B> Iterator for Chain<A, B> where
B: Iterator<Item = <A as Iterator>::Item>,
A: Iterator, type Item = <A as Iterator>::Item;`
where
U: IntoIterator<Item = Self::Item>,`

Takes two iterators and creates a new iterator over both in sequence. Read more

1.0.0[src]
`fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter>ⓘ

### Notable traits for Zip<A, B>

`impl<A, B> Iterator for Zip<A, B> where
B: Iterator,
A: Iterator, type Item = (<A as Iterator>::Item, <B as Iterator>::Item);`
where
U: IntoIterator,`

‘Zips up’ two iterators into a single iterator of pairs. Read more

[src]
`fn intersperse(self, separator: Self::Item) -> Intersperse<Self>ⓘ

### Notable traits for Intersperse<I>

`impl<I> Iterator for Intersperse<I> where
I: Iterator,
<I as Iterator>::Item: Clone, type Item = <I as Iterator>::Item;`
where
Self::Item: Clone,`
🔬 This is a nightly-only experimental API. (`iter_intersperse` #79524)

recently added

Creates a new iterator which places a copy of `separator` between adjacent items of the original iterator. Read more

[src]
`fn intersperse_with<G>(self, separator: G) -> IntersperseWith<Self, G>ⓘ

### Notable traits for IntersperseWith<I, G>

`impl<I, G> Iterator for IntersperseWith<I, G> where
I: Iterator,
G: FnMut() -> <I as Iterator>::Item, type Item = <I as Iterator>::Item;`
where
G: FnMut() -> Self::Item,`
🔬 This is a nightly-only experimental API. (`iter_intersperse` #79524)

recently added

Creates a new iterator which places an item generated by `separator` between adjacent items of the original iterator. Read more

1.0.0[src]
`fn map<B, F>(self, f: F) -> Map<Self, F>ⓘ

### Notable traits for Map<I, F>

`impl<B, I, F> Iterator for Map<I, F> where
F: FnMut(<I as Iterator>::Item) -> B,
I: Iterator, type Item = B;`
where
F: FnMut(Self::Item) -> B,`

Takes a closure and creates an iterator which calls that closure on each element. Read more

1.21.0[src]
`fn for_each<F>(self, f: F) where
F: FnMut(Self::Item),`

Calls a closure on each element of an iterator. Read more

1.0.0[src]
`fn filter<P>(self, predicate: P) -> Filter<Self, P>ⓘ

### Notable traits for Filter<I, P>

`impl<I, P> Iterator for Filter<I, P> where
I: Iterator,
P: FnMut(&<I as Iterator>::Item) -> bool, type Item = <I as Iterator>::Item;`
where
P: FnMut(&Self::Item) -> bool,`

Creates an iterator which uses a closure to determine if an element should be yielded. Read more

1.0.0[src]
`fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F>ⓘ

### Notable traits for FilterMap<I, F>

`impl<B, I, F> Iterator for FilterMap<I, F> where
F: FnMut(<I as Iterator>::Item) -> Option<B>,
I: Iterator, type Item = B;`
where
F: FnMut(Self::Item) -> Option<B>,`

Creates an iterator that both filters and maps. Read more

1.0.0[src]
`fn enumerate(self) -> Enumerate<Self>ⓘ

### Notable traits for Enumerate<I>

`impl<I> Iterator for Enumerate<I> where
I: Iterator, type Item = (usize, <I as Iterator>::Item);`
`

Creates an iterator which gives the current iteration count as well as the next value. Read more

1.0.0[src]
`fn peekable(self) -> Peekable<Self>ⓘ

### Notable traits for Peekable<I>

`impl<I> Iterator for Peekable<I> where
I: Iterator, type Item = <I as Iterator>::Item;`
`

Creates an iterator which can use the `peek` and `peek_mut` methods to look at the next element of the iterator without consuming it. See their documentation for more information. Read more

1.0.0[src]
`fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P>ⓘ

### Notable traits for SkipWhile<I, P>

`impl<I, P> Iterator for SkipWhile<I, P> where
I: Iterator,
P: FnMut(&<I as Iterator>::Item) -> bool, type Item = <I as Iterator>::Item;`
where
P: FnMut(&Self::Item) -> bool,`

Creates an iterator that `skip`s elements based on a predicate. Read more

1.0.0[src]
`fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P>ⓘ

### Notable traits for TakeWhile<I, P>

`impl<I, P> Iterator for TakeWhile<I, P> where
I: Iterator,
P: FnMut(&<I as Iterator>::Item) -> bool, type Item = <I as Iterator>::Item;`
where
P: FnMut(&Self::Item) -> bool,`

Creates an iterator that yields elements based on a predicate. Read more

[src]
`fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P>ⓘ

### Notable traits for MapWhile<I, P>

`impl<B, I, P> Iterator for MapWhile<I, P> where
I: Iterator,
P: FnMut(<I as Iterator>::Item) -> Option<B>, type Item = B;`
where
P: FnMut(Self::Item) -> Option<B>,`
🔬 This is a nightly-only experimental API. (`iter_map_while` #68537)

recently added

Creates an iterator that both yields elements based on a predicate and maps. Read more

1.0.0[src]
`fn skip(self, n: usize) -> Skip<Self>ⓘ

### Notable traits for Skip<I>

`impl<I> Iterator for Skip<I> where
I: Iterator, type Item = <I as Iterator>::Item;`
`

Creates an iterator that skips the first `n` elements. Read more

1.0.0[src]
`fn take(self, n: usize) -> Take<Self>ⓘ

### Notable traits for Take<I>

`impl<I> Iterator for Take<I> where
I: Iterator, type Item = <I as Iterator>::Item;`
`

Creates an iterator that yields the first `n` elements, or fewer if the underlying iterator ends sooner. Read more

1.0.0[src]
`fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F>ⓘ

### Notable traits for Scan<I, St, F>

`impl<B, I, St, F> Iterator for Scan<I, St, F> where
F: FnMut(&mut St, <I as Iterator>::Item) -> Option<B>,
I: Iterator, type Item = B;`
where
F: FnMut(&mut St, Self::Item) -> Option<B>,`

An iterator adaptor similar to `fold` that holds internal state and produces a new iterator. Read more

1.0.0[src]
`fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F>ⓘ

### Notable traits for FlatMap<I, U, F>

`impl<I, U, F> Iterator for FlatMap<I, U, F> where
F: FnMut(<I as Iterator>::Item) -> U,
I: Iterator,
U: IntoIterator, type Item = <U as IntoIterator>::Item;`
where
F: FnMut(Self::Item) -> U,
U: IntoIterator,`

Creates an iterator that works like map, but flattens nested structure. Read more

1.29.0[src]
`fn flatten(self) -> Flatten<Self>ⓘ

### Notable traits for Flatten<I>

`impl<I, U> Iterator for Flatten<I> where
I: Iterator,
U: Iterator,
<I as Iterator>::Item: IntoIterator,
<<I as Iterator>::Item as IntoIterator>::IntoIter == U,
<<I as Iterator>::Item as IntoIterator>::Item == <U as Iterator>::Item, type Item = <U as Iterator>::Item;`
where
Self::Item: IntoIterator,`

Creates an iterator that flattens nested structure. Read more

1.0.0[src]
`fn fuse(self) -> Fuse<Self>ⓘ

### Notable traits for Fuse<I>

`impl<I> Iterator for Fuse<I> where
I: Iterator, type Item = <I as Iterator>::Item;`
`

Creates an iterator which ends after the first `None`. Read more

1.0.0[src]
`fn inspect<F>(self, f: F) -> Inspect<Self, F>ⓘ

### Notable traits for Inspect<I, F>

`impl<I, F> Iterator for Inspect<I, F> where
F: FnMut(&<I as Iterator>::Item),
I: Iterator, type Item = <I as Iterator>::Item;`
where
F: FnMut(&Self::Item),`

Does something with each element of an iterator, passing the value on. Read more

1.0.0[src]
`fn by_ref(&mut self) -> &mut Self`

Borrows an iterator, rather than consuming it. Read more

1.0.0[src]
`fn collect<B>(self) -> B where
B: FromIterator<Self::Item>,`

Transforms an iterator into a collection. Read more

1.0.0[src]
`fn partition<B, F>(self, f: F) -> (B, B) where
F: FnMut(&Self::Item) -> bool,
B: Default + Extend<Self::Item>,`

Consumes an iterator, creating two collections from it. Read more

[src]
`fn partition_in_place<'a, T, P>(self, predicate: P) -> usize where
Self: DoubleEndedIterator<Item = &'a mut T>,
T: 'a,
P: FnMut(&T) -> bool,`
🔬 This is a nightly-only experimental API. (`iter_partition_in_place` #62543)

new API

Reorders the elements of this iterator in-place according to the given predicate, such that all those that return `true` precede all those that return `false`. Returns the number of `true` elements found. Read more

[src]
`fn is_partitioned<P>(self, predicate: P) -> bool where
P: FnMut(Self::Item) -> bool,`
🔬 This is a nightly-only experimental API. (`iter_is_partitioned` #62544)

new API

Checks if the elements of this iterator are partitioned according to the given predicate, such that all those that return `true` precede all those that return `false`. Read more

1.27.0[src]
`fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, Self::Item) -> R,
R: Try<Output = B>,`

An iterator method that applies a function as long as it returns successfully, producing a single, final value. Read more

1.27.0[src]
`fn try_for_each<F, R>(&mut self, f: F) -> R where
F: FnMut(Self::Item) -> R,
R: Try<Output = ()>,`

An iterator method that applies a fallible function to each item in the iterator, stopping at the first error and returning that error. Read more

1.0.0[src]
`fn fold<B, F>(self, init: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B,`

Folds every element into an accumulator by applying an operation, returning the final result. Read more

1.51.0[src]
`fn reduce<F>(self, f: F) -> Option<Self::Item> where
F: FnMut(Self::Item, Self::Item) -> Self::Item,`

Reduces the elements to a single one, by repeatedly applying a reducing operation. Read more

1.0.0[src]
`fn all<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,`

Tests if every element of the iterator matches a predicate. Read more

1.0.0[src]
`fn any<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,`

Tests if any element of the iterator matches a predicate. Read more

1.0.0[src]
`fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
P: FnMut(&Self::Item) -> bool,`

Searches for an element of an iterator that satisfies a predicate. Read more

1.30.0[src]
`fn find_map<B, F>(&mut self, f: F) -> Option<B> where
F: FnMut(Self::Item) -> Option<B>,`

Applies function to the elements of iterator and returns the first non-none result. Read more

[src]
`fn try_find<F, R, E>(&mut self, f: F) -> Result<Option<Self::Item>, E> where
F: FnMut(&Self::Item) -> R,
R: Try<Output = bool, Residual = Result<Infallible, E>> + Try,`
🔬 This is a nightly-only experimental API. (`try_find` #63178)

new API

Applies function to the elements of iterator and returns the first true result or the first error. Read more

1.0.0[src]
`fn position<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,`

Searches for an element in an iterator, returning its index. Read more

1.0.0[src]
`fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
Self: ExactSizeIterator + DoubleEndedIterator,
P: FnMut(Self::Item) -> bool,`

Searches for an element in an iterator from the right, returning its index. Read more

1.0.0[src]
`fn max(self) -> Option<Self::Item> where
Self::Item: Ord,`

Returns the maximum element of an iterator. Read more

1.0.0[src]
`fn min(self) -> Option<Self::Item> where
Self::Item: Ord,`

Returns the minimum element of an iterator. Read more

1.6.0[src]
`fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
F: FnMut(&Self::Item) -> B,
B: Ord,`

Returns the element that gives the maximum value from the specified function. Read more

1.15.0[src]
`fn max_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,`

Returns the element that gives the maximum value with respect to the specified comparison function. Read more

1.6.0[src]
`fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
F: FnMut(&Self::Item) -> B,
B: Ord,`

Returns the element that gives the minimum value from the specified function. Read more

1.15.0[src]
`fn min_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,`

Returns the element that gives the minimum value with respect to the specified comparison function. Read more

1.0.0[src]
`fn rev(self) -> Rev<Self>ⓘ

### Notable traits for Rev<I>

`impl<I> Iterator for Rev<I> where
I: DoubleEndedIterator, type Item = <I as Iterator>::Item;`
where
Self: DoubleEndedIterator,`

Reverses an iterator’s direction. Read more

1.0.0[src]
`fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
Self: Iterator<Item = (A, B)>,
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,`

Converts an iterator of pairs into a pair of containers. Read more

1.36.0[src]
`fn copied<'a, T>(self) -> Copied<Self>ⓘ

### Notable traits for Copied<I>

`impl<'a, I, T> Iterator for Copied<I> where
T: 'a + Copy,
I: Iterator<Item = &'a T>, type Item = T;`
where
Self: Iterator<Item = &'a T>,
T: 'a + Copy,`

Creates an iterator which copies all of its elements. Read more

1.0.0[src]
`fn cloned<'a, T>(self) -> Cloned<Self>ⓘ

### Notable traits for Cloned<I>

`impl<'a, I, T> Iterator for Cloned<I> where
T: 'a + Clone,
I: Iterator<Item = &'a T>, type Item = T;`
where
Self: Iterator<Item = &'a T>,
T: 'a + Clone,`

Creates an iterator which `clone`s all of its elements. Read more

1.0.0[src]
`fn cycle(self) -> Cycle<Self>ⓘ

### Notable traits for Cycle<I>

`impl<I> Iterator for Cycle<I> where
I: Clone + Iterator, type Item = <I as Iterator>::Item;`
where
Self: Clone,`

Repeats an iterator endlessly. Read more

1.11.0[src]
`fn sum<S>(self) -> S where
S: Sum<Self::Item>,`

Sums the elements of an iterator. Read more

1.11.0[src]
`fn product<P>(self) -> P where
P: Product<Self::Item>,`

Iterates over the entire iterator, multiplying all the elements Read more

1.5.0[src]
`fn cmp<I>(self, other: I) -> Ordering where
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,`

Lexicographically compares the elements of this `Iterator` with those of another. Read more

[src]
`fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering where
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
I: IntoIterator,`
🔬 This is a nightly-only experimental API. (`iter_order_by` #64295)

Lexicographically compares the elements of this `Iterator` with those of another with respect to the specified comparison function. Read more

1.5.0[src]
`fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,`

Lexicographically compares the elements of this `Iterator` with those of another. Read more

[src]
`fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering> where
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
I: IntoIterator,`
🔬 This is a nightly-only experimental API. (`iter_order_by` #64295)

Lexicographically compares the elements of this `Iterator` with those of another with respect to the specified comparison function. Read more

1.5.0[src]
`fn eq<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,`

Determines if the elements of this `Iterator` are equal to those of another. Read more

[src]
`fn eq_by<I, F>(self, other: I, eq: F) -> bool where
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
I: IntoIterator,`
🔬 This is a nightly-only experimental API. (`iter_order_by` #64295)

Determines if the elements of this `Iterator` are equal to those of another with respect to the specified equality function. Read more

1.5.0[src]
`fn ne<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,`

Determines if the elements of this `Iterator` are unequal to those of another. Read more

1.5.0[src]
`fn lt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,`

Determines if the elements of this `Iterator` are lexicographically less than those of another. Read more

1.5.0[src]
`fn le<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,`

Determines if the elements of this `Iterator` are lexicographically less or equal to those of another. Read more

1.5.0[src]
`fn gt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,`

Determines if the elements of this `Iterator` are lexicographically greater than those of another. Read more

1.5.0[src]
`fn ge<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,`

Determines if the elements of this `Iterator` are lexicographically greater than or equal to those of another. Read more

[src]
`fn is_sorted(self) -> bool where
Self::Item: PartialOrd<Self::Item>,`
🔬 This is a nightly-only experimental API. (`is_sorted` #53485)

new API

Checks if the elements of this iterator are sorted. Read more

[src]
`fn is_sorted_by<F>(self, compare: F) -> bool where
F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,`
🔬 This is a nightly-only experimental API. (`is_sorted` #53485)

new API

Checks if the elements of this iterator are sorted using the given comparator function. Read more

[src]
`fn is_sorted_by_key<F, K>(self, f: F) -> bool where
F: FnMut(Self::Item) -> K,
K: PartialOrd<K>,`
🔬 This is a nightly-only experimental API. (`is_sorted` #53485)

new API

Checks if the elements of this iterator are sorted using the given key extraction function. Read more

[src]
`impl<T> FusedIterator for IntoIterSorted<T> where
T: Ord,`
[src]
`impl<T> TrustedLen for IntoIterSorted<T> where
T: Ord,`

## Auto Trait Implementations

`impl<T> RefUnwindSafe for IntoIterSorted<T> where
T: RefUnwindSafe,`
`impl<T> Send for IntoIterSorted<T> where
T: Send,`
`impl<T> Sync for IntoIterSorted<T> where
T: Sync,`
`impl<T> Unpin for IntoIterSorted<T> where
T: Unpin,`
`impl<T> UnwindSafe for IntoIterSorted<T> where
T: UnwindSafe,`

## Blanket Implementations

[src]
`impl<T> Any for T where
T: 'static + ?Sized,`
[src]
`pub fn type_id(&self) -> TypeId`

Gets the `TypeId` of `self`. Read more

[src]
`impl<T> Borrow<T> for T where
T: ?Sized,`
[src]
`pub fn borrow(&self) -> &T`

Immutably borrows from an owned value. Read more

[src]
`impl<T> BorrowMut<T> for T where
T: ?Sized,`
[src]
`pub fn borrow_mut(&mut self) -> &mut T`

Mutably borrows from an owned value. Read more

[src]
`impl<T> From<T> for T`
[src]
`pub fn from(t: T) -> T`

Performs the conversion.

[src]
`impl<T, U> Into<U> for T where
U: From<T>,`
[src]
`pub fn into(self) -> U`

Performs the conversion.

[src]
`impl<I> IntoIterator for I where
I: Iterator,`
`type Item = <I as Iterator>::Item`

The type of the elements being iterated over.

`type IntoIter = I`

Which kind of iterator are we turning this into?

[src]
`pub fn into_iter(self) -> I`

Creates an iterator from a value. Read more

[src]
`impl<T> ToOwned for T where
T: Clone,`
`type Owned = T`

The resulting type after obtaining ownership.

[src]
`pub fn to_owned(&self) -> T`

Creates owned data from borrowed data, usually by cloning. Read more

[src]
`pub fn clone_into(&self, target: &mut T)`
🔬 This is a nightly-only experimental API. (`toowned_clone_into` #41263)

recently added

Uses borrowed data to replace owned data, usually by cloning. Read more

[src]
`impl<T, U> TryFrom<U> for T where
U: Into<T>,`
`type Error = Infallible`

The type returned in the event of a conversion error.

[src]
`pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>`

Performs the conversion.

[src]
`impl<T, U> TryInto<U> for T where
U: TryFrom<T>,`
`type Error = <U as TryFrom<T>>::Error`

The type returned in the event of a conversion error.

[src]
`pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>`

Performs the conversion.