Commit message (Collapse) | Author | Age | Files | Lines | ||
---|---|---|---|---|---|---|
... | ||||||
* | replace todo with fixme | Aleksey Kladov | 2019-03-23 | 1 | -1/+1 | |
| | ||||||
* | docs | Aleksey Kladov | 2019-03-17 | 1 | -9/+15 | |
| | ||||||
* | remove old macro support | Aleksey Kladov | 2019-03-17 | 1 | -3/+26 | |
| | ||||||
* | rename ModuleId -> CrateModuleId | Aleksey Kladov | 2019-03-17 | 1 | -15/+15 | |
| | ||||||
* | log time | Aleksey Kladov | 2019-03-17 | 1 | -0/+2 | |
| | ||||||
* | Reorganize name resolution | Aleksey Kladov | 2019-03-17 | 1 | -100/+362 | |
| | ||||||
* | remove ItemMap | Aleksey Kladov | 2019-03-17 | 1 | -535/+4 | |
| | ||||||
* | move tests over to crate-def-map | Aleksey Kladov | 2019-03-17 | 1 | -4/+1 | |
| | ||||||
* | Replace module_tree with CrateDefMap | Aleksey Kladov | 2019-03-17 | 1 | -11/+12 | |
| | ||||||
* | add skeleton for macro-aware name resolutions | Aleksey Kladov | 2019-03-17 | 1 | -0/+1 | |
| | ||||||
* | align lower module query names | Aleksey Kladov | 2019-03-02 | 1 | -1/+1 | |
| | ||||||
* | Fix resolution of associated method calls across crates | Florian Diebold | 2019-02-23 | 1 | -1/+5 | |
| | | | | | | I think it'll be better to make the path resolution the number of unresolved segments, not the first unresolved index; then this error could simply not have happened. But I'll do that separately. | |||||
* | Make nameres::ResolvePathResult private and refactor | Ville Penttinen | 2019-02-21 | 1 | -7/+7 | |
| | ||||||
* | Remove Const inference for now, refactor PathResult | Ville Penttinen | 2019-02-21 | 1 | -15/+8 | |
| | ||||||
* | Implement basic support for Associated Methods and Constants | Ville Penttinen | 2019-02-21 | 1 | -16/+62 | |
| | | | | | | | This is done in `infer_path_expr`. When `Resolver::resolve_path` returns `PartiallyResolved`, we use the returned `Resolution` together with the given `segment_index` to check if we can find something matching the segment at segment_index in the impls for that particular type. | |||||
* | Handle tuple structs / enum variants properly in type inference | Florian Diebold | 2019-02-17 | 1 | -2/+2 | |
| | ||||||
* | Complete names from prelude | Florian Diebold | 2019-02-13 | 1 | -1/+1 | |
| | ||||||
* | Handle extern crates better, so they work correctly in 2015 edition | Florian Diebold | 2019-02-13 | 1 | -8/+17 | |
| | | | | (see the removed comment.) | |||||
* | Resolve 2015 style imports | Florian Diebold | 2019-02-13 | 1 | -7/+61 | |
| | ||||||
* | Import the prelude | Florian Diebold | 2019-02-13 | 1 | -4/+46 | |
| | ||||||
* | Fix some typos | Pascal Hertleif | 2019-02-12 | 1 | -1/+1 | |
| | ||||||
* | rename combine -> or | Aleksey Kladov | 2019-02-11 | 1 | -2/+2 | |
| | | | | | | This way we match API of Option https://doc.rust-lang.org/std/option/enum.Option.html#method.or | |||||
* | use extern prelude in Resolver | Aleksey Kladov | 2019-02-11 | 1 | -13/+9 | |
| | | | | | | | This fixes two bugs: - completion for paths works again - we handle extern prelude shadowing more correctly | |||||
* | Implement glob imports within the same crate | Florian Diebold | 2019-02-10 | 1 | -16/+77 | |
| | | | | Fixes #231. | |||||
* | Import glob imports from other crates | Florian Diebold | 2019-02-10 | 1 | -2/+15 | |
| | | | | This is the easy part since we don't have to consider the fixpoint algorithm. | |||||
* | Implement glob imports from enums | Florian Diebold | 2019-02-10 | 1 | -4/+35 | |
| | ||||||
* | reformat the world | Aleksey Kladov | 2019-02-08 | 1 | -74/+21 | |
| | ||||||
* | Fix ReachedFixedPoint value for unresolved external prelude items | Florian Diebold | 2019-02-04 | 1 | -1/+1 | |
| | ||||||
* | Complete extern prelude (again) | Florian Diebold | 2019-02-04 | 1 | -1/+1 | |
| | ||||||
* | Make extern crates in the root module add to the extern prelude | Florian Diebold | 2019-02-04 | 1 | -30/+60 | |
| | | | | To accomplish this, separate the extern prelude from the per-module item maps. | |||||
* | Use aliases in import resolution | Florian Diebold | 2019-02-01 | 1 | -9/+12 | |
| | ||||||
* | Cleanup | Florian Diebold | 2019-02-01 | 1 | -2/+1 | |
| | ||||||
* | Use the new Resolver API in completion | Florian Diebold | 2019-02-01 | 1 | -0/+9 | |
| | ||||||
* | Use new Resolver API in type inference | Florian Diebold | 2019-02-01 | 1 | -5/+18 | |
| | ||||||
* | Sketching the resolver API | Florian Diebold | 2019-02-01 | 1 | -1/+1 | |
| | ||||||
* | split HirDatabase api | csmoe | 2019-02-01 | 1 | -7/+6 | |
| | ||||||
* | Use Crate instead of CrateId | Aleksey Kladov | 2019-01-30 | 1 | -11/+7 | |
| | ||||||
* | move item_map_query | Aleksey Kladov | 2019-01-30 | 1 | -3/+26 | |
| | ||||||
* | remove Option<SourceFileItemId> hack | Aleksey Kladov | 2019-01-26 | 1 | -1/+1 | |
| | ||||||
* | nicer behavior in case of bugs | Aleksey Kladov | 2019-01-25 | 1 | -0/+5 | |
| | | | | | We should always reach a fixed point, but if we fail, let's fail loudly! | |||||
* | pack enum variants into arena | Aleksey Kladov | 2019-01-25 | 1 | -7/+2 | |
| | ||||||
* | drop obsolete fixme | Aleksey Kladov | 2019-01-25 | 1 | -1/+0 | |
| | ||||||
* | deglobify | Aleksey Kladov | 2019-01-25 | 1 | -2/+1 | |
| | ||||||
* | simplify | Aleksey Kladov | 2019-01-25 | 1 | -3/+11 | |
| | ||||||
* | fix comment | Aleksey Kladov | 2019-01-25 | 1 | -3/+2 | |
| | ||||||
* | rename def_id -> def | Aleksey Kladov | 2019-01-25 | 1 | -25/+14 | |
| | ||||||
* | write path resolution code only once | Aleksey Kladov | 2019-01-25 | 1 | -2/+11 | |
| | ||||||
* | refactor import resolution | Aleksey Kladov | 2019-01-25 | 1 | -94/+117 | |
| | | | | | extract path resolution use enums instead of bools | |||||
* | Change ids strategy | Aleksey Kladov | 2019-01-24 | 1 | -30/+26 | |
| | | | | | | | this is a part of larghish hir refactoring which aims to * replace per-source-root module trees with per crate trees * switch from a monotyped DedId to type-specific ids | |||||
* | assign DefIds when lowering | Aleksey Kladov | 2019-01-23 | 1 | -18/+2 | |
| |