Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Elide lifetime | kjeremy | 2019-04-26 | 1 | -1/+1 |
| | |||||
* | Use panic instead of unwrap | Edwin Cheng | 2019-04-25 | 1 | -8/+6 |
| | |||||
* | Fix more bugs | Edwin Cheng | 2019-04-25 | 7 | -24/+202 |
| | |||||
* | Add handling `token` seperator in mbe | Edwin Cheng | 2019-04-25 | 7 | -226/+218 |
| | |||||
* | Add more information on macro rules fail to parse | Edwin Cheng | 2019-04-25 | 1 | -2/+8 |
| | |||||
* | Fix incorrect repeat sep eating | Edwin Cheng | 2019-04-25 | 3 | -24/+304 |
| | |||||
* | drop empty file | Aleksey Kladov | 2019-04-25 | 1 | -0/+0 |
| | |||||
* | simplify match | kjeremy | 2019-04-24 | 1 | -4/+1 |
| | |||||
* | See through references | kjeremy | 2019-04-24 | 1 | -2/+20 |
| | |||||
* | Merge #1200 | bors[bot] | 2019-04-23 | 1 | -18/+70 |
|\ | | | | | | | | | | | | | | | 1200: Allows searching for case-equivalent symbols (fixes #1151) r=matklad a=jrvidal I couldn't find a nice, functional way of calculating the ranges in one pass so I resorted to a plain old `for` loop. Co-authored-by: Roberto Vidal <[email protected]> | ||||
| * | CR corrections | Roberto Vidal | 2019-04-23 | 1 | -2/+2 |
| | | |||||
| * | Allows searching for case-equivalent symbols (fixes #1151) | Roberto Vidal | 2019-04-23 | 1 | -18/+70 |
| | | |||||
* | | Simplify | kjeremy | 2019-04-23 | 1 | -5/+3 |
| | | |||||
* | | Basic resolution for ADT | kjeremy | 2019-04-23 | 5 | -2/+99 |
|/ | |||||
* | Merge #1147 | bors[bot] | 2019-04-23 | 6 | -15/+133 |
|\ | | | | | | | | | | | | | | | 1147: Handle macros in type checking / HIR r=matklad a=Lapz An other attempt at #1102. I will need to flatten the nested if statements and im also not sure if the way that i get the resolver and module will always work Co-authored-by: Lenard Pratt <[email protected]> | ||||
| * | Introduced resolve_macro_call on resolver | Lenard Pratt | 2019-04-23 | 5 | -55/+112 |
| | | | | | | | | | | | | changed to manual expansion fix for nested macros | ||||
| * | Added macro resolution and expansion | Lenard Pratt | 2019-04-22 | 7 | -106/+135 |
| | | |||||
| * | Addeded resolver and db | Lenard Pratt | 2019-04-22 | 2 | -60/+92 |
| | | |||||
* | | Add `...` parsing for fn pointer type | Edwin Cheng | 2019-04-23 | 4 | -3/+47 |
|/ | |||||
* | Add cached for SubtreeSource | Edwin Cheng | 2019-04-22 | 1 | -4/+20 |
| | |||||
* | Merge #1194 | bors[bot] | 2019-04-22 | 7 | -77/+271 |
|\ | | | | | | | | | | | | | | | | | 1194: Pr 1190 r=matklad a=matklad Co-authored-by: Andrea Pretto <[email protected]> Co-authored-by: Aleksey Kladov <[email protected]> | ||||
| * | unused import | Aleksey Kladov | 2019-04-22 | 1 | -2/+0 |
| | | |||||
| * | remove path_ident from CompletionContext | Aleksey Kladov | 2019-04-22 | 2 | -39/+38 |
| | | | | | | | | | | | | | | | | | | We really shouldn't be looking at the identifier at point. Instead, all filtering and sorting should be implemented at the layer above. This layer should probably be home for auto-import completions as well, but, since that is not yet implemented, let's just stick this into complete_scope. | ||||
| * | move auto-imoprter into IDE | Aleksey Kladov | 2019-04-22 | 7 | -92/+68 |
| | | | | | | | | | | auto-import is purely an IDE concern, so it should be done outside of HIR | ||||
| * | complete_import: prevent panic when the anchor is the completion source range | Andrea Pretto | 2019-04-21 | 3 | -16/+18 |
| | | | | | | | | | | | | (fix rebase mess) Please enter the commit message for your changes. Lines starting | ||||
| * | complete_import: add new import resolver infrastructure with some hardcoded ↵ | Andrea Pretto | 2019-04-21 | 6 | -11/+155 |
| | | | | | | | | | | | | importable name. Changes complete_scope to support that. | ||||
| * | auto_import: better no anchor management | Andrea Pretto | 2019-04-21 | 1 | -7/+48 |
| | | |||||
| * | auto_import: make auto import working with target as a list of SmolStr ↵ | Andrea Pretto | 2019-04-21 | 2 | -63/+69 |
| | | | | | | | | instead of ast::Path | ||||
| * | auto_import: use TextEditBuilder instead of AssistBuilder to make it more ↵ | Andrea Pretto | 2019-04-21 | 2 | -8/+36 |
| | | | | | | | | reusable | ||||
* | | Merge #1193 | bors[bot] | 2019-04-22 | 1 | -3/+98 |
|\ \ | | | | | | | | | | | | | | | | | | | | | | 1193: Add a test for #1178 case r=edwin0cheng a=edwin0cheng A little PR to add a test case for #1178 Co-authored-by: Edwin Cheng <[email protected]> | ||||
| * | | Remove unused print out | Edwin Cheng | 2019-04-22 | 1 | -67/+63 |
| | | | |||||
| * | | Add a test for #1178 case | Edwin Cheng | 2019-04-22 | 1 | -3/+102 |
| | | | |||||
* | | | Merge #1184 | bors[bot] | 2019-04-22 | 12 | -196/+567 |
|\ \ \ | |/ / |/| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 1184: Start structured editing API r=matklad a=matklad I think I finally understand how to provide nice, mutable structured editing API on top of red-green trees. The problem I am trying to solve is that any modification to a particular `SyntaxNode` returns an independent new file. So, if you are editing a struct literal, and add a field, you get back a SourceFile, and you have to find the struct literal inside it yourself! This happens because our trees are immutable, but have parent pointers. The main idea here is to introduce `AstEditor<T>` type, which abstracts away that API. So, you create an `AstEditor` for node you want to edit and call various `&mut` taking methods on it. Internally, `AstEditor` stores both the original node and the current node. All edits are applied to the current node, which is replaced by the corresponding node in the new file. In the end, `AstEditor` computes a text edit between old and new nodes. Note that this also should sole a problem when you create an anchor pointing to a subnode and mutate the parent node, invalidating anchor. Because mutation needs `&mut`, all anchors must be killed before modification. Co-authored-by: Aleksey Kladov <[email protected]> | ||||
| * | | drop useless test | Aleksey Kladov | 2019-04-22 | 1 | -28/+0 |
| | | | |||||
| * | | move add_missing_members to structured editing API | Aleksey Kladov | 2019-04-22 | 4 | -146/+231 |
| | | | | | | | | | | | | | | | Currently, this is more code, and we also loose auto-indenting of bodies, but, long-term, this is the right approach | ||||
| * | | fix postfix match indent | Aleksey Kladov | 2019-04-22 | 2 | -4/+4 |
| | | | |||||
| * | | more type safety | Aleksey Kladov | 2019-04-22 | 3 | -4/+29 |
| | | | |||||
| * | | test short structs | Aleksey Kladov | 2019-04-21 | 3 | -4/+39 |
| | | | |||||
| * | | use structured editing API for fill struct assist | Aleksey Kladov | 2019-04-21 | 3 | -119/+138 |
| | | | |||||
| * | | start structured editing API | Aleksey Kladov | 2019-04-21 | 6 | -3/+238 |
| | | | |||||
* | | | Use map, sum in Subtree::coount instead of fold | Edwin Cheng | 2019-04-22 | 1 | -4/+8 |
| | | | |||||
* | | | Change macro stack monitor test to func ptr based | Edwin Cheng | 2019-04-22 | 1 | -40/+25 |
| | | | |||||
* | | | Add mbe expand limit and poision macro set | Edwin Cheng | 2019-04-22 | 5 | -18/+216 |
| |/ |/| | |||||
* | | Add tests | Edwin Cheng | 2019-04-21 | 1 | -2/+87 |
| | | |||||
* | | Fix offset bug in SourceWalker | Edwin Cheng | 2019-04-21 | 1 | -6/+7 |
| | | |||||
* | | Handle `*+` case and single token case | Edwin Cheng | 2019-04-21 | 1 | -5/+56 |
| | | |||||
* | | fix mbe_parser rhs colon parsing | Edwin Cheng | 2019-04-21 | 1 | -10/+11 |
| | | |||||
* | | Add more information on parse_macro fail | Edwin Cheng | 2019-04-21 | 1 | -10/+27 |
| | | |||||
* | | Fix lifetime in tt to syntax node conversion | Edwin Cheng | 2019-04-21 | 1 | -1/+6 |
|/ | |||||
* | Add HIR for where clauses & ignore impls with where clauses in trait resolution | Florian Diebold | 2019-04-21 | 3 | -5/+63 |
| | | | | | This prevents any `impl<T> Trait for T where ...` from being treated as a blanket impl while we don't handle where clauses yet. |