Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | simplify parsing blocks a bit | Aleksey Kladov | 2019-03-17 | 1 | -57/+56 |
| | |||||
* | Merge #968 | bors[bot] | 2019-03-17 | 36 | -1954/+2053 |
|\ | | | | | | | | | | | | | | | | | | | | | | | | | | | 968: Macro aware name resoltion r=matklad a=matklad The first commit lays the ground work for new name resolution, including * extracting position-indendent items from parse trees * walking the tree of modules * old-style macro_rules resolve cc @pnkfelix: this looks like an API name resolution should interact with. Co-authored-by: Aleksey Kladov <[email protected]> | ||||
| * | docs | Aleksey Kladov | 2019-03-17 | 1 | -9/+15 |
| | | |||||
| * | remove fixme | Aleksey Kladov | 2019-03-17 | 1 | -2/+1 |
| | | |||||
| * | remove old macro support | Aleksey Kladov | 2019-03-17 | 8 | -261/+95 |
| | | |||||
| * | rename ModuleId -> CrateModuleId | Aleksey Kladov | 2019-03-17 | 8 | -39/+40 |
| | | |||||
| * | fix error on wrong path | Aleksey Kladov | 2019-03-17 | 4 | -12/+43 |
| | | |||||
| * | log time | Aleksey Kladov | 2019-03-17 | 1 | -0/+2 |
| | | |||||
| * | Reorganize name resolution | Aleksey Kladov | 2019-03-17 | 14 | -522/+481 |
| | | |||||
| * | hack around non-terminating macro expansion | Aleksey Kladov | 2019-03-17 | 1 | -0/+14 |
| | | |||||
| * | remove lower module | Aleksey Kladov | 2019-03-17 | 12 | -264/+48 |
| | | |||||
| * | remove ItemMap | Aleksey Kladov | 2019-03-17 | 7 | -569/+59 |
| | | |||||
| * | move tests over to crate-def-map | Aleksey Kladov | 2019-03-17 | 9 | -850/+689 |
| | | |||||
| * | Replace module_tree with CrateDefMap | Aleksey Kladov | 2019-03-17 | 16 | -511/+333 |
| | | |||||
| * | add name resolution from the old impl | Aleksey Kladov | 2019-03-17 | 9 | -185/+739 |
| | | | | | | | | unlike the old impl, this also handles macro imports across crates | ||||
| * | add skeleton for macro-aware name resolutions | Aleksey Kladov | 2019-03-17 | 8 | -9/+773 |
|/ | |||||
* | Merge #947 | bors[bot] | 2019-03-17 | 2 | -0/+285 |
|\ | | | | | | | | | | | | | | | | | | | | | | | 947: Add missing impl members r=matklad a=Xanewok Closes #878. This took longer than expected as I wrapped my head around the API and the project - hopefully I didn't miss any edge case here. r? @matklad Co-authored-by: Igor Matuszewski <[email protected]> | ||||
| * | Move the primary assist fn to the top of the file | Igor Matuszewski | 2019-03-16 | 1 | -30/+30 |
| | | |||||
| * | Provide assist when cursor is immediately outside impl item block | Igor Matuszewski | 2019-03-16 | 1 | -14/+18 |
| | | |||||
| * | Do a cleanup/legibility pass | Igor Matuszewski | 2019-03-16 | 1 | -21/+21 |
| | | |||||
| * | Take into account parent indent when filling trait members | Igor Matuszewski | 2019-03-16 | 1 | -9/+41 |
| | | |||||
| * | Simplify trait resolution fragment | Igor Matuszewski | 2019-03-16 | 1 | -6/+3 |
| | | |||||
| * | Ignore unnamed trait fns and add more tests | Igor Matuszewski | 2019-03-16 | 1 | -2/+70 |
| | | |||||
| * | Simplify calculation of missing functions | Igor Matuszewski | 2019-03-16 | 1 | -9/+2 |
| | | | | | | | | | | | | Asymptotically computing a set difference is faster but in the average case we won't have more than ~10 functions. Also prefer not using hash sets as these may yield nondeterministic results. | ||||
| * | Properly support the case when the cursor is inside an empty block or outside | Igor Matuszewski | 2019-03-16 | 1 | -15/+44 |
| | | |||||
| * | Redo indent calculation when adding missing impl members | Igor Matuszewski | 2019-03-16 | 1 | -9/+21 |
| | | |||||
| * | Implement a simple working assist | Igor Matuszewski | 2019-03-16 | 1 | -13/+59 |
| | | |||||
| * | Calculate missing functions from impl body | Igor Matuszewski | 2019-03-16 | 1 | -1/+62 |
| | | |||||
| * | Add 'add_missing_impl_members' assist stub | Igor Matuszewski | 2019-03-16 | 2 | -0/+43 |
|/ | |||||
* | Merge #981 | bors[bot] | 2019-03-16 | 5 | -120/+157 |
|\ | | | | | | | | | | | | | | | | | 981: Remove FnSig from FnDef type r=matklad a=flodiebold It doesn't need to be in there since it's just information from the def. Another step towards aligning Ty with Chalk's representation. Co-authored-by: Florian Diebold <[email protected]> | ||||
| * | Remove FnSig from FnDef type | Florian Diebold | 2019-03-16 | 4 | -21/+26 |
| | | | | | | | | | | It doesn't need to be in there since it's just information from the def. Another step towards aligning Ty with Chalk's representation. | ||||
| * | Refactor FnSig a bit | Florian Diebold | 2019-03-16 | 3 | -70/+104 |
| | | |||||
| * | Some more Ty displaying cleanup | Florian Diebold | 2019-03-16 | 2 | -35/+33 |
|/ | |||||
* | Merge #976 | bors[bot] | 2019-03-16 | 7 | -60/+136 |
|\ | | | | | | | | | | | | | | | | | | | | | 976: Replace Display by a pretty printing trait for Ty r=matklad a=flodiebold This allows removing the names from Adt and FnDef (and more later), as a first step towards aligning more with chalk's Ty :) I may have gone a bit overboard with the definition of the PrettyPrint trait... Co-authored-by: Florian Diebold <[email protected]> | ||||
| * | Replace Display by a pretty printing trait for Ty | Florian Diebold | 2019-03-16 | 7 | -60/+136 |
| | | | | | | | | | | This allows removing the names from Adt and FnDef (and more later), as a first step towards aligning more with chalk's Ty :) | ||||
* | | Merge #978 | bors[bot] | 2019-03-15 | 1 | -16/+16 |
|\ \ | | | | | | | | | | | | | | | | | | | | | | 978: Update some dependencies r=matklad a=kjeremy Co-authored-by: kjeremy <[email protected]> | ||||
| * | | Update some dependencies | kjeremy | 2019-03-15 | 1 | -16/+16 |
|/ / | |||||
* | | Merge #977 | bors[bot] | 2019-03-15 | 1 | -5/+4 |
|\ \ | |/ |/| | | | | | | | | | | | 977: Fix ra-emacs-lsp for newest lsp-mode with native json support r=matklad a=flodiebold Co-authored-by: Florian Diebold <[email protected]> | ||||
| * | Fix ra-emacs-lsp for newest lsp-mode with native json support | Florian Diebold | 2019-03-14 | 1 | -5/+4 |
|/ | |||||
* | Merge #975 | bors[bot] | 2019-03-14 | 1 | -1/+2 |
|\ | | | | | | | | | | | | | | | 975: sort navigations to make tests stable r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]> | ||||
| * | sort navigations to make tests stable | Aleksey Kladov | 2019-03-14 | 1 | -1/+2 |
|/ | |||||
* | Merge #974 | bors[bot] | 2019-03-14 | 3 | -1/+348 |
|\ | | | | | | | | | | | | | | | 974: Add MINUS token the PATTERN_FIRST token set r=matklad a=mchesser Fixes: #972 Co-authored-by: Michael Chesser <[email protected]> | ||||
| * | Add test for minus in inner pattern | Michael Chesser | 2019-03-14 | 2 | -0/+347 |
| | | |||||
| * | Allow MINUS at the start of a pattern. | Michael Chesser | 2019-03-14 | 1 | -1/+1 |
|/ | |||||
* | Merge #973 | bors[bot] | 2019-03-14 | 1 | -1/+1 |
|\ | | | | | | | | | | | | | | | 973: derive Hash for ra_hir::ModuleDef r=matklad a=pcpthm I wanted to use `HashSet` but it seems like `Hash` derive is missing for no reason. Co-authored-by: pcpthm <[email protected]> | ||||
| * | derive Hash for ra_hir::ModuleDef | pcpthm | 2019-03-14 | 1 | -1/+1 |
|/ | |||||
* | Merge #971 | bors[bot] | 2019-03-14 | 1 | -2/+3 |
|\ | | | | | | | | | | | | | | | 971: Point to compiler-team repo in the readme r=matklad a=detrumi The readme still links to the old repo, which redirects to the new one Co-authored-by: Wilco Kusee <[email protected]> | ||||
| * | Point to the compiler-team repo directly | Wilco Kusee | 2019-03-13 | 1 | -2/+3 |
|/ | |||||
* | Merge #970 | bors[bot] | 2019-03-13 | 1 | -1/+1 |
|\ | | | | | | | | | | | | | | | 970: Fix typo r=matklad a=skade Co-authored-by: Florian Gilcher <[email protected]> | ||||
| * | Fix typo | Florian Gilcher | 2019-03-13 | 1 | -1/+1 |
|/ |