pub type EntrySets<'tcx, A> = IndexVec<BasicBlock, <A as AnalysisDomain<'tcx>>::Domain>;

Aliased Type§

struct EntrySets<'tcx, A> {
    pub raw: Vec<<A as AnalysisDomain<'tcx>>::Domain, Global>,
    _marker: PhantomData<fn(_: &BasicBlock)>,
}

Fields§

§raw: Vec<<A as AnalysisDomain<'tcx>>::Domain, Global>§_marker: PhantomData<fn(_: &BasicBlock)>

Trait Implementations§

source§

impl<I: Idx, T: JoinSemiLattice> JoinSemiLattice for IndexVec<I, T>

A tuple (or list) of lattices is itself a lattice whose least upper bound is the concatenation of the least upper bounds of each element of the tuple (or list).

In other words: (A₀, A₁, …, Aₙ) ∨ (B₀, B₁, …, Bₙ) = (A₀∨B₀, A₁∨B₁, …, Aₙ∨Bₙ)

source§

fn join(&mut self, other: &Self) -> bool

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

impl<I: Idx, T: MeetSemiLattice> MeetSemiLattice for IndexVec<I, T>

source§

fn meet(&mut self, other: &Self) -> bool

Computes the greatest lower bound of two elements, storing the result in self and returning true if self has changed. Read more

Layout§

Note: Encountered an error during type layout; the type failed to be normalized.