Commit message (Collapse) | Author | Age | Files | Lines | ||
---|---|---|---|---|---|---|
... | ||||||
* | | Disable broken struct field rainbowing | Pascal Hertleif | 2019-05-27 | 3 | -23/+7 | |
| | | ||||||
* | | More clever highlighting, incl draft for structs | Pascal Hertleif | 2019-05-27 | 6 | -407/+151 | |
| | | ||||||
* | | Hash based on binding name and shadow counter | Pascal Hertleif | 2019-05-27 | 3 | -20/+75 | |
| | | ||||||
* | | Semantic highlighting spike | Pascal Hertleif | 2019-05-27 | 3 | -35/+345 | |
|/ | | | | | | | | | | Very simple approach: For each identifier, set the hash of the range where it's defined as its 'id' and use it in the VSCode extension to generate unique colors. Thus, the generated colors are per-file. They are also quite fragile, and I'm not entirely sure why. Looks like we need to make sure the same ranges aren't overwritten by a later request? | |||||
* | Colorize Rust code as HTML | Aleksey Kladov | 2019-05-25 | 4 | -152/+131 | |
| | ||||||
* | :arrow_up: rustc | Aleksey Kladov | 2019-05-23 | 58 | -610/+640 | |
| | ||||||
* | profile highlighting | Aleksey Kladov | 2019-05-23 | 1 | -0/+3 | |
| | ||||||
* | add union to code_model | Aleksey Kladov | 2019-05-23 | 4 | -0/+11 | |
| | ||||||
* | Improve highlighting of name refs | Laurențiu Nicola | 2019-05-23 | 2 | -9/+168 | |
| | ||||||
* | Move NameRef classification logic out of reference_definition | Laurențiu Nicola | 2019-05-23 | 4 | -97/+143 | |
| | ||||||
* | Address feedback | Laurențiu Nicola | 2019-05-21 | 1 | -4/+11 | |
| | ||||||
* | Use ThemeColor and add support for light themes | Laurențiu Nicola | 2019-05-21 | 1 | -1/+11 | |
| | ||||||
* | apply T! macro where it is possible | Sergey Parilin | 2019-05-15 | 5 | -13/+13 | |
| | ||||||
* | expand to syntax node | Aleksey Kladov | 2019-05-14 | 1 | -1/+1 | |
| | ||||||
* | make AstId untyped | Aleksey Kladov | 2019-05-13 | 3 | -5/+5 | |
| | ||||||
* | Merge #1257 | bors[bot] | 2019-05-13 | 1 | -1/+2 | |
|\ | | | | | | | | | | | | | | | 1257: Implemented tkn! macro for syntax kinds r=matklad a=pasa Implementation of #1248 Co-authored-by: Sergey Parilin <[email protected]> | |||||
| * | Implemented T! macro for syntax kinds | Sergey Parilin | 2019-05-13 | 1 | -1/+2 | |
| | | ||||||
* | | simplify | Aleksey Kladov | 2019-05-12 | 1 | -1/+1 | |
|/ | ||||||
* | fill struct fields diagnostic | Sergey Parilin | 2019-05-06 | 1 | -1/+122 | |
| | ||||||
* | Profile diagnostics. | Marco Groppo | 2019-05-05 | 1 | -0/+2 | |
| | ||||||
* | Merge #1208 | bors[bot] | 2019-05-04 | 4 | -0/+52 | |
|\ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 1208: [WIP] Goto for Macro's r=matklad a=Lapz Adds goto definition for macros. Currently only works for macros in the current crate ~~otherwise it panics~~. Proper macro resolution needs to be added for it to resolve macros in other crates. Todo - [X] Allow goto from macro calls - [X] Fix panics - [x] Add tests ![Screen Recording 2019-04-25 at 18 00 24](https://user-images.githubusercontent.com/19998186/56754499-1dd01c00-6785-11e9-9e9a-1e36de70cfa3.gif) Co-authored-by: Lenard Pratt <[email protected]> | |||||
| * | Added local macro goto | Lenard Pratt | 2019-05-04 | 4 | -0/+52 | |
| | | ||||||
* | | Differentiate Tuple / FnPtr type constructors by cardinality | Florian Diebold | 2019-05-04 | 1 | -1/+1 | |
| | | | | | | | | | | This is necessary because Chalk (reasonably) expects each 'struct' to know how many type parameters it takes. | |||||
* | | revert eagarly clean astd maps | Aleksey Kladov | 2019-05-04 | 1 | -6/+1 | |
| | | | | | | | | This causes massive slowdown :-( | |||||
* | | eagarly clean astd maps | Aleksey Kladov | 2019-05-04 | 1 | -0/+6 | |
|/ | ||||||
* | Fix hover on the beginning of a nested expression | Florian Diebold | 2019-04-28 | 2 | -7/+15 | |
| | | | | | | | | | | | | | | | | E.g. in ``` let foo = 1u32; if true { <|>foo; } ``` the hover shows `()`, the type of the whole if expression, instead of the more sensible `u32`. The reason for this was that the search for an expression was slightly left-biased: When on the edge between two tokens, it first looked at all ancestors of the left token and then of the right token. Instead merge the ancestors in ascending order, so that we get the smaller of the two possible expressions. | |||||
* | 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 | 2 | -0/+76 | |
|/ | ||||||
* | Merge #1194 | bors[bot] | 2019-04-22 | 2 | -6/+118 | |
|\ | | | | | | | | | | | | | | | | | 1194: Pr 1190 r=matklad a=matklad Co-authored-by: Andrea Pretto <[email protected]> Co-authored-by: Aleksey Kladov <[email protected]> | |||||
| * | 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 | 2 | -13/+54 | |
| | | | | | | | | | | 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 | 1 | -7/+17 | |
| | | | | | | | | | | | | (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 | 2 | -8/+70 | |
| | | | | | | | | | | | | importable name. Changes complete_scope to support that. | |||||
* | | fix postfix match indent | Aleksey Kladov | 2019-04-22 | 2 | -4/+4 | |
|/ | ||||||
* | New krate() method in Resolver. | Marco Groppo | 2019-04-19 | 1 | -2/+2 | |
| | | | | Renamed Impl to ImplBlock. | |||||
* | Initial support for lang items. | Marco Groppo | 2019-04-19 | 1 | -10/+13 | |
| | ||||||
* | add a couple of profiling points | Aleksey Kladov | 2019-04-14 | 1 | -0/+2 | |
| | ||||||
* | Refactor method candidate generation a bit | Florian Diebold | 2019-04-14 | 1 | -1/+27 | |
| | | | | | | This fixes the order in which candidates are chosen a bit (not completely though, as the ignored test demonstrates), and makes autoderef work with trait methods. As a side effect, this also makes completion of trait methods work :) | |||||
* | Get substs for trait refs in impl blocks | Florian Diebold | 2019-04-14 | 1 | -1/+1 | |
| | ||||||
* | hide resolver | Aleksey Kladov | 2019-04-13 | 3 | -3/+3 | |
| | ||||||
* | fold ScopeWithSyntax into SourceAnalyzer | Aleksey Kladov | 2019-04-13 | 1 | -1/+1 | |
| | ||||||
* | obsolete fixm | Aleksey Kladov | 2019-04-13 | 1 | -1/+0 | |
| | ||||||
* | hide some scopes | Aleksey Kladov | 2019-04-13 | 1 | -13/+9 | |
| | ||||||
* | use really correct resolver for expressions | Aleksey Kladov | 2019-04-12 | 4 | -4/+5 | |
| | ||||||
* | fix typo | Aleksey Kladov | 2019-04-11 | 1 | -3/+3 | |
| |