Struct IntoIterSorted

#[must_use = "iterators are lazy and do nothing unless consumed"]
pub struct IntoIterSorted<T, A: Allocator = Global> { pub(in ::collections::binary_heap) inner: BinaryHeap<T, A> }

Fields

inner: BinaryHeap<T, A>

Implementations

impl<T, A: Allocator> IntoIterSorted<T, A>

fn allocator(&self) -> &A

Returns a reference to the underlying allocator.

Trait Implementations

impl<T: Clone, A: Clone + Allocator> Clone for IntoIterSorted<T, A>

fn clone(&self) -> IntoIterSorted<T, A>

impl<T: Debug, A: Debug + Allocator> Debug for IntoIterSorted<T, A>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

impl<T: Ord, A: Allocator> ExactSizeIterator for IntoIterSorted<T, A>

impl<T: Ord, A: Allocator> FusedIterator for IntoIterSorted<T, A>

impl<T: Ord, A: Allocator> Iterator for IntoIterSorted<T, A>

type Item = T;
fn next(&mut self) -> Option<T>
fn size_hint(&self) -> (usize, Option<usize>)

impl<T: Ord, A: Allocator> TrustedLen for IntoIterSorted<T, A>

Auto Trait Implementations

impl<T, A> Freeze for IntoIterSorted<T, A> where BinaryHeap<T, A>: Freeze,

impl<T, A> RefUnwindSafe for IntoIterSorted<T, A> where BinaryHeap<T, A>: RefUnwindSafe,

impl<T, A> Send for IntoIterSorted<T, A> where BinaryHeap<T, A>: Send,

impl<T, A> Sync for IntoIterSorted<T, A> where BinaryHeap<T, A>: Sync,

impl<T, A> Unpin for IntoIterSorted<T, A> where BinaryHeap<T, A>: Unpin,

impl<T, A> UnsafeUnpin for IntoIterSorted<T, A> where BinaryHeap<T, A>: UnsafeUnpin,

impl<T, A> UnwindSafe for IntoIterSorted<T, A> where BinaryHeap<T, A>: UnwindSafe,

Blanket Implementations

impl<I> IntoIterator for IntoIterSorted<T, A> where I: Iterator,

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

impl<T> Any for IntoIterSorted<T, A> where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for IntoIterSorted<T, A> where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for IntoIterSorted<T, A> where T: ?Sized,

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

impl<T> CloneToUninit for IntoIterSorted<T, A> where T: Clone,

unsafe fn clone_to_uninit(&self, dest: *mut u8)

impl<T> From<T> for IntoIterSorted<T, A>

fn from(t: T) -> T

Returns the argument unchanged.

impl<T> SizeHint for IntoIterSorted<T, A> where T: ?Sized,

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

impl<T> SizedTypeProperties for IntoIterSorted<T, A>

impl<T> ToOwned for IntoIterSorted<T, A> where T: Clone,

type Owned = T;
fn to_owned(&self) -> T
fn clone_into(&self, target: &mut T)

impl<T, U> Into<U> for IntoIterSorted<T, A> 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 IntoIterSorted<T, A> 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 IntoIterSorted<T, A> where U: TryFrom<T>,

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