Struct sortedlist_rs::SortedList

pub struct SortedList<T>where
    T: Ord,{ /* private fields */ }

Implementations

impl<T> SortedList<T>where
    T: Ord,

pub fn new() -> Self

Creates an empty SortedList.

pub fn kth_smallest(&self, k: usize) -> &T

Find the k-th smallest (0-indexed) element in the SortedList.

pub fn insert(&mut self, element: T)

Insert element into the SortedList.

pub fn remove(&mut self, k: usize) -> T

Pops the k-th smallest (0-indexed) element from the SortedList.

pub fn binary_search(&self, element: &T) -> Result<usize, usize>

Binary searches the given element in the SortedList. Returns Ok(i) for exact match, Err(i) otherwise.

pub fn len(&self) -> usize

Returns the number of elements stored in the SortedList.

pub fn is_empty(&self) -> bool

Returns whether the SortedList is empty.

pub fn last(&self) -> Option<&T>

Returns the last element of the SortedList, i.e. the largest element.

pub fn first(&self) -> Option<&T>

Returns the first element of the SortedList, i.e. the smallest element.

pub fn get(&self, index: usize) -> Option<&T>

Returns the element for the given index in the SortedList.

Trait Implementations

impl<T> Debug for SortedList<T>where
    T: Ord + Debug,

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

Formats the value using the given formatter.

impl<T> Default for SortedList<T>where
    T: Ord,

fn default() -> Self

Creates an empty SortedList.

impl<T> From<Vec<T, Global>> for SortedList<T>where
    T: Ord,

fn from(array: Vec<T>) -> Self

Creates a SortedList from a Vec

impl<T> Index<usize> for SortedList<T>where
    T: Ord,

fn index(&self, index: usize) -> &Self::Output

Access the SortedList for the given index.

type Output = T

The returned type after indexing.