Trait PushSorted

pub trait PushSorted<T>: CanPush<T> {
    // Required method
    fn push_sorted(&mut self, val: T) -> Option<Self::PushedOut>;
}

A trait for moving data into a collection while retaining a sorted invariant.

Unlike Push, sorted pushes must take a logarithmic amount of time and space with respect to the length of the collection.

Required Methods

fn push_sorted(&mut self, val: T) -> Option<Self::PushedOut>

Moves the value into the collection, yielding the value that was pushed out, if any.

This method should retain some sort of sorting invariant within the collection.

Implementations on Foreign Types

impl<K: Ord, V> PushSorted<(K, V)> for BTreeMap<K, V>

fn push_sorted(&mut self, (key, val): (K, V)) -> Option<Self::PushedOut>

impl<T: Ord> PushSorted<T> for BinaryHeap<T>

fn push_sorted(&mut self, val: T) -> Option<Self::PushedOut>

impl<T: Ord> PushSorted<T> for BTreeSet<T>

fn push_sorted(&mut self, val: T) -> Option<Self::PushedOut>

Implementors