Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Merge #1815 | bors[bot] | 2019-09-27 | 1 | -5/+4 |
|\ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 1815: Support correct `$crate` expansion in macros r=uHOOCCOOHu a=uHOOCCOOHu This PR makes normal use cases of `$crate` from macros work as expected. It makes more macros from `std` work. Type inference works well with `panic`, `unimplemented`, `format`, and maybe more. Sadly that `vec![1, 2, 3]` still not works, but it is not longer an issue about macro. Screenshot: ![Screenshot_20190927_022136](https://user-images.githubusercontent.com/14816024/65714465-b4568f80-e0cd-11e9-8043-dd44c2ae8040.png) Co-authored-by: uHOOCCOOHu <[email protected]> | ||||
| * | Refactor `Name` ready for hygienic macro | uHOOCCOOHu | 2019-09-26 | 1 | -5/+4 |
| | | |||||
* | | Add SubstsBuilder | Florian Diebold | 2019-09-26 | 1 | -8/+7 |
|/ | | | | + further refactoring. | ||||
* | Support all coercion places | uHOOCCOOHu | 2019-09-25 | 1 | -25/+57 |
| | |||||
* | Support custom `CoerceUnsized` | uHOOCCOOHu | 2019-09-25 | 1 | -26/+181 |
| | | | | Split out tests about coercion | ||||
* | Better handle never type and branch merging | uHOOCCOOHu | 2019-09-25 | 1 | -60/+92 |
| | | | | Split out tests for never type to another file | ||||
* | Support basic implicit type coerce | uHOOCCOOHu | 2019-09-25 | 1 | -86/+168 |
| | |||||
* | Support auto-deref in argument position | uHOOCCOOHu | 2019-09-25 | 1 | -1/+43 |
| | |||||
* | Remove redundant clone() | Shotaro Yamada | 2019-09-25 | 1 | -2/+2 |
| | |||||
* | Implement the call argument checking order hack for closures | Florian Diebold | 2019-09-24 | 1 | -10/+26 |
| | |||||
* | Make the closure_1 test work | Florian Diebold | 2019-09-24 | 1 | -0/+5 |
| | |||||
* | Give closures types | Florian Diebold | 2019-09-24 | 1 | -4/+18 |
| | |||||
* | Split off path expression inference code into submodule | Florian Diebold | 2019-09-23 | 1 | -172/+4 |
| | |||||
* | Remove TraitItem and ImplItem in favor of AssocItem | Florian Diebold | 2019-09-17 | 1 | -14/+12 |
| | |||||
* | Refactor some more | Florian Diebold | 2019-09-17 | 1 | -39/+61 |
| | | | | | | Type-relative paths (`<T>::foo`) also need to work in type context, for example `<T>::Item` is legal. So rather than returning the type ref from the resolver function, just check it before. | ||||
* | Refactor associated item resolution more | Florian Diebold | 2019-09-17 | 1 | -71/+54 |
| | | | | | When resolving an associated item in value namespace, use the `Ty` lowering code for the segments before the last instead of replicating it. | ||||
* | Refactor a bit to prepare for resolving trait assoc items | Florian Diebold | 2019-09-17 | 1 | -30/+27 |
| | |||||
* | Merge #1817 | bors[bot] | 2019-09-16 | 1 | -75/+52 |
|\ | | | | | | | | | | | | | | | 1817: Support path starting with a type r=matklad a=uHOOCCOOHu The path syntax `<Ty>::foo` Co-authored-by: uHOOCCOOHu <[email protected]> | ||||
| * | Define known paths and group names | uHOOCCOOHu | 2019-09-15 | 1 | -25/+12 |
| | | |||||
| * | Support path starting with a type | uHOOCCOOHu | 2019-09-15 | 1 | -65/+55 |
| | | |||||
* | | Gracefully handle `const _` items in `ConstData` | Dylan MacKenzie | 2019-09-16 | 1 | -1/+1 |
|/ | |||||
* | Upgrade Chalk | Florian Diebold | 2019-09-14 | 1 | -4/+0 |
| | | | | ... and remove Ty::UnselectedProjection. It'll be handled differently. | ||||
* | Specify desirable namespace when calling resolve | Aleksey Kladov | 2019-09-13 | 1 | -133/+123 |
| | | | | That way, we are able to get rid of a number of unreachable statements | ||||
* | rename AdtDef -> Adt | Aleksey Kladov | 2019-09-12 | 1 | -7/+7 |
| | |||||
* | make various enums "inherit" from AdtDef | Aleksey Kladov | 2019-09-12 | 1 | -3/+3 |
| | |||||
* | start cleaning up the resolution | Aleksey Kladov | 2019-09-12 | 1 | -35/+11 |
| | | | | | | | Nameres related types, like `PerNs<Resolution>`, can represent unreasonable situations, like a local in a type namespace. We should clean this up, by requiring that call-site specifies the kind of resolution it expects. | ||||
* | Infer box expression | uHOOCCOOHu | 2019-09-11 | 1 | -0/+26 |
| | |||||
* | cleanup hir db imports | Aleksey Kladov | 2019-09-08 | 1 | -3/+5 |
| | |||||
* | Lower bounds on trait definition, and resolve assoc types from super traits | Florian Diebold | 2019-09-07 | 1 | -3/+3 |
| | |||||
* | Make type walking infrastructure a bit nicer | Florian Diebold | 2019-09-03 | 1 | -1/+1 |
| | | | | | If/when we switch to using Chalk's Ty, we'll need to replace this by its `Fold` trait, but I didn't want to import the whole thing just yet. | ||||
* | clearer ignore | Aleksey Kladov | 2019-09-03 | 1 | -1/+1 |
| | |||||
* | remove needless refs | Aleksey Kladov | 2019-09-03 | 1 | -2/+2 |
| | |||||
* | use recrod terminology for hir::Pat | Aleksey Kladov | 2019-09-03 | 1 | -2/+2 |
| | |||||
* | Add an expr_source method analogous to the source methods in the code model | Florian Diebold | 2019-09-02 | 1 | -2/+2 |
| | | | | ... and use that instead of exposing the source map. | ||||
* | Small fixes | Kirill Bulatov | 2019-08-26 | 1 | -12/+9 |
| | |||||
* | Make infer_block not unify; add back calculate_least_upper_bound | Florian Diebold | 2019-08-26 | 1 | -20/+54 |
| | |||||
* | An attempt to add the coercion logic for Never | Kirill Bulatov | 2019-08-26 | 1 | -51/+40 |
| | |||||
* | Properly coerce never types | Kirill Bulatov | 2019-08-26 | 1 | -44/+46 |
| | |||||
* | Remove extra inference test | Kirill Bulatov | 2019-08-26 | 1 | -1/+0 |
| | |||||
* | Fix never in if expressions | Kirill Bulatov | 2019-08-26 | 1 | -3/+10 |
| | |||||
* | Add test marks | Kirill Bulatov | 2019-08-26 | 1 | -0/+5 |
| | |||||
* | Fix match type inference for Never match arms | Kirill Bulatov | 2019-08-26 | 1 | -5/+31 |
| | |||||
* | Add type_mismatches to InferenceResult and use this in ok-wrapping code fix | Phil Ellison | 2019-08-25 | 1 | -1/+18 |
| | |||||
* | rename struct -> record, pos -> tuple | Aleksey Kladov | 2019-08-23 | 1 | -6/+6 |
| | |||||
* | implement initial type inference for index expressions | Aleksey Kladov | 2019-08-17 | 1 | -0/+6 |
| | |||||
* | Introduce separate hir::BinaryOp | Aleksey Kladov | 2019-08-17 | 1 | -3/+1 |
| | | | | | 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. | ||||
* | Normalize assoc types in more places | Florian Diebold | 2019-08-12 | 1 | -6/+21 |
| | |||||
* | Normalize associated types during inference | Florian Diebold | 2019-08-12 | 1 | -1/+21 |
| | |||||
* | provide completion in struct patterns | Ekaterina Babshukova | 2019-07-21 | 1 | -7/+15 |
| | |||||
* | infer type for await | Unreal Hoang | 2019-07-20 | 1 | -2/+40 |
| | | | | by projecting inner_ty to Future::Output alias |