Struct priority_container::PrioContainer

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

Priority container storing max capacity amount of items. Can be used to find n smallest items within an iterator or a set of items that implement Ord

Implementations

impl<T: Ord> PrioContainer<T>

pub fn new(capacity: usize) -> Self

Create a new PrioContainerMin with capacity

Panics

Panics if capacity is zero

pub fn new_allocated(capacity: usize) -> Self

Create a new PrioContainerMin with already allocated spaces

Panics

Panics if capacity is zero

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

Inserts a new Item into the queue.

pub fn len(&self) -> usize

Returns the amount of items in the container. This value is always smaller or equal to capacity

pub fn is_empty(&self) -> bool

Returns true if there is no item in the container

pub fn capacity(&self) -> usize

Get the prio container’s capacity

pub fn total_pushed(&self) -> usize

Returns the total amount of items pushed into the prio container

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

Return a sorted vec of the prio container

Trait Implementations

impl<T: Ord> Extend<T> for PrioContainer<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 PrioContainer<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = SortedHeapIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.