Struct regalloc::Set [−][src]
Implementations
impl<T: Eq + Ord + Hash + Copy + Debug> Set<T>[src]
impl<T: Eq + Ord + Hash + Copy + Debug> Set<T>[src]pub fn empty() -> Self[src]
pub fn unit(item: T) -> Self[src]
pub fn two(item1: T, item2: T) -> Self[src]
pub fn card(&self) -> usize[src]
pub fn insert(&mut self, item: T)[src]
pub fn delete(&mut self, item: T)[src]
pub fn is_empty(&self) -> bool[src]
pub fn contains(&self, item: T) -> bool[src]
pub fn intersect(&mut self, other: &Self)[src]
pub fn union(&mut self, other: &Self)[src]
pub fn remove(&mut self, other: &Self)[src]
pub fn intersects(&self, other: &Self) -> bool[src]
pub fn is_subset_of(&self, other: &Self) -> bool[src]
pub fn to_vec(&self) -> Vec<T>[src]
pub fn from_vec(vec: Vec<T>) -> Self[src]
pub fn equals(&self, other: &Self) -> bool[src]
pub fn retain<F>(&mut self, f: F) where
F: FnMut(&T) -> bool, [src]
F: FnMut(&T) -> bool,
pub fn map<F, U>(&self, f: F) -> Set<U> where
F: Fn(&T) -> U,
U: Eq + Ord + Hash + Copy + Debug, [src]
F: Fn(&T) -> U,
U: Eq + Ord + Hash + Copy + Debug,
pub fn filter_map<F, U>(&self, f: F) -> Set<U> where
F: Fn(&T) -> Option<U>,
U: Eq + Ord + Hash + Copy + Debug, [src]
F: Fn(&T) -> Option<U>,
U: Eq + Ord + Hash + Copy + Debug,
pub fn clear(&mut self)[src]
Trait Implementations
Auto Trait Implementations
impl<T> RefUnwindSafe for Set<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Send for Set<T> where
T: Send,
T: Send,
impl<T> Sync for Set<T> where
T: Sync,
T: Sync,
impl<T> Unpin for Set<T> where
T: Unpin,
T: Unpin,
impl<T> UnwindSafe for Set<T> where
T: UnwindSafe,
T: UnwindSafe,