| Commit message (Collapse) | Author | Age | Files | Lines | ||
|---|---|---|---|---|---|---|
| ... | ||||||
| | * | fix arbitrary offset generation, col translation working | Bernardo | 2018-12-25 | 2 | -39/+92 | |
| | | | ||||||
| | * | column translation implemented but not quite working yet | Bernardo | 2018-12-25 | 3 | -50/+70 | |
| | | | ||||||
| | * | iterate over `Step`s which are either, newlines or multibyte chars | Bernardo | 2018-12-25 | 2 | -26/+121 | |
| | | | ||||||
| | * | simplify newline check with macro | Bernardo | 2018-12-25 | 1 | -20/+14 | |
| | | | ||||||
| | * | remove slower impl, add benchmarks | Bernardo | 2018-12-25 | 6 | -201/+304 | |
| | | | ||||||
| | * | final iteration, faster a bit simpler | Bernardo | 2018-12-25 | 1 | -171/+209 | |
| | | | | | | | | | the main thing is we iterate over inserted newlines at once for each edit | |||||
| | * | simplified version | Bernardo | 2018-12-25 | 1 | -0/+139 | |
| | | | ||||||
| | * | move translate_offset_with_edit to ra_editor | Bernardo | 2018-12-25 | 7 | -311/+268 | |
| | | | ||||||
| | * | initial newline translation working | Bernardo | 2018-12-25 | 2 | -14/+262 | |
| | | | | | | | | | | | | | todo: cleanup, simplify handle columns | |||||
| | * | test translate_offset_with_edit against simple impl for single edits | Bernardo | 2018-12-25 | 6 | -35/+104 | |
| | | | ||||||
| | * | simplify and reduce number of values explored | Bernardo | 2018-12-25 | 1 | -29/+23 | |
| | | | ||||||
| | * | proptest strategies for TextUnit and AtomTextEdit | Bernardo | 2018-12-25 | 4 | -0/+184 | |
| | | | ||||||
| * | | Merge #339 | bors[bot] | 2018-12-27 | 14 | -376/+354 | |
| |\ \ | | | | | | | | | | | | | | | | | | | | | | 339: Fix assertion error for literals with suffixes r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]> | |||||
| | * | | fix suffix ranges | Aleksey Kladov | 2018-12-27 | 6 | -4/+95 | |
| | | | | ||||||
| | * | | dump validation errors | Aleksey Kladov | 2018-12-27 | 1 | -2/+5 | |
| | | | | ||||||
| | * | | support literal suffixes | Aleksey Kladov | 2018-12-27 | 7 | -2/+40 | |
| | | | | ||||||
| | * | | dedupe literal parsers | Aleksey Kladov | 2018-12-27 | 10 | -374/+220 | |
| |/ / | ||||||
| * | | Merge #337 | bors[bot] | 2018-12-27 | 2 | -34/+30 | |
| |\ \ | | | | | | | | | | | | | | | | | | | | | | 337: check edits in diagnostics r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]> | |||||
| | * | | check edits in diagnostics | Aleksey Kladov | 2018-12-27 | 2 | -34/+30 | |
| |/ / | ||||||
| * | | Merge #332 | bors[bot] | 2018-12-27 | 30 | -318/+1518 | |
| |\ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | 332: Struct types r=matklad a=flodiebold Infer types for struct fields, and add basic field completions. There's also some code for enums, but I focused on getting structs working. There's still ways to go before this becomes useful: There's no autoderef (or even reference types) and no inference for `self`, for example. Co-authored-by: Florian Diebold <[email protected]> | |||||
| | * | | Resolve field types lazily | Florian Diebold | 2018-12-25 | 7 | -59/+76 | |
| | | | | | | | | | | | | | I.e. not already when getting the HIR for the struct. | |||||
| | * | | Add a hir::TypeRef as an intermediate between ast::TypeRef and ty::Ty | Florian Diebold | 2018-12-25 | 10 | -95/+219 | |
| | | | | ||||||
| | * | | Implement reference / pointer types | Florian Diebold | 2018-12-25 | 7 | -23/+173 | |
| | | | | | | | | | | | | | | | | - parse them - infer types of & and * expressions | |||||
| | * | | Handle structs/enums with missing names a bit better | Florian Diebold | 2018-12-25 | 2 | -20/+22 | |
| | | | | ||||||
| | * | | Determine receiver for completion in a more robust way | Florian Diebold | 2018-12-25 | 2 | -21/+31 | |
| | | | | | | | | | | | | | Also rename a parameter. | |||||
| | * | | Cleanup | Florian Diebold | 2018-12-25 | 1 | -125/+37 | |
| | | | | ||||||
| | * | | Add . to trigger characters | Florian Diebold | 2018-12-25 | 1 | -1/+1 | |
| | | | | ||||||
| | * | | Implement basic completion for fields | Florian Diebold | 2018-12-25 | 10 | -12/+156 | |
| | | | | ||||||
| | * | | Improve parsing of incomplete field accesses in preparation for field completion | Florian Diebold | 2018-12-25 | 3 | -9/+45 | |
| | | | | | | | | | | | | | | | | 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 accesses | Florian Diebold | 2018-12-25 | 5 | -5/+54 | |
| | | | | ||||||
| | * | | Collect field data for structs/enum variants | Florian Diebold | 2018-12-25 | 5 | -12/+87 | |
| | | | | ||||||
| | * | | Add AST definitions for struct/variant fields etc. | Florian Diebold | 2018-12-25 | 3 | -12/+256 | |
| | | | | | | | | | | | | | Fixes #117 | |||||
| | * | | Infer result of struct literals, and recurse into their child expressions | Florian Diebold | 2018-12-25 | 6 | -49/+143 | |
| | | | | ||||||
| | * | | Do name resolution by namespace (types/values) | Florian Diebold | 2018-12-25 | 10 | -84/+212 | |
| | | | | ||||||
| | * | | Add basic HIR and types for structs/enums | Florian Diebold | 2018-12-25 | 9 | -29/+244 | |
| | |/ | ||||||
| * | | Merge #336 | bors[bot] | 2018-12-27 | 5 | -15/+92 | |
| |\ \ | | | | | | | | | | | | | | | | | | | | | | 336: add cancelation module & cancelation backtraces r=matklad a=matklad This is primaraly to debug semengly spurious canceled requests Co-authored-by: Aleksey Kladov <[email protected]> | |||||
| | * | | add cancelation module & cancelation backtraces | Aleksey Kladov | 2018-12-27 | 5 | -15/+92 | |
| |/ / | ||||||
| * | | fix the test | Aleksey Kladov | 2018-12-27 | 1 | -2/+2 | |
| | | | ||||||
| * | | expose make_pub_crate action | Aleksey Kladov | 2018-12-27 | 1 | -0/+1 | |
| | | | ||||||
| * | | Merge #334 | bors[bot] | 2018-12-27 | 3 | -13/+43 | |
| |\ \ | | | | | | | | | | | | | | | | | | | | | | 334: use a::b::{self} should be fixed as use a::b instead of use a::b::self r=matklad a=gfreezy Co-authored-by: gfreezy <[email protected]> | |||||
| | * | | fix use std::{self} | gfreezy | 2018-12-26 | 3 | -13/+43 | |
| | | | | ||||||
| * | | | Merge #333 | bors[bot] | 2018-12-26 | 5 | -61/+68 | |
| |\| | | |/ |/| | | | | | | | | | | | | | | | | | | | | | 333: Fix unnecessary braces r=matklad a=gfreezy  don't know why the underscore line is not covering the whole braces. fix #324 Co-authored-by: gfreezy <[email protected]> | |||||
| | * | fix tests | gfreezy | 2018-12-25 | 1 | -1/+1 | |
| | | | ||||||
| | * | add fix for removing unnecessary braces in use statements | gfreezy | 2018-12-25 | 5 | -61/+68 | |
| |/ | ||||||
| * | Merge #331 | bors[bot] | 2018-12-25 | 1 | -1/+1 | |
| |\ | | | | | | | | | | | | | | | 331: Cancelled is not Copy r=matklad a=matklad I'd love to have a backtrace in `Cancelled` to be able to debug "completion is always cancelled" problem. So it probably is a good idea to make `Cancelled` non Copy type, even if it is a ZST in prod. Co-authored-by: Aleksey Kladov <[email protected]> | |||||
| | * | cancelled is not Copy | Aleksey Kladov | 2018-12-25 | 1 | -1/+1 | |
| |/ | ||||||
| * | Merge #328 | bors[bot] | 2018-12-24 | 1 | -3/+1 | |
| |\ | | | | | | | | | | | | | | | 328: fix warning conversion r=matklad a=matklad Co-authored-by: Aleksey Kladov <[email protected]> | |||||
| | * | fix warning conversion | Aleksey Kladov | 2018-12-24 | 1 | -3/+1 | |
| |/ | ||||||
| * | Merge #326 | bors[bot] | 2018-12-24 | 7 | -12/+79 | |
| |\ | | | | | | | | | | | | | | | 326: resolved #324: remove unnecessary braces in use statement. r=matklad a=gfreezy Add inspection for unnecessary braces in use statement Co-authored-by: gfreezy <[email protected]> | |||||
| | * | fix tests | gfreezy | 2018-12-24 | 1 | -1/+1 | |
| | | | ||||||
 |
index : rust-analyzer | |
| [FORK] modified to work on wasm targets |
| aboutsummaryrefslogtreecommitdiff |