-
Notifications
You must be signed in to change notification settings - Fork 12.7k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Auto merge of #17985 - riverbl:explicit-enum-discriminant, r=Veykril
Add explicit enum discriminant assist Add assist for adding explicit discriminants to all variants of an enum. Closes #17798.
- Loading branch information
Showing
4 changed files
with
258 additions
and
3 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
206 changes: 206 additions & 0 deletions
206
src/tools/rust-analyzer/crates/ide-assists/src/handlers/explicit_enum_discriminant.rs
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,206 @@ | ||
use hir::Semantics; | ||
use ide_db::{ | ||
assists::{AssistId, AssistKind}, | ||
source_change::SourceChangeBuilder, | ||
RootDatabase, | ||
}; | ||
use syntax::{ast, AstNode}; | ||
|
||
use crate::{AssistContext, Assists}; | ||
|
||
// Assist: explicit_enum_discriminant | ||
// | ||
// Adds explicit discriminant to all enum variants. | ||
// | ||
// ``` | ||
// enum TheEnum$0 { | ||
// Foo, | ||
// Bar, | ||
// Baz = 42, | ||
// Quux, | ||
// } | ||
// ``` | ||
// -> | ||
// ``` | ||
// enum TheEnum { | ||
// Foo = 0, | ||
// Bar = 1, | ||
// Baz = 42, | ||
// Quux = 43, | ||
// } | ||
// ``` | ||
pub(crate) fn explicit_enum_discriminant(acc: &mut Assists, ctx: &AssistContext<'_>) -> Option<()> { | ||
let enum_node = ctx.find_node_at_offset::<ast::Enum>()?; | ||
let enum_def = ctx.sema.to_def(&enum_node)?; | ||
|
||
let is_data_carrying = enum_def.is_data_carrying(ctx.db()); | ||
let has_primitive_repr = enum_def.repr(ctx.db()).and_then(|repr| repr.int).is_some(); | ||
|
||
// Data carrying enums without a primitive repr have no stable discriminants. | ||
if is_data_carrying && !has_primitive_repr { | ||
return None; | ||
} | ||
|
||
let variant_list = enum_node.variant_list()?; | ||
|
||
// Don't offer the assist if the enum has no variants or if all variants already have an | ||
// explicit discriminant. | ||
if variant_list.variants().all(|variant_node| variant_node.expr().is_some()) { | ||
return None; | ||
} | ||
|
||
acc.add( | ||
AssistId("explicit_enum_discriminant", AssistKind::RefactorRewrite), | ||
"Add explicit enum discriminants", | ||
enum_node.syntax().text_range(), | ||
|builder| { | ||
for variant_node in variant_list.variants() { | ||
add_variant_discriminant(&ctx.sema, builder, &variant_node); | ||
} | ||
}, | ||
); | ||
|
||
Some(()) | ||
} | ||
|
||
fn add_variant_discriminant( | ||
sema: &Semantics<'_, RootDatabase>, | ||
builder: &mut SourceChangeBuilder, | ||
variant_node: &ast::Variant, | ||
) { | ||
if variant_node.expr().is_some() { | ||
return; | ||
} | ||
|
||
let Some(variant_def) = sema.to_def(variant_node) else { | ||
return; | ||
}; | ||
let Ok(discriminant) = variant_def.eval(sema.db) else { | ||
return; | ||
}; | ||
|
||
let variant_range = variant_node.syntax().text_range(); | ||
|
||
builder.insert(variant_range.end(), format!(" = {discriminant}")); | ||
} | ||
|
||
#[cfg(test)] | ||
mod tests { | ||
use crate::tests::{check_assist, check_assist_not_applicable}; | ||
|
||
use super::explicit_enum_discriminant; | ||
|
||
#[test] | ||
fn non_primitive_repr_non_data_bearing_add_discriminant() { | ||
check_assist( | ||
explicit_enum_discriminant, | ||
r#" | ||
enum TheEnum$0 { | ||
Foo, | ||
Bar, | ||
Baz = 42, | ||
Quux, | ||
FooBar = -5, | ||
FooBaz, | ||
} | ||
"#, | ||
r#" | ||
enum TheEnum { | ||
Foo = 0, | ||
Bar = 1, | ||
Baz = 42, | ||
Quux = 43, | ||
FooBar = -5, | ||
FooBaz = -4, | ||
} | ||
"#, | ||
); | ||
} | ||
|
||
#[test] | ||
fn primitive_repr_data_bearing_add_discriminant() { | ||
check_assist( | ||
explicit_enum_discriminant, | ||
r#" | ||
#[repr(u8)] | ||
$0enum TheEnum { | ||
Foo { x: u32 }, | ||
Bar, | ||
Baz(String), | ||
Quux, | ||
} | ||
"#, | ||
r#" | ||
#[repr(u8)] | ||
enum TheEnum { | ||
Foo { x: u32 } = 0, | ||
Bar = 1, | ||
Baz(String) = 2, | ||
Quux = 3, | ||
} | ||
"#, | ||
); | ||
} | ||
|
||
#[test] | ||
fn non_primitive_repr_data_bearing_not_applicable() { | ||
check_assist_not_applicable( | ||
explicit_enum_discriminant, | ||
r#" | ||
enum TheEnum$0 { | ||
Foo, | ||
Bar(u16), | ||
Baz, | ||
} | ||
"#, | ||
); | ||
} | ||
|
||
#[test] | ||
fn primitive_repr_non_data_bearing_add_discriminant() { | ||
check_assist( | ||
explicit_enum_discriminant, | ||
r#" | ||
#[repr(i64)] | ||
enum TheEnum { | ||
Foo = 1 << 63, | ||
Bar, | ||
Baz$0 = 0x7fff_ffff_ffff_fffe, | ||
Quux, | ||
} | ||
"#, | ||
r#" | ||
#[repr(i64)] | ||
enum TheEnum { | ||
Foo = 1 << 63, | ||
Bar = -9223372036854775807, | ||
Baz = 0x7fff_ffff_ffff_fffe, | ||
Quux = 9223372036854775807, | ||
} | ||
"#, | ||
); | ||
} | ||
|
||
#[test] | ||
fn discriminants_already_explicit_not_applicable() { | ||
check_assist_not_applicable( | ||
explicit_enum_discriminant, | ||
r#" | ||
enum TheEnum$0 { | ||
Foo = 0, | ||
Bar = 4, | ||
} | ||
"#, | ||
); | ||
} | ||
|
||
#[test] | ||
fn empty_enum_not_applicable() { | ||
check_assist_not_applicable( | ||
explicit_enum_discriminant, | ||
r#" | ||
enum TheEnum$0 {} | ||
"#, | ||
); | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters