Struct priority_container::stable::max::StablePrioContainerMax

pub struct StablePrioContainerMax<T> { /* private fields */ }

A stable priority container max. This means equal elements are returned in inserted order

Implementations

impl<T: Ord> StablePrioContainerMax<T>

pub fn new(capacity: usize) -> Self

Creates a new StablePrioContainer with given max items. This value must not be smaller than 1

Panics

Panics if capacity is 0

pub fn new_allocated(capacity: usize, alloc_size: usize) -> Self

Create a new StablePrioContainer with given preallocated size. capacity must not be smaller than 1

Panics

Panics if capacity is 0

pub fn insert(&mut self, item: T) -> bool

Pushes a new element into the PrioContainer

pub fn contains(&self, item: &T) -> bool

pub fn into_sorted_vec(self) -> Vec<T>

Return a sorted vec of the prio container

impl<T> StablePrioContainerMax<T>

pub fn len(&self) -> usize

Returns the amount of items currently stored in the PrioContainer

pub fn is_empty(&self) -> bool

Returns true if no items have been pushed onto the PrioContainer

pub fn capacity(&self) -> usize

pub fn total_pushed(&self) -> usize

Trait Implementations

impl<T: Ord> Extend<T> for StablePrioContainerMax<T>

fn extend<I: IntoIterator<Item = T>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬 This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬 This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T: Ord> IntoIterator for StablePrioContainerMax<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = StableHeapIterMax<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.