Type Alias BorrowsDomain

type BorrowsDomain = DenseBitSet<BorrowIndex>;

Aliased Type

struct BorrowsDomain { /* private fields */ }

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 32 bytes

Implementations

impl<T> DenseBitSet<T>

pub fn domain_size(&self) -> usize

Gets the domain size.

impl<T> DenseBitSet<T>

where T: Idx,

pub fn new_empty(domain_size: usize) -> DenseBitSet<T>

Creates a new, empty bitset with a given domain_size.

pub fn new_filled(domain_size: usize) -> DenseBitSet<T>

Creates a new, filled bitset with a given domain_size.

pub fn clear(&mut self)

Clear all elements.

pub fn count(&self) -> usize

Count the number of set bits in the set.

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

Returns true if self contains elem.

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

Is self is a (non-strict) superset of other?

pub fn is_empty(&self) -> bool

Is the set empty?

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

Insert elem. Returns whether the set has changed.

pub fn insert_range(&mut self, elems: impl RangeBounds<T>)

pub fn insert_all(&mut self)

Sets all bits to true.

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

Returns true if the set has changed.

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

Iterates over the indices of set bits in a sorted order.

pub fn last_set_in(&self, range: impl RangeBounds<T>) -> Option<T>

pub fn union<Rhs>(&mut self, other: &Rhs) -> bool

where DenseBitSet<T>: BitRelations<Rhs>,

Sets self = self | other and returns true if self changed (i.e., if new bits were added).

pub fn subtract<Rhs>(&mut self, other: &Rhs) -> bool

where DenseBitSet<T>: BitRelations<Rhs>,

Sets self = self - other and returns true if self changed. (i.e., if any bits were removed).

pub fn intersect<Rhs>(&mut self, other: &Rhs) -> bool

where DenseBitSet<T>: BitRelations<Rhs>,

Sets self = self & other and return true if self changed. (i.e., if any bits were removed).

pub fn union_not(&mut self, other: &DenseBitSet<T>)

Sets self = self | !other.

FIXME: Incorporate this into BitRelations and fill out implementations for other bitset types, if needed.

Trait Implementations

impl<T> BitRelations<ChunkedBitSet<T>> for DenseBitSet<T>

where T: Idx,

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

fn subtract(&mut self, _other: &ChunkedBitSet<T>) -> bool

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

impl<T> BitRelations<DenseBitSet<T>> for DenseBitSet<T>

where T: Idx,

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

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

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

impl<T> Clone for DenseBitSet<T>

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

Returns a copy of the value.

fn clone_from(&mut self, from: &DenseBitSet<T>)

Performs copy-assignment from source.

impl<T> Debug for DenseBitSet<T>

where T: Idx,

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

Formats the value using the given formatter.

impl<T, C> DebugWithContext<C> for DenseBitSet<T>

where T: Idx + DebugWithContext<C>,

fn fmt_with(&self, ctxt: &C, f: &mut Formatter<'_>) -> Result<(), Error>

fn fmt_diff_with( &self, old: &DenseBitSet<T>, ctxt: &C, f: &mut Formatter<'_>, ) -> Result<(), Error>

Print the difference between self and old.

impl<T, __D> Decodable<__D> for DenseBitSet<T>

where __D: Decoder, PhantomData<T>: Decodable<__D>,

fn decode(__decoder: &mut __D) -> DenseBitSet<T>

impl<T, __E> Encodable<__E> for DenseBitSet<T>

where __E: Encoder, PhantomData<T>: Encodable<__E>,

fn encode(&self, __encoder: &mut __E)

impl<T> From<GrowableBitSet<T>> for DenseBitSet<T>

where T: Idx,

fn from(bit_set: GrowableBitSet<T>) -> DenseBitSet<T>

Converts to this type from the input type.

impl<T> GenKill<T> for DenseBitSet<T>

where T: Idx,

fn gen_(&mut self, elem: T)

Inserts elem into the state vector.

fn kill(&mut self, elem: T)

Removes elem from the state vector.

fn gen_all(&mut self, elems: impl IntoIterator<Item = T>)

Calls gen for each element in elems.

fn kill_all(&mut self, elems: impl IntoIterator<Item = T>)

Calls kill for each element in elems.

impl<T> Hash for DenseBitSet<T>

where T: Hash,

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<I, CTX> HashStable<CTX> for DenseBitSet<I>

where I: Idx,

fn hash_stable(&self, _ctx: &mut CTX, hasher: &mut StableHasher<SipHasher128>)

impl<T> JoinSemiLattice for DenseBitSet<T>

where T: Idx,

A DenseBitSet represents the lattice formed by the powerset of all possible values of the index type T ordered by inclusion. Equivalently, it is a tuple of “two-point” lattices, one for each possible value of T.

fn join(&mut self, other: &DenseBitSet<T>) -> bool

Computes the least upper bound of two elements, storing the result in self and returning true if self has changed.

impl<T> PartialEq for DenseBitSet<T>

where T: PartialEq,

fn eq(&self, other: &DenseBitSet<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<T> ToString for DenseBitSet<T>

where T: Idx,

fn to_string(&self) -> String

Converts the given value to a String.

impl<T> Eq for DenseBitSet<T>

where T: Eq,

impl<T> StructuralPartialEq for DenseBitSet<T>