Struct itertools::kmerge_impl::HeadTail
source · struct HeadTail<I>where
I: Iterator,{
head: I::Item,
tail: I,
}
Expand description
Head element and Tail iterator pair
PartialEq
, Eq
, PartialOrd
and Ord
are implemented by comparing sequences based on
first items (which are guaranteed to exist).
The meanings of PartialOrd
and Ord
are reversed so as to turn the heap used in
KMerge
into a min-heap.
Fields§
§head: I::Item
§tail: I
Implementations§
source§impl<I> HeadTail<I>where
I: Iterator,
impl<I> HeadTail<I>where I: Iterator,
Trait Implementations§
Auto Trait Implementations§
impl<I> RefUnwindSafe for HeadTail<I>where I: RefUnwindSafe, <I as Iterator>::Item: RefUnwindSafe,
impl<I> Send for HeadTail<I>where I: Send, <I as Iterator>::Item: Send,
impl<I> Sync for HeadTail<I>where I: Sync, <I as Iterator>::Item: Sync,
impl<I> Unpin for HeadTail<I>where I: Unpin, <I as Iterator>::Item: Unpin,
impl<I> UnwindSafe for HeadTail<I>where I: UnwindSafe, <I as Iterator>::Item: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more