Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Replace if with if-let | Aleksey Kladov | 2020-03-27 | 3 | -0/+136 |
| | |||||
* | More general ctor for ifs | Aleksey Kladov | 2020-03-27 | 1 | -1/+1 |
| | |||||
* | Get rid of ItemOrMacro | Aleksey Kladov | 2020-03-26 | 1 | -2/+2 |
| | |||||
* | Fix add visibility false-positive | Aleksey Kladov | 2020-03-25 | 2 | -12/+29 |
| | |||||
* | Merge #3708 | bors[bot] | 2020-03-24 | 3 | -38/+83 |
|\ | | | | | | | | | | | | | | | | | | | | | 3708: Generalise syntax rewriting infrastructure to allow removal of nodes r=matklad a=matklad bors r+ 🤖 Co-authored-by: Aleksey Kladov <[email protected]> | ||||
| * | Generalise syntax rewriting infrastructure to allow removal of nodes | Aleksey Kladov | 2020-03-24 | 3 | -38/+65 |
| | | |||||
| * | Add a test | Aleksey Kladov | 2020-03-23 | 1 | -0/+18 |
| | | |||||
* | | Merge #3705 | bors[bot] | 2020-03-24 | 1 | -1/+1 |
|\ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 3705: Align naming r=matklad a=matklad bors r+ 🤖 Co-authored-by: Aleksey Kladov <[email protected]> | ||||
| * | | Align naming | Aleksey Kladov | 2020-03-24 | 1 | -1/+1 |
| | | | |||||
* | | | Merge #3700 | bors[bot] | 2020-03-24 | 2 | -47/+47 |
|\ \ \ | |/ / |/| | | | | | | | | | | | | | | | | | | | | | | | 3700: fill match arms with empty block rather than unit tuple r=matklad a=JoshMcguigan As requested by @Veetaha in #3689 and #3687, this modifies the fill match arms assist to create match arms as an empty block `{}` rather than a unit tuple `()`. In one test I left one of the pre-existing match arms as a unit tuple, and added a body to another match arm, to demonstrate that the contents of existing match arms persist. Co-authored-by: Josh Mcguigan <[email protected]> | ||||
| * | | fill match arms with empty block rather than unit tuple | Josh Mcguigan | 2020-03-24 | 2 | -47/+47 |
| | | | |||||
* | | | Add a test | Kirill Bulatov | 2020-03-24 | 2 | -9/+45 |
| | | | |||||
* | | | Use more generic public api | Kirill Bulatov | 2020-03-24 | 3 | -24/+25 |
| | | | |||||
* | | | Auto import macros | Kirill Bulatov | 2020-03-24 | 3 | -16/+25 |
|/ / | |||||
* | | review comments | Josh Mcguigan | 2020-03-23 | 1 | -16/+108 |
| | | |||||
* | | implement fill match arm assist for tuple of enums | Josh Mcguigan | 2020-03-23 | 1 | -14/+149 |
|/ | |||||
* | disable invert if assist for if-let to fix #3281 | Josh Mcguigan | 2020-03-21 | 1 | -0/+13 |
| | |||||
* | Address nits and suggestions. | Steffen Lyngbaek | 2020-03-19 | 1 | -140/+32 |
| | | | | | Simplify the logic a lot by removing the check for a placeholder pat. This means the auto-fill no longer returns a compile-able value. | ||||
* | Don't show assist if all arms are present | Steffen Lyngbaek | 2020-03-19 | 1 | -33/+37 |
| | |||||
* | 'Fill match arms' should work with existing match arms | Steffen Lyngbaek | 2020-03-19 | 1 | -25/+281 |
| | | | | | | | | | | | | | | | | | | | | | | | | | | | Addresses #3039 This essentially adds missing match arms. The algorithm for this can get complicated rather quickly so bail in certain conditions and rely on a PlaceholderPat. The algorighm works as such: - Iterate through the Enum Def Variants - Attempt to see if the variant already exists as a match arm - If yes, skip the enum variant. If no, include it. - If it becomes complicated, rather than exhaustively deal with every branch, mark it as a "partial match" and simply include the placeholder. Conditions for "complication": - The match arm contains a match guard - Any kind of nested destrucuring Order the resulting merged match branches as such: 1. Provided match arms 2. Missing enum variant branch arms 3. End with Placeholder if required - Add extra tests | ||||
* | Cleanup imports | Aleksey Kladov | 2020-03-19 | 6 | -13/+17 |
| | |||||
* | Merge nested use trees | Aleksey Kladov | 2020-03-19 | 1 | -20/+52 |
| | |||||
* | Generalize | Aleksey Kladov | 2020-03-19 | 2 | -13/+10 |
| | |||||
* | Use match_ast | Aleksey Kladov | 2020-03-18 | 1 | -10/+13 |
| | |||||
* | Merge imports assist | Aleksey Kladov | 2020-03-18 | 5 | -25/+178 |
| | | | | Work towards #2220 | ||||
* | Reduce visibility | Aleksey Kladov | 2020-03-18 | 1 | -28/+28 |
| | |||||
* | Simplify | Aleksey Kladov | 2020-03-13 | 2 | -8/+5 |
| | |||||
* | Don't use generic DB where a concrete one will do | Aleksey Kladov | 2020-03-13 | 1 | -6/+2 |
| | |||||
* | Remove some TextUnit->usize escapees | CAD97 | 2020-03-13 | 1 | -1/+1 |
| | |||||
* | Rerail split_import API onto AST | Aleksey Kladov | 2020-03-06 | 1 | -19/+33 |
| | | | | | The code is more verbose and less efficient now, but should be reusable in add_import context as well | ||||
* | Unfold groups with single assists into plain assists | Kirill Bulatov | 2020-03-05 | 2 | -8/+6 |
| | |||||
* | Remove old find refs infra | Aleksey Kladov | 2020-03-04 | 2 | -13/+21 |
| | |||||
* | Highlight assist tests | Aleksey Kladov | 2020-03-03 | 2 | -48/+52 |
| | |||||
* | Fix applicability of inline local | Aleksey Kladov | 2020-03-03 | 3 | -10/+34 |
| | |||||
* | One more assert | Aleksey Kladov | 2020-03-02 | 1 | -1/+6 |
| | |||||
* | Rename ast::ImplBlock -> ast::ImplDef | Aleksey Kladov | 2020-02-29 | 5 | -21/+21 |
| | |||||
* | Add a FIXME | Aleksey Kladov | 2020-02-29 | 1 | -0/+2 |
| | |||||
* | Fix typo | Aleksey Kladov | 2020-02-29 | 2 | -2/+2 |
| | |||||
* | Cleanup editing API | Aleksey Kladov | 2020-02-29 | 1 | -1/+1 |
| | |||||
* | More orthogonal API for building paths | Aleksey Kladov | 2020-02-29 | 2 | -11/+18 |
| | |||||
* | Simplify | Aleksey Kladov | 2020-02-28 | 3 | -23/+3 |
| | |||||
* | Move insert_use util to utils | Aleksey Kladov | 2020-02-28 | 5 | -533/+538 |
| | |||||
* | introduce const visibility assist | Douglas Campos | 2020-02-28 | 1 | -4/+9 |
| | |||||
* | Refactor string literals | Aleksey Kladov | 2020-02-27 | 1 | -1/+2 |
| | |||||
* | Refactor primary IDE API | Aleksey Kladov | 2020-02-26 | 10 | -153/+100 |
| | | | | | | | | | | This introduces the new type -- Semantics. Semantics maps SyntaxNodes to various semantic info, such as type, name resolution or macro expansions. To do so, Semantics maintains a HashMap which maps every node it saw to the file from which the node originated. This is enough to get all the necessary hir bits just from syntax. | ||||
* | Remove code duplication in tests | Aleksey Kladov | 2020-02-26 | 2 | -101/+73 |
| | |||||
* | Replace generic with a concrete type | Aleksey Kladov | 2020-02-25 | 1 | -12/+13 |
| | |||||
* | Add `remove_mut` assist | Aleksey Kladov | 2020-02-19 | 3 | -0/+51 |
| | |||||
* | Cleanup | Shotaro Yamada | 2020-02-19 | 1 | -1/+1 |
| | |||||
* | More manual clippy fixes | Kirill Bulatov | 2020-02-18 | 2 | -5/+5 |
| |