Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Add an expr_source method analogous to the source methods in the code model | Florian Diebold | 2019-09-02 | 6 | -30/+79 |
| | | | | ... and use that instead of exposing the source map. | ||||
* | Report type mismatches in analysis-stats | Florian Diebold | 2019-09-02 | 2 | -7/+7 |
| | | | | Only the number usually; each one individually when running with -v. | ||||
* | :arrow_up: once_cell | Aleksey Kladov | 2019-09-01 | 1 | -1/+1 |
| | |||||
* | :arrow_up: insta | Aleksey Kladov | 2019-08-29 | 8 | -1222/+1320 |
| | |||||
* | Small fixes | Kirill Bulatov | 2019-08-26 | 2 | -13/+15 |
| | |||||
* | Remove redundant tests | Kirill Bulatov | 2019-08-26 | 1 | -63/+5 |
| | |||||
* | Fix 'missing Ok in tail expr' validation | Florian Diebold | 2019-08-26 | 1 | -3/+4 |
| | | | | | Because of the coercion change, the type mismatch now only happens on the block expression. | ||||
* | Make infer_block not unify; add back calculate_least_upper_bound | Florian Diebold | 2019-08-26 | 2 | -30/+66 |
| | |||||
* | An attempt to add the coercion logic for Never | Kirill Bulatov | 2019-08-26 | 2 | -51/+98 |
| | |||||
* | Properly coerce never types | Kirill Bulatov | 2019-08-26 | 3 | -57/+46 |
| | |||||
* | Remove extra inference test | Kirill Bulatov | 2019-08-26 | 3 | -26/+0 |
| | |||||
* | Fix never in if expressions | Kirill Bulatov | 2019-08-26 | 3 | -4/+53 |
| | |||||
* | Add test marks | Kirill Bulatov | 2019-08-26 | 3 | -1/+16 |
| | |||||
* | Fix match type inference for Never match arms | Kirill Bulatov | 2019-08-26 | 2 | -6/+32 |
| | |||||
* | Tests | Kirill Bulatov | 2019-08-26 | 1 | -0/+104 |
| | |||||
* | Merge #1734 | bors[bot] | 2019-08-25 | 4 | -4/+98 |
|\ | | | | | | | | | | | | | | | 1734: Strip indents and empty lines in check_apply_diagnostic_fix_from_position r=matklad a=matklad Co-authored-by: Phil Ellison <[email protected]> | ||||
| * | Simplify checking return type, add new test | Phil Ellison | 2019-08-25 | 1 | -21/+4 |
| | | |||||
| * | Fix build for Diagnostic type change | Phil Ellison | 2019-08-25 | 1 | -7/+4 |
| | | |||||
| * | Cast SyntaxNodePtr to AstPtr directly | Phil Ellison | 2019-08-25 | 1 | -14/+3 |
| | | |||||
| * | Remove reliance on expr ordering | Phil Ellison | 2019-08-25 | 1 | -10/+4 |
| | | |||||
| * | cargo format | Phil Ellison | 2019-08-25 | 1 | -13/+12 |
| | | |||||
| * | Check type rather than just name in ok-wrapping diagnostic. Add test for ↵ | Phil Ellison | 2019-08-25 | 2 | -8/+40 |
| | | | | | | | | handling generic functions (which currently fails) | ||||
| * | Mock std String and Result types in tests for ok-wrapping diagnostic | Phil Ellison | 2019-08-25 | 1 | -2/+0 |
| | | |||||
| * | Add type_mismatches to InferenceResult and use this in ok-wrapping code fix | Phil Ellison | 2019-08-25 | 3 | -8/+27 |
| | | |||||
| * | Initial implementation of Ok-wrapping | Phil Ellison | 2019-08-25 | 3 | -3/+86 |
| | | |||||
* | | Convert `BoxPat` to `Missing` in HIR | Dylan MacKenzie | 2019-08-24 | 1 | -0/+1 |
|/ | |||||
* | rename struct -> record, pos -> tuple | Aleksey Kladov | 2019-08-23 | 6 | -45/+45 |
| | |||||
* | Improve/fix type bound lowering | Florian Diebold | 2019-08-22 | 2 | -4/+35 |
| | |||||
* | Handle impl/dyn Trait in method resolution | Florian Diebold | 2019-08-22 | 3 | -32/+79 |
| | | | | | | | | | | | | | When we have one of these, the `Trait` doesn't need to be in scope to call its methods. So we need to consider this when looking for method candidates. (Actually I think the same is true when we have a bound `T: some::Trait`, but we don't handle that yet). At the same time, since Chalk doesn't handle these types yet, add a small hack to skip Chalk in method resolution and just consider `impl Trait: Trait` always true. This is enough to e.g. get completions for `impl Trait`, but since we don't do any unification we won't infer the return type of e.g. `impl Into<i64>::into()`. | ||||
* | Add `impl Trait` and `dyn Trait` types | Florian Diebold | 2019-08-22 | 6 | -41/+339 |
| | | | | | | | - refactor bounds handling in the AST a bit - add HIR for bounds - add `Ty::Dyn` and `Ty::Opaque` variants and lower `dyn Trait` / `impl Trait` syntax to them | ||||
* | Don't add `?` bounds as real bounds | Aleksey Kladov | 2019-08-22 | 2 | -0/+37 |
| | | | | closes #1709 | ||||
* | remove ast::*Kind from hir | Aleksey Kladov | 2019-08-19 | 6 | -83/+86 |
| | |||||
* | implement initial type inference for index expressions | Aleksey Kladov | 2019-08-17 | 3 | -1/+33 |
| | |||||
* | normalize ordering ops | Aleksey Kladov | 2019-08-17 | 2 | -26/+36 |
| | |||||
* | Introduce separate hir::BinaryOp | Aleksey Kladov | 2019-08-17 | 3 | -69/+96 |
| | | | | | Unlike ast::BinOp, it has significantly more structure to it, so it's easier to, say, handle all assignment-like operations in the same way. | ||||
* | Merge #1691 | bors[bot] | 2019-08-16 | 1 | -0/+9 |
|\ | | | | | | | | | | | | | | | 1691: Show inherent and trait impls of structs and enums r=viorina a=viorina Co-authored-by: Ekaterina Babshukova <[email protected]> | ||||
| * | show inherent and trait impls of structs and enums | Ekaterina Babshukova | 2019-08-16 | 1 | -0/+9 |
| | | |||||
* | | implement durability | Aleksey Kladov | 2019-08-15 | 2 | -1/+3 |
| | | |||||
* | | switch from volatile to untracked read | Aleksey Kladov | 2019-08-15 | 2 | -22/+41 |
|/ | |||||
* | Handle placeholder assoc types when Chalk produces them | Florian Diebold | 2019-08-12 | 2 | -3/+67 |
| | |||||
* | Normalize assoc types in more places | Florian Diebold | 2019-08-12 | 2 | -12/+27 |
| | |||||
* | Improve debug logging a bit | Florian Diebold | 2019-08-12 | 2 | -4/+18 |
| | |||||
* | Normalize associated types during inference | Florian Diebold | 2019-08-12 | 3 | -9/+25 |
| | |||||
* | Lower fully qualified associated type paths | Florian Diebold | 2019-08-12 | 3 | -23/+117 |
| | | | | I.e. `<T as Trait>::Foo`. | ||||
* | Add representations of associated types | Florian Diebold | 2019-08-12 | 3 | -0/+113 |
| | | | | | | | | | | | | This adds three different representations, copied from the Chalk model: - `Ty::Projection` is an associated type projection written somewhere in the code, like `<Foo as Trait>::Bar`. - `Ty::UnselectedProjection` is similar, but we don't know the trait yet (`Foo::Bar`). - The above representations are normalized to their actual types during type inference. When that isn't possible, for example for `T::Item` inside an `fn foo<T: Iterator>`, the type is normalized to an application type with `TypeCtor::AssociatedType`. | ||||
* | Add another test for assoc type resolution | Florian Diebold | 2019-08-12 | 1 | -6/+46 |
| | |||||
* | Use Source in Diagnostic and implement | Evgenii P | 2019-08-12 | 1 | -23/+15 |
| | |||||
* | implement while let desugaring | Aleksey Kladov | 2019-08-07 | 3 | -14/+47 |
| | |||||
* | refactor if-let lowering | Aleksey Kladov | 2019-08-07 | 1 | -19/+25 |
| | | | | mainly to get rid of unwraps | ||||
* | refactor if lowering | Aleksey Kladov | 2019-08-07 | 1 | -17/+14 |
| |