Struct rupta::pts_set::points_to::HybridPointsToSet

pub struct HybridPointsToSet<T> { /* private fields */ }

Hybrid implementation of points to set, which uses an explicit array for small sets, and a bit vector for large sets.

Trait Implementations

impl<T: Clone> Clone for HybridPointsToSet<T>

fn clone(&self) -> HybridPointsToSet<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Idx> Debug for HybridPointsToSet<T>

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

Formats the value using the given formatter.

impl<'a, T: Idx> IntoIterator for &'a HybridPointsToSet<T>

IntoIterator

type Item = T

The type of the elements being iterated over.

type IntoIter = HybridIter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Idx> PointsToSet<T> for HybridPointsToSet<T>

fn clear(&mut self)

Clear all elements.

fn count(&self) -> usize

Count the number of elements in the set.

fn contains(&self, elem: T) -> bool

Returns true if self contains elem.

fn superset(&self, other: &HybridPointsToSet<T>) -> bool

Is self is a superset of other?

fn insert(&mut self, elem: T) -> bool

Adds elem to this set, returns true if n was not already in this set.

fn new() -> Self

fn is_empty(&self) -> bool

fn remove(&mut self, elem: T) -> bool

fn union(&mut self, other: &HybridPointsToSet<T>) -> bool

fn subtract(&mut self, other: &HybridPointsToSet<T>) -> bool

fn intersect(&mut self, other: &HybridPointsToSet<T>) -> bool

type Iter<'a> = HybridIter<'a, T>

fn iter(&self) -> HybridIter<'_, T>