Struct rustc_transmute::maybe_transmutable::MaybeTransmutableQuery

pub(crate) struct MaybeTransmutableQuery<L, C>where
    C: QueryContext,{
    src: L,
    dst: L,
    scope: <C as QueryContext>::Scope,
    assume: Assume,
    context: C,
}

Fields

src: L

dst: L

scope: <C as QueryContext>::Scope

assume: Assume

context: C

Implementations

impl<'tcx> MaybeTransmutableQuery<Ty<'tcx>, TyCtxt<'tcx>>

pub fn answer(self) -> Answer<Ref<'tcx>>

This method begins by converting src and dst from Tys to Trees, then computes an answer using those trees.

impl<L, C> MaybeTransmutableQuery<L, C>where C: QueryContext,

pub(crate) fn new( src: L, dst: L, scope: <C as QueryContext>::Scope, assume: Assume, context: C ) -> Self

impl<C> MaybeTransmutableQuery<Tree<<C as QueryContext>::Def, <C as QueryContext>::Ref>, C>where C: QueryContext,

pub(crate) fn answer(self) -> Answer<<C as QueryContext>::Ref>

Answers whether a Tree is transmutable into another Tree.

This method begins by de-def’ing src and dst, and prunes private paths from dst, then converts src and dst to Nfas, and computes an answer using those NFAs.

impl<C> MaybeTransmutableQuery<Nfa<<C as QueryContext>::Ref>, C>where C: QueryContext,

pub(crate) fn answer(self) -> Answer<<C as QueryContext>::Ref>

Answers whether a Nfa is transmutable into another Nfa.

This method converts src and dst to DFAs, then computes an answer using those DFAs.

impl<C> MaybeTransmutableQuery<Dfa<<C as QueryContext>::Ref>, C>where C: QueryContext,

pub(crate) fn answer(self) -> Answer<<C as QueryContext>::Ref>

Answers whether a Dfa is transmutable into another Dfa.

fn answer_memo( &self, cache: &mut Map<(State, State), Answer<<C as QueryContext>::Ref>>, src_state: State, dst_state: State ) -> Answer<<C as QueryContext>::Ref>

Layout

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.