| Age | Commit message (Collapse) | Author | Lines | |
|---|---|---|---|---|
| 2024-06-18 | Uplift the new trait solver | Michael Goulet | -604/+0 | |
| 2024-06-18 | SolverDelegate | Michael Goulet | -4/+4 | |
| 2024-06-18 | Make SearchGraph fully generic | Michael Goulet | -52/+40 | |
| 2024-05-30 | add logging to search graph | lcnr | -1/+2 | |
| 2024-05-28 | Make ProofTreeBuilder actually generic over interner | Michael Goulet | -5/+6 | |
| 2024-05-24 | remove proof tree formatter, make em shallow | lcnr | -8/+12 | |
| 2024-05-20 | track cycle participants per entry | lcnr | -50/+128 | |
| 2024-05-20 | move global cache lookup into fn | lcnr | -42/+44 | |
| 2024-05-20 | move fixpoint step into subfunction | lcnr | -53/+76 | |
| 2024-05-19 | Make search graph generic over interner | Michael Goulet | -50/+60 | |
| 2024-05-18 | Make proof tree building generic | Michael Goulet | -2/+2 | |
| 2024-05-12 | structurally important functions to `debug` | lcnr | -2/+4 | |
| 2024-05-12 | solve: replace all `debug` with `trace` | lcnr | -3/+3 | |
| 2024-03-18 | `NormalizesTo` return nested goals | lcnr | -10/+0 | |
| 2024-02-29 | distinguish recursion limit based overflow for diagnostics | lcnr | -12/+9 | |
| also change the number of allowed fixpoint steps to be fixed instead of using the `log` of the total recursion depth. | ||||
| 2024-01-09 | this is not a rust code snippet | lcnr | -4/+5 | |
| 2024-01-09 | add comments and tests | lcnr | -36/+58 | |
| 2024-01-09 | avoid always rerunning in case of a cycle | lcnr | -34/+71 | |
| 2024-01-09 | readd the provisional cache | lcnr | -61/+154 | |
| 2024-01-08 | `all` to `any` | lcnr | -5/+5 | |
| don't really know why, but it is a lot easier for me to think about cycles that way. | ||||
| 2024-01-08 | do not track root depth of cycles | lcnr | -37/+32 | |
| results in slightly cleaner logic while making the following commit easier | ||||
| 2024-01-08 | use doc comments | lcnr | -3/+3 | |
| 2023-12-18 | dont discard overflow from normalizes-to goals | lcnr | -0/+10 | |
| 2023-12-14 | consistently use "next solver" instead of "new solver" | lcnr | -3/+3 | |
| 2023-11-22 | Replace `no_ord_impl` with `orderable`. | Nicholas Nethercote | -0/+1 | |
| Similar to the previous commit, this replaces `newtype_index`'s opt-out `no_ord_impl` attribute with the opt-in `orderable` attribute. | ||||
| 2023-11-09 | remove stability assert in `evaluate_goal` | lcnr | -33/+0 | |
| 2023-11-02 | use global cache when computing proof trees | lcnr | -12/+26 | |
| 2023-10-10 | reorder files in solve | lcnr | -0/+368 | |
