Expand description
Building proof trees incrementally during trait solving.
This code is a bit of a mess and can hopefully be mostly ignored. For a general overview of how it works, see the comment on ProofTreeBuilder.
Re-exportsยง
use std::marker::PhantomData;๐use derive_where::derive_where;๐use rustc_type_ir as ty;๐use rustc_type_ir::Interner;๐use crate::canonical;๐use crate::delegate::SolverDelegate;๐use crate::solve::Certainty;๐use crate::solve::Goal;๐use crate::solve::GoalSource;๐use crate::solve::QueryResult;๐use crate::solve::inspect;๐use rustc_type_ir::inherent::*;๐
Structsยง
- Evaluation
Step ๐Builder - Proof
Tree ๐Builder - We need to know whether to build a prove tree while evaluating. We
pass a
ProofTreeBuilderwithstate: Some(None)into the search graph which then causes the initialEvalCtxt::compute_goalto actually build a proof tree which then gets written into thestate. - WipEvaluation
Step ๐ - WipProbe ๐
Enumsยง
- WipProbe
Step ๐