Struct Sort 

pub struct Sort<T, F> { /* private fields */ }

This data structure tracks the n top values given a stream. It uses only O(n) space.

Implementations

impl<T, F> Sort<T, F>

pub fn new(cmp: F, n: usize) -> Self

Create an empty Sort data structure with the specified n capacity.

pub fn capacity(&self) -> usize

The n top elements we have capacity to track.

pub fn len(&self) -> usize

The number of elements currently held.

pub fn is_empty(&self) -> bool

If .len() == 0

pub fn clear(&mut self)

Clears the Sort data structure, as if it was new.

pub fn iter(&self) -> Iter<'_, T>

An iterator visiting all elements in ascending order. The iterator element type is &'_ T.

impl<T, F> Sort<T, F>

where F: Fn(&T, &T) -> Ordering,

pub fn push(&mut self, item: T)

“Visit” an element.

Trait Implementations

impl<T, F> Add for Sort<T, F>

where F: Fn(&T, &T) -> Ordering,

type Output = Sort<T, F>

The resulting type after applying the + operator.

fn add(self, other: Self) -> Self

Performs the + operation.

impl<T, F> AddAssign for Sort<T, F>

where F: Fn(&T, &T) -> Ordering,

fn add_assign(&mut self, other: Self)

Performs the += operation.

impl<T: Clone, F: Clone> Clone for Sort<T, F>

fn clone(&self) -> Sort<T, F>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T, F> Debug for Sort<T, F>

where T: Debug,

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

Formats the value using the given formatter.

impl<'de, T, F> Deserialize<'de> for Sort<T, F>

where T: Deserialize<'de>, F: Deserialize<'de> + for<'a> Fn<(&'a T, &'a T), Output = Ordering>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T, F> IntoIterator for Sort<T, F>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T, F> Serialize for Sort<T, F>

where T: Serialize, F: Serialize + for<'a> Fn<(&'a T, &'a T), Output = Ordering>,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T, F> Sum<Sort<T, F>> for Option<Sort<T, F>>

where F: Fn(&T, &T) -> Ordering,

fn sum<I>(iter: I) -> Self

where I: Iterator<Item = Sort<T, F>>,

Takes an iterator and generates Self from the elements by “summing up” the items.