| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2023-10-10 | reorder files in solve | lcnr | -85/+0 | |
| 2023-07-23 | Comment stuff in the new solver | Michael Goulet | -0/+3 | |
| 2023-07-14 | refactor(rustc_middle): Substs -> GenericArg | Mahdi Dibaiee | -6/+6 | |
| 2023-06-19 | Don't consider TAIT normalizable to hidden ty if it would result in ↵ | Michael Goulet | -5/+19 | |
| impossible item bounds | ||||
| 2023-06-09 | split opaque type handling in new solver | lcnr | -1/+2 | |
| be more explicit in where we only add new hidden types and where we also have to deal with item bounds. | ||||
| 2023-05-25 | Match on both reveal and solver mode at the same time | Michael Goulet | -41/+38 | |
| 2023-05-25 | Add InferCtxt::register_hidden_type_in_new_solver | Michael Goulet | -3/+7 | |
| 2023-05-25 | Pre-populate MIR with opaques, prefer subst-relate candidate | Michael Goulet | -6/+3 | |
| 2023-05-25 | Check that opaque is a defining use, prefer pre-defined opaques | Michael Goulet | -12/+45 | |
| 2023-05-25 | Prepopulate opaques in canonical input | Michael Goulet | -13/+5 | |
| 2023-05-25 | Pull out logic from #111131, plus some new logic in ↵ | Michael Goulet | -0/+44 | |
| EvalCtxt::normalize_opaque_type Co-authored-by: lcnr <rust@lcnr.de> | ||||
