fn iter<'a>(&'a self) -> Box<dyn Iterator<Item = &'a Self::Item> + 'a>
fn is_empty(&self) -> bool
fn contains(&self, value: &Self::Item) -> bool
fn insert(&mut self, value: Self::Item)
fn remove(&mut self, value: &Self::Item)
fn is_subset(&self, rhs: &Self) -> bool
fn is_superset(&self, rhs: &Self) -> bool
fn is_disjoint(&self, rhs: &Self) -> bool
impl<T: Ord + Debug + 'static> MutableSet for BTreeSet<T>
[src]type Item = T
fn iter<'a>(&'a self) -> Box<dyn Iterator<Item = &'a Self::Item> + 'a>
[src]fn is_empty(&self) -> bool
[src]fn contains(&self, value: &Self::Item) -> bool
[src]fn insert(&mut self, value: Self::Item)
[src]fn remove(&mut self, value: &Self::Item)
[src]fn is_subset(&self, rhs: &Self) -> bool
[src]fn is_superset(&self, rhs: &Self) -> bool
[src]fn is_disjoint(&self, rhs: &Self) -> bool
[src]impl<T: Hash + Eq + Debug + 'static, S: BuildHasher + Default> MutableSet for HashSet<T, S>
[src]type Item = T
fn iter<'a>(&'a self) -> Box<dyn Iterator<Item = &'a Self::Item> + 'a>
[src]fn is_empty(&self) -> bool
[src]fn contains(&self, value: &Self::Item) -> bool
[src]fn insert(&mut self, value: Self::Item)
[src]fn remove(&mut self, value: &Self::Item)
[src]fn is_subset(&self, rhs: &Self) -> bool
[src]fn is_superset(&self, rhs: &Self) -> bool
[src]fn is_disjoint(&self, rhs: &Self) -> bool
[src]