Struct SortedList 

pub struct SortedList { /* private fields */ }

Treap-backed sorted list of i64 keys with multiplicity.

Implementations

impl SortedList

pub fn new() -> Self

Construct an empty sorted list.

pub fn insert(&mut self, key: i64)

Insert a key. Duplicates are allowed.

pub fn remove(&mut self, key: i64)

Remove one occurrence of key.

pub fn bisect_left(&self, key: i64) -> usize

Number of keys strictly less than key.

pub fn bisect_right(&self, key: i64) -> usize

Number of keys less than or equal to key.

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

Get the element at index (0-based), or None if out of bounds.

pub fn len(&self) -> usize

Number of elements in the list (with multiplicities).

pub fn is_empty(&self) -> bool

Whether the list is empty.