aboutsummaryrefslogtreecommitdiff
path: root/crates/ra_syntax/src
Commit message (Collapse)AuthorAgeFilesLines
...
* move node at offset to aglo alreadyAleksey Kladov2019-01-081-1/+5
|
* assist to convert if-let to matchAleksey Kladov2019-01-081-1/+1
|
* itroduce trait for ast tokensAleksey Kladov2019-01-087-53/+28
|
* migrate ra_hir to rowan 2.0Aleksey Kladov2019-01-082-0/+38
|
* migrate ra_db to new rowanAleksey Kladov2019-01-081-1/+10
|
* wrap TreePtrAleksey Kladov2019-01-081-7/+45
|
* regenerateAleksey Kladov2019-01-081-3052/+1791
|
* switch ra_syntax to new rowan APIAleksey Kladov2019-01-0814-323/+262
|
* Implement type inference for more binary operatorsMarcus Klaas de Vries2019-01-071-2/+2
| | | | | Mostly just for primitive numeric types such as u32 and f64. Not yet a general solution using trait resolution.
* Add remaining binary operations to ASTMarcus Klaas de Vries2019-01-073-1/+72
|
* Merge #440bors[bot]2019-01-061-0/+52
|\ | | | | | | | | | | | | | | | | | | 440: Implement type inference for boolean operators r=flodiebold a=marcusklaas Tried implementing the easiest part of https://github.com/rust-analyzer/rust-analyzer/issues/390. Hope this is somewhat close to what the intent of the issue was. Found it surprisingly easy to find my way around the repository - it's well organized! Very grateful for any pointers. Co-authored-by: Marcus Klaas de Vries <[email protected]>
| * Touch up type inference for boolean operatorsMarcus Klaas de Vries2019-01-063-26/+26
| | | | | | | | | | Also try to infer its subexpressions and set type expectations whenever possible.
| * Implement type inference for boolean operatorsMarcus Klaas de Vries2019-01-053-2/+54
| |
* | Make FnScopes use hir::ExprFlorian Diebold2019-01-052-22/+13
| | | | | | | | | | | | This was a bit complicated. I've added a wrapper type for now that does the LocalSyntaxPtr <-> ExprId translation; we might want to get rid of that or give it a nicer interface.
* | Add HIR Expr machineryFlorian Diebold2019-01-052-3/+11
|/
* change visibility can change pub to pub(crate)Aleksey Kladov2019-01-051-0/+18
|
* split import assistAleksey Kladov2019-01-051-0/+6
|
* Rename traits::impl_item -> impl_block as well, as well as the testsFlorian Diebold2019-01-042-4/+4
|
* Type the self parameterFlorian Diebold2019-01-043-2/+79
|
* Add HIR for impl blocksFlorian Diebold2019-01-042-3/+43
| | | | | | | | | Since we need to be able to go from def to containing impl block, as well as the other direction, and to find all impls for a certain type, a design similar to the one for modules, where we collect all impls for the whole crate and keep them in an arena, seemed fitting. The ImplBlock type, which provides the public interface, then consists only of an Arc to the arena containing all impls, and the index into it.
* Rename ImplItem to ImplBlockFlorian Diebold2019-01-046-26/+26
| | | | | rustc uses the name ImplItem for items in impls, not the impl {} block itself, which could lead to confusion.
* add mod doc comments test in astcsmoe2019-01-041-0/+13
|
* parse doc comment for itemscsmoe2019-01-041-0/+12
|
* Merge #391bors[bot]2019-01-045-59/+117
|\ | | | | | | | | | | | | | | 391: docing parser methods r=csmoe a=csmoe Co-authored-by: csmoe <[email protected]>
| * consume trivias for type/const defcsmoe2019-01-041-2/+1
| |
| * doc parsing eventscsmoe2019-01-044-43/+71
| |
| * doc parser inputcsmoe2019-01-012-10/+30
| |
| * docing parser methodscsmoe2018-12-314-12/+23
| |
* | more enterprisey assists APIAleksey Kladov2019-01-031-0/+6
| |
* | visibility ownerAleksey Kladov2019-01-033-4/+64
| |
* | add items from macros to modulesAleksey Kladov2019-01-011-0/+30
| |
* | save top-level macros in module itemsAleksey Kladov2019-01-011-1/+1
| |
* | Fix the same bug as #396 but for bytes tooDJMcNab2019-01-011-1/+3
| |
* | Use an else ifDJMcNab2019-01-011-3/+2
| |
* | Fix the `panic` found whilst fuzzingDJMcNab2018-12-311-3/+9
|/
* Merge #366bors[bot]2018-12-301-0/+5
|\ | | | | | | | | | | | | | | | | | | | | 366: parse minus before number literal pattern r=matklad a=csmoe r?@matklad ![unknown](https://user-images.githubusercontent.com/35686186/50547871-d5449e00-0c7d-11e9-9ff5-1031e78019de.png) Co-authored-by: csmoe <[email protected]>
| * parse minus before number literalcsmoe2018-12-301-0/+5
| |
* | Fix a fuzzing bug and add Cargo.lock to the fuzzing directoryDJMcNab2018-12-292-2/+2
| |
* | super simplistic macro expansionAleksey Kladov2018-12-282-1/+5
| |
* | add macro-call nodeAleksey Kladov2018-12-282-0/+42
|/
* fix suffix rangesAleksey Kladov2018-12-274-4/+16
|
* dump validation errorsAleksey Kladov2018-12-271-2/+5
|
* support literal suffixesAleksey Kladov2018-12-277-2/+40
|
* dedupe literal parsersAleksey Kladov2018-12-2710-374/+220
|
* Add a hir::TypeRef as an intermediate between ast::TypeRef and ty::TyFlorian Diebold2018-12-252-10/+38
|
* Implement reference / pointer typesFlorian Diebold2018-12-253-6/+57
| | | | | - parse them - infer types of & and * expressions
* Implement basic completion for fieldsFlorian Diebold2018-12-252-1/+5
|
* Improve parsing of incomplete field accesses in preparation for field completionFlorian Diebold2018-12-251-9/+7
| | | | | We need to be able to get the receiver even if there is no field name yet, and currently "a." wouldn't get parsed as a field name at all. This seems to help.
* Type field accessesFlorian Diebold2018-12-252-2/+10
|
* Add AST definitions for struct/variant fields etc.Florian Diebold2018-12-253-12/+256
| | | | Fixes #117