language-servers/rust-analyzer
1
0
Fork 0
mirror of https://github.com/rust-lang/rust-analyzer.git synced 2025-09-28 04:44:57 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 2

Spelling

Browse source 
* a rule
* access
* after
* amount
* annotations
* assignment
* assist
* associated
* attribute
* borrowed
* built-in type
* clarification
* command
* const
* constructor
* corresponding
* counterparts
* curlies
* dependencies
* deterministic
* diagnostic
* duplicates
* edge
* edited
* efficient
* elsewhere
* execution
* expression
* extensions
* extracted
* fill
* github
* helper
* heuristic
* incomplete
* indent end
* inlay
* invocation
* lifetime
* looking
* maybe
* move
* mutability
* mutable
* necessarily
* necessary
* negative
* nonexistent
* occurred
* offsets
* offsetted
* overridden
* parameters
* params
* params_and_where_preds_in_scope
* paredit
* parent
* parentheses
* prepended if
* punctuation
* receive
* receiver
* referring
* repeated
* representing
* semantically
* separately
* shouldnot
* siblings
* similar
* something's
* statement
* struct
* structure
* surprise
* the
* this
* transparent
* unimplemented
* unnamed
* unnecessary
* unneeded
* unreachable
* unterminated
* utilities
* variant
* variants
* visibility
* work around (v)
* workaround

Signed-off-by: Josh Soref <2119212+jsoref@users.noreply.github.com>
This commit is contained in:
Josh Soref 2023-04-13 18:35:00 -04:00
parent 2c251a7e2b
commit bc7d84c3ce
83 changed files with 137 additions and 136 deletions
Download patch file Download diff file Expand all files Collapse all files

10
crates/ide-assists/src/handlers/generate_function.rs
View file

@ -893,14 +893,14 @@ fn filter_bounds_in_scope(
let target_impl = target.parent().ancestors().find_map(ast::Impl::cast)?;
let target_impl = ctx.sema.to_def(&target_impl)?;
// It's sufficient to test only the first element of `generic_params` because of the order of
// insertion (see `relevant_parmas_and_where_clauses()`).
// insertion (see `params_and_where_preds_in_scope()`).
let def = generic_params.first()?.self_ty_param.parent();
if def != hir::GenericDef::Impl(target_impl) {
return None;
}
// Now we know every element that belongs to an impl would be in scope at `target`, we can
// filter them out just by lookint at their parent.
// filter them out just by looking at their parent.
generic_params.retain(|it| !matches!(it.self_ty_param.parent(), hir::GenericDef::Impl(_)));
where_preds.retain(|it| {
it.node.syntax().parent().and_then(|it| it.parent()).and_then(ast::Impl::cast).is_none()
@ -1087,7 +1087,7 @@ fn calculate_necessary_visibility(
}
}
// This is never intended to be used as a generic graph strucuture. If there's ever another need of
// This is never intended to be used as a generic graph structure. If there's ever another need of
// graph algorithm, consider adding a library for that (and replace the following).
/// Minimally implemented directed graph structure represented by adjacency list.
struct Graph {
@ -2380,7 +2380,7 @@ mod s {
}
#[test]
fn create_method_with_cursor_anywhere_on_call_expresion() {
fn create_method_with_cursor_anywhere_on_call_expression() {
check_assist(
generate_function,
r"
@ -2487,7 +2487,7 @@ fn foo() {s::S::bar();}
}
#[test]
fn create_static_method_with_cursor_anywhere_on_call_expresion() {
fn create_static_method_with_cursor_anywhere_on_call_expression() {
check_assist(
generate_function,
r"