[−][src]Struct geo_booleanop::splay::SplayTree
Methods
impl<K, V, C> SplayTree<K, V, C> where
C: Fn(&K, &K) -> Ordering,
[src]
C: Fn(&K, &K) -> Ordering,
pub fn new(comparator: C) -> SplayTree<K, V, C>
[src]
pub fn len(&self) -> usize
[src]
pub fn is_empty(&self) -> bool
[src]
pub fn clear(&mut self)
[src]
pub fn contains(&self, key: &K) -> bool
[src]
pub fn get(&self, key: &K) -> Option<&V>
[src]
pub fn get_mut(&mut self, key: &K) -> Option<&mut V>
[src]
Return a mutable reference to the value corresponding to the key
pub fn find_key(&self, key: &K) -> Option<&K>
[src]
pub fn next(&self, key: &K) -> Option<(&K, &V)>
[src]
pub fn prev(&self, key: &K) -> Option<(&K, &V)>
[src]
pub fn insert(&mut self, key: K, value: V) -> Option<V>
[src]
pub fn remove(&mut self, key: &K) -> Option<V>
[src]
pub fn min(&self) -> Option<&K>
[src]
pub fn max(&self) -> Option<&K>
[src]
Trait Implementations
impl<K, V, C> Drop for SplayTree<K, V, C> where
C: Fn(&K, &K) -> Ordering,
[src]
C: Fn(&K, &K) -> Ordering,
impl<K, V, C> IntoIterator for SplayTree<K, V, C> where
C: Fn(&K, &K) -> Ordering,
[src]
C: Fn(&K, &K) -> Ordering,
type Item = (K, V)
The type of the elements being iterated over.
type IntoIter = IntoIter<K, V>
Which kind of iterator are we turning this into?
fn into_iter(self) -> Self::IntoIter
[src]
impl<K, V, C> Extend<(K, V)> for SplayTree<K, V, C> where
C: Fn(&K, &K) -> Ordering,
[src]
C: Fn(&K, &K) -> Ordering,
fn extend<I: IntoIterator<Item = (K, V)>>(&mut self, i: I)
[src]
impl<'a, K, V, C> Index<&'a K> for SplayTree<K, V, C> where
C: Fn(&K, &K) -> Ordering,
[src]
C: Fn(&K, &K) -> Ordering,
impl<'a, K, V, C> IndexMut<&'a K> for SplayTree<K, V, C> where
C: Fn(&K, &K) -> Ordering,
[src]
C: Fn(&K, &K) -> Ordering,
impl<K, V, C> Debug for SplayTree<K, V, C> where
K: Debug,
V: Debug,
C: Fn(&K, &K) -> Ordering,
[src]
K: Debug,
V: Debug,
C: Fn(&K, &K) -> Ordering,
Auto Trait Implementations
impl<K, V, C> Send for SplayTree<K, V, C> where
C: Send,
K: Send,
V: Send,
C: Send,
K: Send,
V: Send,
impl<K, V, C> Unpin for SplayTree<K, V, C> where
C: Unpin,
C: Unpin,
impl<K, V, C> !Sync for SplayTree<K, V, C>
impl<K, V, C> UnwindSafe for SplayTree<K, V, C> where
C: UnwindSafe,
K: UnwindSafe,
V: UnwindSafe,
C: UnwindSafe,
K: UnwindSafe,
V: UnwindSafe,
impl<K, V, C> !RefUnwindSafe for SplayTree<K, V, C>
Blanket Implementations
impl<I> IntoIterator for I where
I: Iterator,
[src]
I: Iterator,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
fn into_iter(self) -> I
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,