Struct DedupSortedIter

pub(in ::collections::btree) struct DedupSortedIter<K, V, I>
where
    I: Iterator<Item = (K, V)>, { pub(in ::collections::btree::dedup_sorted_iter) iter: Peekable<I> }

An iterator for deduping the key of a sorted iterator. When encountering the duplicated key, only the last key-value pair is yielded.

Used by BTreeMap::bulk_build_from_sorted_iter.

Fields

iter: Peekable<I>

Implementations

impl<K, V, I> DedupSortedIter<K, V, I> where I: Iterator<Item = (K, V)>,

fn new(iter: I) -> Self

Trait Implementations

impl<K, V, I> Iterator for DedupSortedIter<K, V, I> where K: Eq, I: Iterator<Item = (K, V)>,

type Item = (K, V);
fn next(&mut self) -> Option<(K, V)>

Auto Trait Implementations

impl<K, V, I> Freeze for DedupSortedIter<K, V, I> where Peekable<I>: Freeze,

impl<K, V, I> RefUnwindSafe for DedupSortedIter<K, V, I> where Peekable<I>: RefUnwindSafe,

impl<K, V, I> Send for DedupSortedIter<K, V, I> where Peekable<I>: Send,

impl<K, V, I> Sync for DedupSortedIter<K, V, I> where Peekable<I>: Sync,

impl<K, V, I> Unpin for DedupSortedIter<K, V, I> where Peekable<I>: Unpin,

impl<K, V, I> UnsafeUnpin for DedupSortedIter<K, V, I> where Peekable<I>: UnsafeUnpin,

impl<K, V, I> UnwindSafe for DedupSortedIter<K, V, I> where Peekable<I>: UnwindSafe,

Blanket Implementations

impl<I> IntoIterator for DedupSortedIter<K, V, I> where I: Iterator,

type Item = <I as Iterator>::Item;
type IntoIter = I;
fn into_iter(self) -> I

impl<T> Any for DedupSortedIter<K, V, I> where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for DedupSortedIter<K, V, I> where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for DedupSortedIter<K, V, I> where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for DedupSortedIter<K, V, I>

fn from(t: T) -> T

Returns the argument unchanged.

impl<T> SizeHint for DedupSortedIter<K, V, I> where T: ?Sized,

fn lower_bound(&self) -> usize
fn upper_bound(&self) -> Option<usize>

impl<T> SizedTypeProperties for DedupSortedIter<K, V, I>

impl<T, U> Into<U> for DedupSortedIter<K, V, I> where U: From<T>,

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of [From]<T> for U chooses to do.

impl<T, U> TryFrom<U> for DedupSortedIter<K, V, I> where U: Into<T>,

type Error = Infallible;
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for DedupSortedIter<K, V, I> where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error;
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>