pub type DedupByWithCount<I, Pred> = CoalesceBy<I, DedupPredWithCount2CoalescePred<Pred>, WithCount>;
Expand description

An iterator adaptor that removes repeated duplicates, while keeping a count of how many repeated elements were present. This will determine equality using a comparison function.

See .dedup_by_with_count() or .dedup_with_count() for more information.

Aliased Type§

struct DedupByWithCount<I, Pred> {
    iter: I,
    last: Option<Option<<WithCount as CountItem<<I as Iterator>::Item>>::CItem>>,
    f: DedupPredWithCount2CoalescePred<Pred>,
}

Fields§

§iter: I§last: Option<Option<<WithCount as CountItem<<I as Iterator>::Item>>::CItem>>

last is None while no item have been taken out of iter (at definition). Then last will be Some(Some(item)) until iter is exhausted, in which case last will be Some(None).

§f: DedupPredWithCount2CoalescePred<Pred>