Struct BinarySearchST

pub struct BinarySearchST<K, V> { /* private fields */ }

Implementations

impl<K: PartialOrd, V> BinarySearchST<K, V>

pub fn new(capacity: usize) -> Self

use algorithms_fourth::search::binary_search::BinarySearchST;
let bst :BinarySearchST<usize,usize > = BinarySearchST::new(10);

Trait Implementations

impl<K: PartialOrd, V> ST<K, V> for BinarySearchST<K, V>

fn put(&mut self, key: K, value: V)

fn get(&self, key: &K) -> Option<&V>

fn delete(&mut self, key: &K)

fn is_empty(&self) -> bool

fn size(&self) -> usize

fn min(&self) -> Option<&K>

fn max(&self) -> Option<&K>

fn floor(&self, key: &K) -> Option<&K>

小于等于该值的键中的最大值

fn ceiling(&self, key: &K) -> Option<&K>

大于等于该值的键中的最小值

fn rank(&self, key: &K) -> usize

小于key的键的数量

fn select(&self, k: usize) -> Option<&K>

从小到大排序，第k个位置的键值(从0开始)

fn contains(&self, key: &K) -> bool

fn delete_min(&mut self)

fn delete_max(&mut self)

fn size_in(&self, lo: &K, hi: &K) -> usize