1 use std::iter::{self, Peekable};
4 use hir::{Adt, Crate, HasAttrs, HasSource, ModuleDef, Semantics};
5 use ide_db::RootDatabase;
6 use ide_db::{famous_defs::FamousDefs, helpers::mod_path_to_ast};
7 use itertools::Itertools;
8 use syntax::ast::{self, make, AstNode, HasName, MatchArmList, MatchExpr, Pat};
11 utils::{self, render_snippet, Cursor},
12 AssistContext, AssistId, AssistKind, Assists,
15 // Assist: add_missing_match_arms
17 // Adds missing clauses to a `match` expression.
20 // enum Action { Move { distance: u32 }, Stop }
22 // fn handle(action: Action) {
30 // enum Action { Move { distance: u32 }, Stop }
32 // fn handle(action: Action) {
34 // $0Action::Move { distance } => todo!(),
35 // Action::Stop => todo!(),
39 pub(crate) fn add_missing_match_arms(acc: &mut Assists, ctx: &AssistContext) -> Option<()> {
40 let match_expr = ctx.find_node_at_offset_with_descend::<ast::MatchExpr>()?;
41 let match_arm_list = match_expr.match_arm_list()?;
42 let target_range = ctx.sema.original_range(match_expr.syntax()).range;
44 if let None = cursor_at_trivial_match_arm_list(ctx, &match_expr, &match_arm_list) {
45 let arm_list_range = ctx.sema.original_range(match_arm_list.syntax()).range;
46 let cursor_in_range = arm_list_range.contains_range(ctx.selection_trimmed());
48 cov_mark::hit!(not_applicable_outside_of_range_right);
53 let expr = match_expr.expr()?;
55 let mut has_catch_all_arm = false;
57 let top_lvl_pats: Vec<_> = match_arm_list
59 .filter_map(|arm| Some((arm.pat()?, arm.guard().is_some())))
60 .flat_map(|(pat, has_guard)| {
62 // Special case OrPat as separate top-level pats
63 Pat::OrPat(or_pat) => Either::Left(or_pat.pats()),
64 _ => Either::Right(iter::once(pat)),
66 .map(move |pat| (pat, has_guard))
68 .map(|(pat, has_guard)| {
69 has_catch_all_arm |= !has_guard && matches!(pat, Pat::WildcardPat(_));
72 // Exclude top level wildcards so that they are expanded by this assist, retains status quo in #8129.
73 .filter(|pat| !matches!(pat, Pat::WildcardPat(_)))
76 let module = ctx.sema.scope(expr.syntax()).module()?;
77 let (mut missing_pats, is_non_exhaustive): (
78 Peekable<Box<dyn Iterator<Item = (ast::Pat, bool)>>>,
80 ) = if let Some(enum_def) = resolve_enum_def(&ctx.sema, &expr) {
81 let is_non_exhaustive = enum_def.is_non_exhaustive(ctx.db(), module.krate());
83 let variants = enum_def.variants(ctx.db());
85 let missing_pats = variants
87 .filter_map(|variant| {
89 build_pat(ctx.db(), module, variant)?,
90 variant.should_be_hidden(ctx.db(), module.krate()),
93 .filter(|(variant_pat, _)| is_variant_missing(&top_lvl_pats, variant_pat));
96 FamousDefs(&ctx.sema, Some(module.krate())).core_option_Option().map(lift_enum);
97 let missing_pats: Box<dyn Iterator<Item = _>> = if Some(enum_def) == option_enum {
98 // Match `Some` variant first.
99 cov_mark::hit!(option_order);
100 Box::new(missing_pats.rev())
102 Box::new(missing_pats)
104 (missing_pats.peekable(), is_non_exhaustive)
105 } else if let Some(enum_defs) = resolve_tuple_of_enum_def(&ctx.sema, &expr) {
106 let is_non_exhaustive =
107 enum_defs.iter().any(|enum_def| enum_def.is_non_exhaustive(ctx.db(), module.krate()));
110 let variants_of_enums: Vec<Vec<ExtendedVariant>> = enum_defs
112 .map(|enum_def| enum_def.variants(ctx.db()))
113 .inspect(|variants| n_arms *= variants.len())
116 // When calculating the match arms for a tuple of enums, we want
117 // to create a match arm for each possible combination of enum
118 // values. The `multi_cartesian_product` method transforms
119 // Vec<Vec<EnumVariant>> into Vec<(EnumVariant, .., EnumVariant)>
120 // where each tuple represents a proposed match arm.
122 // A number of arms grows very fast on even a small tuple of large enums.
123 // We skip the assist beyond an arbitrary threshold.
127 let missing_pats = variants_of_enums
129 .multi_cartesian_product()
130 .inspect(|_| cov_mark::hit!(add_missing_match_arms_lazy_computation))
132 let is_hidden = variants
134 .any(|variant| variant.should_be_hidden(ctx.db(), module.krate()));
136 variants.into_iter().filter_map(|variant| build_pat(ctx.db(), module, variant));
138 (ast::Pat::from(make::tuple_pat(patterns)), is_hidden)
140 .filter(|(variant_pat, _)| is_variant_missing(&top_lvl_pats, variant_pat));
141 ((Box::new(missing_pats) as Box<dyn Iterator<Item = _>>).peekable(), is_non_exhaustive)
146 let mut needs_catch_all_arm = is_non_exhaustive && !has_catch_all_arm;
148 if !needs_catch_all_arm && missing_pats.peek().is_none() {
153 AssistId("add_missing_match_arms", AssistKind::QuickFix),
157 let new_match_arm_list = match_arm_list.clone_for_update();
158 let missing_arms = missing_pats
159 .map(|(pat, hidden)| {
160 (make::match_arm(iter::once(pat), None, make::ext::expr_todo()), hidden)
162 .map(|(it, hidden)| (it.clone_for_update(), hidden));
164 let catch_all_arm = new_match_arm_list
166 .find(|arm| matches!(arm.pat(), Some(ast::Pat::WildcardPat(_))));
167 if let Some(arm) = catch_all_arm {
168 let is_empty_expr = arm.expr().map_or(true, |e| match e {
169 ast::Expr::BlockExpr(b) => {
170 b.statements().next().is_none() && b.tail_expr().is_none()
172 ast::Expr::TupleExpr(t) => t.fields().next().is_none(),
178 cov_mark::hit!(add_missing_match_arms_empty_expr);
181 let mut first_new_arm = None;
182 for (arm, hidden) in missing_arms {
184 needs_catch_all_arm = !has_catch_all_arm;
186 first_new_arm.get_or_insert_with(|| arm.clone());
187 new_match_arm_list.add_arm(arm);
190 if needs_catch_all_arm && !has_catch_all_arm {
191 cov_mark::hit!(added_wildcard_pattern);
192 let arm = make::match_arm(
193 iter::once(make::wildcard_pat().into()),
195 make::ext::expr_todo(),
198 first_new_arm.get_or_insert_with(|| arm.clone());
199 new_match_arm_list.add_arm(arm);
202 let old_range = ctx.sema.original_range(match_arm_list.syntax()).range;
203 match (first_new_arm, ctx.config.snippet_cap) {
204 (Some(first_new_arm), Some(cap)) => {
207 match first_new_arm.syntax().descendants().find_map(ast::WildcardPat::cast)
210 extend_lifetime = it.syntax().clone();
211 Cursor::Replace(&extend_lifetime)
213 None => Cursor::Before(first_new_arm.syntax()),
215 let snippet = render_snippet(cap, new_match_arm_list.syntax(), cursor);
216 builder.replace_snippet(cap, old_range, snippet);
218 _ => builder.replace(old_range, new_match_arm_list.to_string()),
224 fn cursor_at_trivial_match_arm_list(
226 match_expr: &MatchExpr,
227 match_arm_list: &MatchArmList,
230 if match_arm_list.arms().next() == None {
231 cov_mark::hit!(add_missing_match_arms_empty_body);
239 if let Some(last_arm) = match_arm_list.arms().last() {
240 let last_arm_range = last_arm.syntax().text_range();
241 let match_expr_range = match_expr.syntax().text_range();
242 if last_arm_range.end() <= ctx.offset() && ctx.offset() < match_expr_range.end() {
243 cov_mark::hit!(add_missing_match_arms_end_of_last_arm);
248 // match { _$0 => {...} }
249 let wild_pat = ctx.find_node_at_offset_with_descend::<ast::WildcardPat>()?;
250 let arm = wild_pat.syntax().parent().and_then(ast::MatchArm::cast)?;
251 let arm_match_expr = arm.syntax().ancestors().nth(2).and_then(ast::MatchExpr::cast)?;
252 if arm_match_expr == *match_expr {
253 cov_mark::hit!(add_missing_match_arms_trivial_arm);
260 fn is_variant_missing(existing_pats: &[Pat], var: &Pat) -> bool {
261 !existing_pats.iter().any(|pat| does_pat_match_variant(pat, var))
264 // Fixme: this is still somewhat limited, use hir_ty::diagnostics::match_check?
265 fn does_pat_match_variant(pat: &Pat, var: &Pat) -> bool {
267 (Pat::WildcardPat(_), _) => true,
268 (Pat::TuplePat(tpat), Pat::TuplePat(tvar)) => {
269 tpat.fields().zip(tvar.fields()).all(|(p, v)| does_pat_match_variant(&p, &v))
271 _ => utils::does_pat_match_variant(pat, var),
275 #[derive(Eq, PartialEq, Clone, Copy)]
281 #[derive(Eq, PartialEq, Clone, Copy)]
282 enum ExtendedVariant {
285 Variant(hir::Variant),
288 impl ExtendedVariant {
289 fn should_be_hidden(self, db: &RootDatabase, krate: Crate) -> bool {
291 ExtendedVariant::Variant(var) => {
292 var.attrs(db).has_doc_hidden() && var.module(db).krate() != krate
299 fn lift_enum(e: hir::Enum) -> ExtendedEnum {
300 ExtendedEnum::Enum(e)
304 fn is_non_exhaustive(self, db: &RootDatabase, krate: Crate) -> bool {
306 ExtendedEnum::Enum(e) => e.attrs(db).by_key("non_exhaustive").exists() && e.module(db).krate() != krate,
311 fn variants(self, db: &RootDatabase) -> Vec<ExtendedVariant> {
313 ExtendedEnum::Enum(e) => {
314 e.variants(db).into_iter().map(ExtendedVariant::Variant).collect::<Vec<_>>()
316 ExtendedEnum::Bool => {
317 Vec::<ExtendedVariant>::from([ExtendedVariant::True, ExtendedVariant::False])
323 fn resolve_enum_def(sema: &Semantics<RootDatabase>, expr: &ast::Expr) -> Option<ExtendedEnum> {
324 sema.type_of_expr(expr)?.adjusted().autoderef(sema.db).find_map(|ty| match ty.as_adt() {
325 Some(Adt::Enum(e)) => Some(ExtendedEnum::Enum(e)),
326 _ => ty.is_bool().then(|| ExtendedEnum::Bool),
330 fn resolve_tuple_of_enum_def(
331 sema: &Semantics<RootDatabase>,
333 ) -> Option<Vec<ExtendedEnum>> {
334 sema.type_of_expr(expr)?
336 .tuple_fields(sema.db)
339 ty.autoderef(sema.db).find_map(|ty| match ty.as_adt() {
340 Some(Adt::Enum(e)) => Some(lift_enum(e)),
341 // For now we only handle expansion for a tuple of enums. Here
342 // we map non-enum items to None and rely on `collect` to
343 // convert Vec<Option<hir::Enum>> into Option<Vec<hir::Enum>>.
344 _ => ty.is_bool().then(|| ExtendedEnum::Bool),
350 fn build_pat(db: &RootDatabase, module: hir::Module, var: ExtendedVariant) -> Option<ast::Pat> {
352 ExtendedVariant::Variant(var) => {
353 let path = mod_path_to_ast(&module.find_use_path(db, ModuleDef::from(var))?);
355 // FIXME: use HIR for this; it doesn't currently expose struct vs. tuple vs. unit variants though
356 let pat: ast::Pat = match var.source(db)?.value.kind() {
357 ast::StructKind::Tuple(field_list) => {
359 iter::repeat(make::wildcard_pat().into()).take(field_list.fields().count());
360 make::tuple_struct_pat(path, pats).into()
362 ast::StructKind::Record(field_list) => {
363 let pats = field_list
365 .map(|f| make::ext::simple_ident_pat(f.name().unwrap()).into());
366 make::record_pat(path, pats).into()
368 ast::StructKind::Unit => make::path_pat(path),
373 ExtendedVariant::True => Some(ast::Pat::from(make::literal_pat("true"))),
374 ExtendedVariant::False => Some(ast::Pat::from(make::literal_pat("false"))),
381 check_assist, check_assist_not_applicable, check_assist_target, check_assist_unresolved,
384 use super::add_missing_match_arms;
387 fn all_match_arms_provided() {
388 check_assist_not_applicable(
389 add_missing_match_arms,
393 Bs{x:i32, y:Option<i32>},
394 Cs(i32, Option<i32>),
399 A::Bs{x,y:Some(_)} => {}
400 A::Cs(_, Some(_)) => {}
408 fn not_applicable_outside_of_range_left() {
409 check_assist_not_applicable(
410 add_missing_match_arms,
424 fn not_applicable_outside_of_range_right() {
425 cov_mark::check!(not_applicable_outside_of_range_right);
426 check_assist_not_applicable(
427 add_missing_match_arms,
441 fn all_boolean_match_arms_provided() {
442 check_assist_not_applicable(
443 add_missing_match_arms,
456 fn tuple_of_non_enum() {
457 // for now this case is not handled, although it potentially could be
459 check_assist_not_applicable(
460 add_missing_match_arms,
471 fn add_missing_match_arms_boolean() {
473 add_missing_match_arms,
492 fn partial_fill_boolean() {
494 add_missing_match_arms,
514 fn all_boolean_tuple_arms_provided() {
515 check_assist_not_applicable(
516 add_missing_match_arms,
531 fn fill_boolean_tuple() {
533 add_missing_match_arms,
543 $0(true, true) => todo!(),
544 (true, false) => todo!(),
545 (false, true) => todo!(),
546 (false, false) => todo!(),
554 fn partial_fill_boolean_tuple() {
556 add_missing_match_arms,
568 $0(true, true) => todo!(),
569 (true, false) => todo!(),
570 (false, false) => todo!(),
578 fn partial_fill_record_tuple() {
580 add_missing_match_arms,
584 Bs { x: i32, y: Option<i32> },
585 Cs(i32, Option<i32>),
589 A::Bs { x, y: Some(_) } => {}
590 A::Cs(_, Some(_)) => {}
597 Bs { x: i32, y: Option<i32> },
598 Cs(i32, Option<i32>),
602 A::Bs { x, y: Some(_) } => {}
603 A::Cs(_, Some(_)) => {}
612 fn partial_fill_option() {
614 add_missing_match_arms,
627 Some(${0:_}) => todo!(),
635 fn partial_fill_or_pat() {
637 add_missing_match_arms,
639 enum A { As, Bs, Cs(Option<i32>) }
642 A::Cs(_) | A::Bs => {}
647 enum A { As, Bs, Cs(Option<i32>) }
650 A::Cs(_) | A::Bs => {}
661 add_missing_match_arms,
663 enum A { As, Bs, Cs, Ds(String), Es(B) }
668 A::Ds(_value) => { let x = 1; }
674 enum A { As, Bs, Cs, Ds(String), Es(B) }
679 A::Ds(_value) => { let x = 1; }
690 fn partial_fill_bind_pat() {
692 add_missing_match_arms,
694 enum A { As, Bs, Cs(Option<i32>) }
703 enum A { As, Bs, Cs(Option<i32>) }
708 A::Cs(${0:_}) => todo!(),
716 fn add_missing_match_arms_empty_body() {
717 cov_mark::check!(add_missing_match_arms_empty_body);
719 add_missing_match_arms,
721 enum A { As, Bs, Cs(String), Ds(String, String), Es { x: usize, y: usize } }
729 enum A { As, Bs, Cs(String), Ds(String, String), Es { x: usize, y: usize } }
737 A::Ds(_, _) => todo!(),
738 A::Es { x, y } => todo!(),
746 fn add_missing_match_arms_end_of_last_arm() {
747 cov_mark::check!(add_missing_match_arms_end_of_last_arm);
749 add_missing_match_arms,
758 (A::Two, B::One) => {},$0
770 (A::Two, B::One) => {},
771 $0(A::One, B::One) => todo!(),
772 (A::One, B::Two) => todo!(),
773 (A::Two, B::Two) => todo!(),
781 fn add_missing_match_arms_tuple_of_enum() {
783 add_missing_match_arms,
802 $0(A::One, B::One) => todo!(),
803 (A::One, B::Two) => todo!(),
804 (A::Two, B::One) => todo!(),
805 (A::Two, B::Two) => todo!(),
813 fn add_missing_match_arms_tuple_of_enum_ref() {
815 add_missing_match_arms,
834 $0(A::One, B::One) => todo!(),
835 (A::One, B::Two) => todo!(),
836 (A::Two, B::One) => todo!(),
837 (A::Two, B::Two) => todo!(),
845 fn add_missing_match_arms_tuple_of_enum_partial() {
847 add_missing_match_arms,
856 (A::Two, B::One) => {}
868 (A::Two, B::One) => {}
869 $0(A::One, B::One) => todo!(),
870 (A::One, B::Two) => todo!(),
871 (A::Two, B::Two) => todo!(),
879 fn add_missing_match_arms_tuple_of_enum_partial_with_wildcards() {
881 add_missing_match_arms,
889 (None, Some(_)) => {}
899 (None, Some(_)) => {}
900 $0(None, None) => todo!(),
908 fn add_missing_match_arms_partial_with_deep_pattern() {
909 // Fixme: cannot handle deep patterns
910 check_assist_not_applicable(
911 add_missing_match_arms,
925 fn add_missing_match_arms_tuple_of_enum_not_applicable() {
926 check_assist_not_applicable(
927 add_missing_match_arms,
936 (A::Two, B::One) => {}
937 (A::One, B::One) => {}
938 (A::One, B::Two) => {}
939 (A::Two, B::Two) => {}
947 fn add_missing_match_arms_single_element_tuple_of_enum() {
949 add_missing_match_arms,
965 $0(A::One,) => todo!(),
966 (A::Two,) => todo!(),
974 fn test_fill_match_arm_refs() {
976 add_missing_match_arms,
997 add_missing_match_arms,
1000 Es { x: usize, y: usize }
1010 Es { x: usize, y: usize }
1015 $0A::Es { x, y } => todo!(),
1023 fn add_missing_match_arms_target_simple() {
1024 check_assist_target(
1025 add_missing_match_arms,
1038 fn add_missing_match_arms_target_complex() {
1039 check_assist_target(
1040 add_missing_match_arms,
1057 fn add_missing_match_arms_trivial_arm() {
1058 cov_mark::check!(add_missing_match_arms_trivial_arm);
1060 add_missing_match_arms,
1084 fn wildcard_inside_expression_not_applicable() {
1085 check_assist_not_applicable(
1086 add_missing_match_arms,
1103 fn add_missing_match_arms_qualifies_path() {
1105 add_missing_match_arms,
1107 mod foo { pub enum E { X, Y } }
1117 mod foo { pub enum E { X, Y } }
1123 foo::E::Y => todo!(),
1131 fn add_missing_match_arms_preserves_comments() {
1133 add_missing_match_arms,
1140 // This is where the rest should be
1150 $0A::Two => todo!(),
1151 // This is where the rest should be
1159 fn add_missing_match_arms_preserves_comments_empty() {
1161 add_missing_match_arms,
1174 $0A::One => todo!(),
1184 fn add_missing_match_arms_placeholder() {
1186 add_missing_match_arms,
1188 enum A { One, Two, }
1196 enum A { One, Two, }
1199 $0A::One => todo!(),
1209 cov_mark::check!(option_order);
1211 add_missing_match_arms,
1213 //- minicore: option
1214 fn foo(opt: Option<i32>) {
1220 fn foo(opt: Option<i32>) {
1222 Some(${0:_}) => todo!(),
1231 fn works_inside_macro_call() {
1233 add_missing_match_arms,
1235 macro_rules! m { ($expr:expr) => {$expr}}
1246 macro_rules! m { ($expr:expr) => {$expr}}
1255 $0Test::A => todo!(),
1264 fn lazy_computation() {
1265 // Computing a single missing arm is enough to determine applicability of the assist.
1266 cov_mark::check_count!(add_missing_match_arms_lazy_computation, 1);
1267 check_assist_unresolved(
1268 add_missing_match_arms,
1270 enum A { One, Two, }
1271 fn foo(tuple: (A, A)) {
1279 fn adds_comma_before_new_arms() {
1281 add_missing_match_arms,
1299 fn does_not_add_extra_comma() {
1301 add_missing_match_arms,
1319 fn does_not_remove_catch_all_with_non_empty_expr() {
1320 cov_mark::check!(add_missing_match_arms_empty_expr);
1322 add_missing_match_arms,
1341 fn does_not_fill_hidden_variants() {
1342 cov_mark::check!(added_wildcard_pattern);
1344 add_missing_match_arms,
1346 //- /main.rs crate:main deps:e
1352 pub enum E { A, #[doc(hidden)] B, }
1357 $0e::E::A => todo!(),
1366 fn does_not_fill_hidden_variants_tuple() {
1367 cov_mark::check!(added_wildcard_pattern);
1369 add_missing_match_arms,
1371 //- /main.rs crate:main deps:e
1372 fn foo(t: (bool, ::e::E)) {
1377 pub enum E { A, #[doc(hidden)] B, }
1380 fn foo(t: (bool, ::e::E)) {
1382 $0(true, e::E::A) => todo!(),
1383 (false, e::E::A) => todo!(),
1392 fn fills_wildcard_with_only_hidden_variants() {
1393 cov_mark::check!(added_wildcard_pattern);
1395 add_missing_match_arms,
1397 //- /main.rs crate:main deps:e
1403 pub enum E { #[doc(hidden)] A, }
1416 fn does_not_fill_wildcard_when_hidden_variants_are_explicit() {
1417 check_assist_not_applicable(
1418 add_missing_match_arms,
1420 //- /main.rs crate:main deps:e
1427 pub enum E { #[doc(hidden)] A, }
1432 // FIXME: I don't think the assist should be applicable in this case
1434 fn does_not_fill_wildcard_with_wildcard() {
1436 add_missing_match_arms,
1438 //- /main.rs crate:main deps:e
1445 pub enum E { #[doc(hidden)] A, }
1458 fn fills_wildcard_on_non_exhaustive_with_explicit_matches() {
1459 cov_mark::check!(added_wildcard_pattern);
1461 add_missing_match_arms,
1463 //- /main.rs crate:main deps:e
1485 fn fills_wildcard_on_non_exhaustive_without_matches() {
1486 cov_mark::check!(added_wildcard_pattern);
1488 add_missing_match_arms,
1490 //- /main.rs crate:main deps:e
1502 $0e::E::A => todo!(),
1511 fn fills_wildcard_on_non_exhaustive_with_doc_hidden() {
1512 cov_mark::check!(added_wildcard_pattern);
1514 add_missing_match_arms,
1516 //- /main.rs crate:main deps:e
1523 pub enum E { A, #[doc(hidden)] B }"#,
1527 $0e::E::A => todo!(),
1536 fn fills_wildcard_on_non_exhaustive_with_doc_hidden_with_explicit_arms() {
1537 cov_mark::check!(added_wildcard_pattern);
1539 add_missing_match_arms,
1541 //- /main.rs crate:main deps:e
1549 pub enum E { A, #[doc(hidden)] B }"#,
1562 fn fill_wildcard_with_partial_wildcard() {
1563 cov_mark::check!(added_wildcard_pattern);
1565 add_missing_match_arms,
1567 //- /main.rs crate:main deps:e
1568 fn foo(t: ::e::E, b: bool) {
1574 pub enum E { #[doc(hidden)] A, }"#,
1576 fn foo(t: ::e::E, b: bool) {
1587 fn does_not_fill_wildcard_with_partial_wildcard_and_wildcard() {
1589 add_missing_match_arms,
1591 //- /main.rs crate:main deps:e
1592 fn foo(t: ::e::E, b: bool) {
1599 pub enum E { #[doc(hidden)] A, }"#,
1601 fn foo(t: ::e::E, b: bool) {
1612 fn non_exhaustive_doc_hidden_tuple_fills_wildcard() {
1613 cov_mark::check!(added_wildcard_pattern);
1615 add_missing_match_arms,
1617 //- /main.rs crate:main deps:e
1624 pub enum E { A, #[doc(hidden)] B, }"#,
1628 $0e::E::A => todo!(),
1637 fn ignores_doc_hidden_for_crate_local_enums() {
1639 add_missing_match_arms,
1641 enum E { A, #[doc(hidden)] B, }
1648 enum E { A, #[doc(hidden)] B, }
1660 fn ignores_non_exhaustive_for_crate_local_enums() {
1662 add_missing_match_arms,
1685 fn ignores_doc_hidden_and_non_exhaustive_for_crate_local_enums() {
1687 add_missing_match_arms,
1690 enum E { A, #[doc(hidden)] B, }
1698 enum E { A, #[doc(hidden)] B, }