Struct lib_rapid::math::sets::wrapper_hash_sets::WrapperHashSet

pub struct WrapperHashSet<'a, T, S = RandomState> {
    pub hs: HashSet<T, S>,
    /* private fields */
}

A wrapper for the HashSet type which implements more functions. Everything you need to do with a HashSet needs to be done using WrapperHashSet.hs.[function] for now.

Fields

hs: HashSet<T, S>

The basic Hashset.

Implementations

impl<'a, T: Clone + Eq + Hash> WrapperHashSet<'a, T>

pub fn wrap(existing: HashSet<T>) -> WrapperHashSet<'a, T>

Wrap a existing HashSet in this Wrapper-struct.

Arguments

• existing - The existing HashSet.

Returns

A new WrapperHashSet.

Examples

use lib_rapid::math::sets::wrapper_hash_sets::WrapperHashSet;
use std::collections::HashSet;
 
let mut books = HashSet::new();
books.insert("A Dance With Dragons".to_string());
books.insert("1984".to_string());
 
let mut wrapped = WrapperHashSet::wrap(books);

pub fn new_subset<F: Fn(&T) -> bool>(&'a self, f: F) -> Self

Creates a new WrapperHashSet from self to which it applies a closure.

Arguments

• f - The closure after which the new VecSet is created.

Returns

A child WrapperHashSet.

Examples

use lib_rapid::math::sets::wrapper_hash_sets::WrapperHashSet;
use std::collections::HashSet;
 
let mut nums = HashSet::new();
for i in 0..=6 {
    nums.insert(i);
}
 
let wrapped = WrapperHashSet::wrap(nums);
let subset = wrapped.new_subset(|x| x % 2 == 0);
 
assert_eq!(HashSet::from([0, 2, 4, 6]), subset.hs);

pub fn has_emerged(&self) -> bool

Lets you check wether a set has a parent (emerged from another set) or not.

Returns

A boolean value which determines if the set is a subset of any other set.

Examples

use lib_rapid::math::sets::wrapper_hash_sets::WrapperHashSet;
use std::collections::HashSet;
 
let mut nums = HashSet::new();
for i in 0..=6 {
    nums.insert(i);
}
 
let wrapped = WrapperHashSet::wrap(nums);
let subset = wrapped.new_subset(|x| x % 2 == 0);
 
assert_eq!(true, subset.has_emerged());

pub fn get_superset(&self) -> Option<&Self>

Gets you the optional superset.

Returns

A Option<&VecSet<T>>.

Examples

use lib_rapid::math::sets::wrapper_hash_sets::WrapperHashSet;
use std::collections::HashSet;
 
let mut nums = HashSet::new();
for i in 0..=6 {
    nums.insert(i);
}
 
let wrapped = WrapperHashSet::wrap(nums);
let subset = wrapped.new_subset(|x| x % 2 == 0);
 
assert_eq!(&wrapped, subset.get_superset().unwrap());

Trait Implementations

impl<'a, T: Debug, S: Debug> Debug for WrapperHashSet<'a, T, S>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'a, T: Debug> Display for WrapperHashSet<'a, T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'a, T: Eq + Hash, S: BuildHasher> PartialEq for WrapperHashSet<'a, T, S>

fn eq(&self, other: &WrapperHashSet<'_, T, S>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.