Struct cranelift_bforest::Set [−][src]
pub struct Set<K> where
K: Copy, { /* fields omitted */ }
Expand description
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]
impl<K> Set<K> where
K: Copy,
[src]pub fn contains<C: Comparator<K>>(
&self,
key: K,
forest: &SetForest<K>,
comp: &C
) -> bool
[src]
pub fn contains<C: Comparator<K>>(
&self,
key: K,
forest: &SetForest<K>,
comp: &C
) -> bool
[src]Does the set contain key
?.
pub fn insert<C: Comparator<K>>(
&mut self,
key: K,
forest: &mut SetForest<K>,
comp: &C
) -> bool
[src]
pub fn insert<C: Comparator<K>>(
&mut self,
key: K,
forest: &mut SetForest<K>,
comp: &C
) -> bool
[src]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]
pub fn remove<C: Comparator<K>>(
&mut self,
key: K,
forest: &mut SetForest<K>,
comp: &C
) -> bool
[src]Remove key
from the set and return true.
If key
was not present in the set, return false.
pub fn retain<F>(&mut self, forest: &mut SetForest<K>, predicate: F) where
F: FnMut(K) -> bool,
[src]
pub fn retain<F>(&mut self, forest: &mut SetForest<K>, predicate: F) where
F: FnMut(K) -> bool,
[src]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]
pub fn cursor<'a, C: Comparator<K>>(
&'a mut self,
forest: &'a mut SetForest<K>,
comp: &'a C
) -> SetCursor<'a, K, C>
[src]Create a cursor for navigating this set. The cursor is initially positioned off the end of the set.
Trait Implementations
Auto Trait Implementations
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,
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn to_owned(&self) -> T
[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
[src]
pub fn clone_into(&self, target: &mut T)
[src]🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more