aboutsummaryrefslogtreecommitdiff
path: root/crates/ra_syntax/src
Commit message (Collapse)AuthorAgeFilesLines
...
| * Add L_DOLLAR and R_DOLLAREdwin Cheng2019-04-111-0/+2
| |
* | replace usages of `algo::generate` with `iter::successors` from stdRobin Freyler2019-04-133-18/+10
| |
* | migrate to untyped rowanAleksey Kladov2019-04-096-154/+152
|/
* updated snapshotsLenard Pratt2019-04-074-8/+3
|
* Added ArrayExprKind,Lenard Pratt2019-04-072-2/+24
| | | | | changed the display for fixed array types, Added Array Enum to ra_hir/expr
* Added inference of array lengthLenard Pratt2019-04-072-1/+6
|
* Parse and infer tuple indicesrobojumper2019-04-065-6/+48
|
* Add proper test for literals and fixed typo bugEdwin Cheng2019-04-051-1/+1
|
* Add classify_literal and undo expose next_tokenEdwin Cheng2019-04-053-2/+11
|
* Fix literal support in token tree to ast item listEdwin Cheng2019-04-052-2/+2
|
* Merge #1076bors[bot]2019-04-022-2/+12
|\ | | | | | | | | | | | | | | | | 1076: Const body inference r=flodiebold a=Lapz This is the second part of #887. I've added type inference on const bodies and introduced the DefWithBody containing Function, Const and Static. I want to add tests but im unsure on how I would go about testing that completions work. Co-authored-by: Lenard Pratt <[email protected]>
| * Added const bodies and static body to the astLenard Pratt2019-04-022-5/+12
| | | | | | | | | | | | and added inference the inference test reduce code duplication
| * Added defWithBodyLenard Pratt2019-03-302-0/+3
| |
* | simplifyAleksey Kladov2019-04-027-400/+336
| |
* | Merge #1090bors[bot]2019-04-021-11/+10
|\ \ | | | | | | | | | | | | | | | | | | | | | 1090: always show token text r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | always show token textAleksey Kladov2019-04-021-11/+10
| | |
* | | fix inner block doc commentsAleksey Kladov2019-04-021-1/+1
|/ /
* | add minimal commentsAleksey Kladov2019-04-025-0/+13
| |
* | rename flavor to kindAleksey Kladov2019-04-023-26/+26
| |
* | move extensions to submodulesAleksey Kladov2019-04-023-549/+566
| |
* | remove flavorAleksey Kladov2019-04-021-4/+4
| |
* | More future-proof comment kindAleksey Kladov2019-04-022-33/+52
| |
* | fix comment namingAleksey Kladov2019-04-021-10/+9
| |
* | allow empty doc commentsAleksey Kladov2019-04-021-4/+6
| |
* | add ast::tokensAleksey Kladov2019-04-023-95/+106
| |
* | simplifyAleksey Kladov2019-04-021-23/+19
| |
* | move ast traits to a separate fileAleksey Kladov2019-04-022-144/+155
| |
* | Merge #1084bors[bot]2019-04-013-37/+0
|\ \ | | | | | | | | | | | | | | | | | | | | | 1084: remove dead code r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]>
| * | remove dead codeAleksey Kladov2019-04-013-37/+0
| | |
* | | intelligently add parens when inlining local varaiblesgfreezy2019-04-012-1/+10
|/ /
* | switch to new rowanAleksey Kladov2019-04-0114-799/+598
| |
* | Add WherePred to allow predicate access in WhereClauseVille Penttinen2019-03-313-2/+123
| | | | | | | | | | This also unifies parsing of WHERE_PRED bounds, now Lifetime bounds will also be parsed using TYPE_BOUND_LIST
* | Add trait ast::TypeBoundsOwnerVille Penttinen2019-03-313-5/+21
| |
* | Add new TYPE_BOUND_LIST and TYPE_BOUND syntax kindsVille Penttinen2019-03-302-0/+81
|/ | | | | | These are now used when parsing type bounds. In addition parsing paths inside a bound now does not recursively parse paths, rather they are treated as separate bounds, separated by +.
* Basics for trait method resolutionFlorian Diebold2019-03-252-2/+9
|
* Merge #1034bors[bot]2019-03-251-0/+6
|\ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 1034: HIR diagnostics API r=matklad a=matklad This PR introduces diagnostics API for HIR, so we can now start issuing errors and warnings! Here are requirements that this solution aims to fulfill: * structured diagnostics: rather than immediately rendering error to string, we provide a well-typed blob of data with error-description. These data is used by IDE to provide fixes * open set diagnostics: there's no single enum with all possible diagnostics, which hopefully should result in better modularity The `Diagnostic` trait describes "a diagnostic", which can be downcast to a specific diagnostic kind. Diagnostics are expressed in terms of macro-expanded syntax tree: they store pointers to syntax nodes. Diagnostics are self-contained: you don't need any context, besides `db`, to fully understand the meaning of a diagnostic. Because diagnostics are tied to the source, we can't store them in salsa. So subsystems like type-checking produce subsystem-local diagnostic (which is a closed `enum`), which is expressed in therms of subsystem IR. A separate step converts these proto-diagnostics into `Diagnostic`, by merging them with source-maps. Note that this PR stresses type-system quite a bit: we now type-check every function in open files to compute errors! Discussion on Zulip: https://rust-lang.zulipchat.com/#narrow/stream/185405-t-compiler.2Fwg-rls-2.2E0/topic/Diagnostics.20API Co-authored-by: Aleksey Kladov <[email protected]>
| * allow dyn diagnosticsAleksey Kladov2019-03-251-0/+6
| |
* | simplifyAleksey Kladov2019-03-251-37/+34
|/
* Target only the actual operator.Marco Groppo2019-03-241-33/+45
| | | | | Renamed `BinExpr::op()` and `PrefixExpr::op()` to `op_kind`. Now `op()` returns the `SyntaxNode`.
* replace todo with fixmeAleksey Kladov2019-03-231-1/+1
|
* Fix reparsing failure when removing newlinepcpthm2019-03-211-0/+7
|
* Fix reparsing bug on "{}{}"pcpthm2019-03-211-1/+1
|
* Completely ignore errors for reparse fuzzpcpthm2019-03-211-1/+0
|
* Use template text to improve reparse fuzzingpcpthm2019-03-211-1/+5
|
* Fix lexer not producing right token on "_"pcpthm2019-03-211-0/+1
|
* Fix reparsing bug when lex result is differentpcpthm2019-03-211-2/+9
|
* Improve reparse fuzz testpcpthm2019-03-211-1/+13
|
* Fix an arithmetic overflow in reparserpcpthm2019-03-212-5/+5
|
* Add fuzz test for reparsingpcpthm2019-03-211-1/+41
|
* Refactor parser fuzz testingpcpthm2019-03-212-7/+14
|
generated by cgit v1.2.3 (git 2.25.1) at 2024-11-14 23:13:11 +0000