Struct rustc_infer::traits::solve::EvaluationCache

pub struct EvaluationCache<'tcx> {
    map: Lock<HashMap<Canonical<TyCtxt<'tcx>, QueryInput<'tcx, Predicate<'tcx>>>, CacheEntry<'tcx>, BuildHasherDefault<FxHasher>>>,
}

The trait solver cache used by -Znext-solver.

FIXME(@lcnr): link to some official documentation of how this works.

Fields

map: Lock<HashMap<Canonical<TyCtxt<'tcx>, QueryInput<'tcx, Predicate<'tcx>>>, CacheEntry<'tcx>, BuildHasherDefault<FxHasher>>>

Implementations

impl<'tcx> EvaluationCache<'tcx>

pub fn insert( &self, tcx: TyCtxt<'tcx>, key: Canonical<TyCtxt<'tcx>, QueryInput<'tcx, Predicate<'tcx>>>, proof_tree: Option<&'tcx [GoalEvaluationStep<'tcx>]>, reached_depth: usize, encountered_overflow: bool, cycle_participants: HashSet<Canonical<TyCtxt<'tcx>, QueryInput<'tcx, Predicate<'tcx>>>, BuildHasherDefault<FxHasher>>, dep_node: DepNodeIndex, result: Result<Canonical<TyCtxt<'tcx>, Response<'tcx>>, NoSolution> )

Insert a final result into the global cache.

pub fn get( &self, tcx: TyCtxt<'tcx>, key: Canonical<TyCtxt<'tcx>, QueryInput<'tcx, Predicate<'tcx>>>, cycle_participant_in_stack: impl FnOnce(&HashSet<Canonical<TyCtxt<'tcx>, QueryInput<'tcx, Predicate<'tcx>>>, BuildHasherDefault<FxHasher>>) -> bool, available_depth: Limit ) -> Option<CacheData<'tcx>>

Try to fetch a cached result, checking the recursion limit and handling root goals of coinductive cycles.

If this returns Some the cache result can be used.

Trait Implementations

impl<'tcx> Default for EvaluationCache<'tcx>

fn default() -> EvaluationCache<'tcx>

Returns the “default value” for a type.

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: 40 bytes