| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2024-05-18 | Uplift inspect into rustc_type_ir | Michael Goulet | -160/+0 | |
| 2024-05-13 | Use a proper probe for shadowing impl | Michael Goulet | -0/+2 | |
| 2024-05-06 | Record impl args in the InsepctCandiate rather than rematching during select | Michael Goulet | -0/+2 | |
| 2024-04-30 | Rollup merge of #124511 - nnethercote:rm-extern-crates, r=fee1-dead | Matthias Krüger | -0/+1 | |
| Remove many `#[macro_use] extern crate foo` items This requires the addition of more `use` items, which often make the code more verbose. But they also make the code easier to read, because `#[macro_use]` obscures where macros are defined. r? `@fee1-dead` | ||||
| 2024-04-29 | Take proof trees by value in inspect goal | Michael Goulet | -3/+3 | |
| 2024-04-29 | Only register candidate if it is associated w a shallow certainty | Michael Goulet | -2/+2 | |
| 2024-04-29 | Actually use probes when needed and stop relying on existing outer probes | Michael Goulet | -4/+2 | |
| 2024-04-29 | Remove `extern crate rustc_macros` from `rustc_middle`. | Nicholas Nethercote | -0/+1 | |
| 2024-04-27 | Record certainty of evaluate_added_goals_and_make_canonical_response call in ↵ | Michael Goulet | -0/+6 | |
| candidate | ||||
| 2024-04-25 | hir typeck: look into nested goals | lcnr | -0/+1 | |
| uses a `ProofTreeVisitor` to look into nested goals when looking at the pending obligations during hir typeck. Used by closure signature inference, coercion, and for async functions. | ||||
| 2024-04-05 | Fix typo | Waffle Maybe | -1/+1 | |
| 2024-04-04 | normalizes-to change from '1' to '0 to inf' steps | lcnr | -5/+2 | |
| 2024-03-18 | cleanup + review | lcnr | -3/+3 | |
| 2024-02-26 | always emit `AliasRelate` goals when relating aliases | lcnr | -2/+0 | |
| Add `StructurallyRelateAliases` to allow instantiating infer vars with rigid aliases. Change `instantiate_query_response` to be infallible in the new solver. This requires canonicalization to not hide any information used by the query, so weaken universe compression. It also modifies `term_is_fully_unconstrained` to allow region inference variables in a higher universe. | ||||
| 2024-01-09 | readd the provisional cache | lcnr | -0/+1 | |
| 2023-12-18 | track the source of nested goals | lcnr | -3/+3 | |
| 2023-11-09 | `try_normalize_ty` end with rigid alias on failure | lcnr | -0/+5 | |
| 2023-11-02 | use global cache when computing proof trees | lcnr | -8/+2 | |
| 2023-09-21 | proof trees: use for `intercrate_ambiguity_causes` | lcnr | -8/+58 | |
| 2023-09-14 | differentiate root and nested goals | lcnr | -3/+9 | |
| 2023-09-14 | inspect: explicitly store added goals | lcnr | -0/+1 | |
| 2023-09-14 | order `added_goals_evaluation` and `nested_probes` | lcnr | -2/+7 | |
| 2023-09-14 | `GoalCandidate` to `Probe` | lcnr | -5/+8 | |
| 2023-09-11 | dedup `GoalEvaluationStep` and `GoalCandidate` | lcnr | -4/+11 | |
| also handle 2 panics when dumping proof trees for the whole test suite - need to actually tell the proof tree builder about overflow - need to handle a recursion_limit of 0 :< | ||||
| 2023-09-11 | inspect: strongly typed CandidateKind | lcnr | -14/+19 | |
| 2023-09-11 | split GoalEvaluation and CanonicalGoalEvaluation | lcnr | -20/+8 | |
| the unnormalized goal is in the callers inference context, while anything inside of the `CanonicalGoalEvaluation` is inside of a new one. | ||||
| 2023-08-03 | Rework upcasting | Michael Goulet | -5/+8 | |
| 2023-07-25 | Normalize the RHS of an unsize goal | Michael Goulet | -1/+5 | |
| 2023-07-13 | refactor proof tree formatting | lcnr | -4/+4 | |
| 2023-06-20 | cleanup imports | lcnr | -2/+6 | |
| 2023-06-19 | move to nested module | Boxy | -130/+3 | |
| 2023-06-19 | show normalizes-to hack and response instantiation goals | Boxy | -2/+22 | |
| 2023-06-19 | introduce a separate set of types for finalized proof trees | Boxy | -28/+39 | |
| 2023-06-19 | say what kind of cache hit | Boxy | -3/+10 | |
| 2023-06-19 | initial info dump | Boxy | -0/+168 | |
