Struct StalledOnCoroutines 

pub struct StalledOnCoroutines<'a, 'db> {
    pub stalled_coroutines: &'a [SolverDefId],
    pub cache: HashSet<Ty<'db>, FxBuildHasher>,
}

Detect if a goal is stalled on a coroutine that is owned by the current typeck root.

This function can (erroneously) fail to detect a predicate, i.e. it doesn’t need to be complete. However, this will lead to ambiguity errors, so we want to make it accurate.

This function can be also return false positives, which will lead to poor diagnostics so we want to keep this visitor precise too.

Fields

stalled_coroutines: &'a [SolverDefId]

cache: HashSet<Ty<'db>, FxBuildHasher>

Trait Implementations

impl<'db> TypeVisitor<DbInterner<'db>> for StalledOnCoroutines<'_, 'db>

type Result = ControlFlow<()>

fn visit_ty( &mut self, ty: Ty<'db>, ) -> <StalledOnCoroutines<'_, 'db> as TypeVisitor<DbInterner<'db>>>::Result

fn visit_binder<T>(&mut self, t: &Binder<I, T>) -> Self::Result

where T: TypeVisitable<I>,

fn visit_region(&mut self, r: <I as Interner>::Region) -> Self::Result

fn visit_const(&mut self, c: <I as Interner>::Const) -> Self::Result

fn visit_predicate(&mut self, p: <I as Interner>::Predicate) -> Self::Result

fn visit_clauses(&mut self, c: <I as Interner>::Clauses) -> Self::Result

fn visit_error( &mut self, _guar: <I as Interner>::ErrorGuaranteed, ) -> Self::Result