Struct cranelift_bforest::Set [−][src]
B-tree representing an ordered set of K
s using C
for comparing elements.
This is not a general-purpose replacement for BTreeSet
. See the module
documentation for more information about design tradeoffs.
Sets can be cloned, but that operation should only be used as part of cloning the whole forest they belong to. Cloning a set does not allocate new memory for the clone. It creates an alias of the same memory.
Implementations
impl<K> Set<K> where
K: Copy,
[src]
K: Copy,
pub fn new() -> Self
[src]
Make an empty set.
pub fn is_empty(&self) -> bool
[src]
Is this an empty set?
pub fn contains<C: Comparator<K>>(
&self,
key: K,
forest: &SetForest<K>,
comp: &C
) -> bool
[src]
&self,
key: K,
forest: &SetForest<K>,
comp: &C
) -> bool
Does the set contain key
?.
pub fn insert<C: Comparator<K>>(
&mut self,
key: K,
forest: &mut SetForest<K>,
comp: &C
) -> bool
[src]
&mut self,
key: K,
forest: &mut SetForest<K>,
comp: &C
) -> bool
Try to insert key
into the set.
If the set did not contain key
, insert it and return true.
If key
is already present, don’t change the set and return false.
pub fn remove<C: Comparator<K>>(
&mut self,
key: K,
forest: &mut SetForest<K>,
comp: &C
) -> bool
[src]
&mut self,
key: K,
forest: &mut SetForest<K>,
comp: &C
) -> bool
Remove key
from the set and return true.
If key
was not present in the set, return false.
pub fn clear(&mut self, forest: &mut SetForest<K>)
[src]
Remove all entries.
pub fn retain<F>(&mut self, forest: &mut SetForest<K>, predicate: F) where
F: FnMut(K) -> bool,
[src]
F: FnMut(K) -> bool,
Retains only the elements specified by the predicate.
Remove all elements where the predicate returns false.
pub fn cursor<'a, C: Comparator<K>>(
&'a mut self,
forest: &'a mut SetForest<K>,
comp: &'a C
) -> SetCursor<'a, K, C>
[src]
&'a mut self,
forest: &'a mut SetForest<K>,
comp: &'a C
) -> SetCursor<'a, K, C>
Create a cursor for navigating this set. The cursor is initially positioned off the end of the set.
pub fn iter<'a>(&'a self, forest: &'a SetForest<K>) -> SetIter<'a, K>ⓘ
[src]
Create an iterator traversing this set. The iterator type is K
.
Trait Implementations
Auto Trait Implementations
impl<K> RefUnwindSafe for Set<K> where
K: RefUnwindSafe,
K: RefUnwindSafe,
impl<K> Send for Set<K> where
K: Send,
K: Send,
impl<K> Sync for Set<K> where
K: Sync,
K: Sync,
impl<K> Unpin for Set<K> where
K: Unpin,
K: Unpin,
impl<K> UnwindSafe for Set<K> where
K: UnwindSafe,
K: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[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> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
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.
pub 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>,