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) => {
307 e.attrs(db).by_key("non_exhaustive").exists() && e.module(db).krate() != krate
313 fn variants(self, db: &RootDatabase) -> Vec<ExtendedVariant> {
315 ExtendedEnum::Enum(e) => {
316 e.variants(db).into_iter().map(ExtendedVariant::Variant).collect::<Vec<_>>()
318 ExtendedEnum::Bool => {
319 Vec::<ExtendedVariant>::from([ExtendedVariant::True, ExtendedVariant::False])
325 fn resolve_enum_def(sema: &Semantics<RootDatabase>, expr: &ast::Expr) -> Option<ExtendedEnum> {
326 sema.type_of_expr(expr)?.adjusted().autoderef(sema.db).find_map(|ty| match ty.as_adt() {
327 Some(Adt::Enum(e)) => Some(ExtendedEnum::Enum(e)),
328 _ => ty.is_bool().then(|| ExtendedEnum::Bool),
332 fn resolve_tuple_of_enum_def(
333 sema: &Semantics<RootDatabase>,
335 ) -> Option<Vec<ExtendedEnum>> {
336 sema.type_of_expr(expr)?
338 .tuple_fields(sema.db)
341 ty.autoderef(sema.db).find_map(|ty| match ty.as_adt() {
342 Some(Adt::Enum(e)) => Some(lift_enum(e)),
343 // For now we only handle expansion for a tuple of enums. Here
344 // we map non-enum items to None and rely on `collect` to
345 // convert Vec<Option<hir::Enum>> into Option<Vec<hir::Enum>>.
346 _ => ty.is_bool().then(|| ExtendedEnum::Bool),
352 fn build_pat(db: &RootDatabase, module: hir::Module, var: ExtendedVariant) -> Option<ast::Pat> {
354 ExtendedVariant::Variant(var) => {
355 let path = mod_path_to_ast(&module.find_use_path(db, ModuleDef::from(var))?);
357 // FIXME: use HIR for this; it doesn't currently expose struct vs. tuple vs. unit variants though
358 let pat: ast::Pat = match var.source(db)?.value.kind() {
359 ast::StructKind::Tuple(field_list) => {
361 iter::repeat(make::wildcard_pat().into()).take(field_list.fields().count());
362 make::tuple_struct_pat(path, pats).into()
364 ast::StructKind::Record(field_list) => {
365 let pats = field_list
367 .map(|f| make::ext::simple_ident_pat(f.name().unwrap()).into());
368 make::record_pat(path, pats).into()
370 ast::StructKind::Unit => make::path_pat(path),
375 ExtendedVariant::True => Some(ast::Pat::from(make::literal_pat("true"))),
376 ExtendedVariant::False => Some(ast::Pat::from(make::literal_pat("false"))),
383 check_assist, check_assist_not_applicable, check_assist_target, check_assist_unresolved,
386 use super::add_missing_match_arms;
389 fn all_match_arms_provided() {
390 check_assist_not_applicable(
391 add_missing_match_arms,
395 Bs{x:i32, y:Option<i32>},
396 Cs(i32, Option<i32>),
401 A::Bs{x,y:Some(_)} => {}
402 A::Cs(_, Some(_)) => {}
410 fn not_applicable_outside_of_range_left() {
411 check_assist_not_applicable(
412 add_missing_match_arms,
426 fn not_applicable_outside_of_range_right() {
427 cov_mark::check!(not_applicable_outside_of_range_right);
428 check_assist_not_applicable(
429 add_missing_match_arms,
443 fn all_boolean_match_arms_provided() {
444 check_assist_not_applicable(
445 add_missing_match_arms,
458 fn tuple_of_non_enum() {
459 // for now this case is not handled, although it potentially could be
461 check_assist_not_applicable(
462 add_missing_match_arms,
473 fn add_missing_match_arms_boolean() {
475 add_missing_match_arms,
494 fn partial_fill_boolean() {
496 add_missing_match_arms,
516 fn all_boolean_tuple_arms_provided() {
517 check_assist_not_applicable(
518 add_missing_match_arms,
533 fn fill_boolean_tuple() {
535 add_missing_match_arms,
545 $0(true, true) => todo!(),
546 (true, false) => todo!(),
547 (false, true) => todo!(),
548 (false, false) => todo!(),
556 fn partial_fill_boolean_tuple() {
558 add_missing_match_arms,
570 $0(true, true) => todo!(),
571 (true, false) => todo!(),
572 (false, false) => todo!(),
580 fn partial_fill_record_tuple() {
582 add_missing_match_arms,
586 Bs { x: i32, y: Option<i32> },
587 Cs(i32, Option<i32>),
591 A::Bs { x, y: Some(_) } => {}
592 A::Cs(_, Some(_)) => {}
599 Bs { x: i32, y: Option<i32> },
600 Cs(i32, Option<i32>),
604 A::Bs { x, y: Some(_) } => {}
605 A::Cs(_, Some(_)) => {}
614 fn partial_fill_option() {
616 add_missing_match_arms,
629 Some(${0:_}) => todo!(),
637 fn partial_fill_or_pat() {
639 add_missing_match_arms,
641 enum A { As, Bs, Cs(Option<i32>) }
644 A::Cs(_) | A::Bs => {}
649 enum A { As, Bs, Cs(Option<i32>) }
652 A::Cs(_) | A::Bs => {}
663 add_missing_match_arms,
665 enum A { As, Bs, Cs, Ds(String), Es(B) }
670 A::Ds(_value) => { let x = 1; }
676 enum A { As, Bs, Cs, Ds(String), Es(B) }
681 A::Ds(_value) => { let x = 1; }
692 fn partial_fill_bind_pat() {
694 add_missing_match_arms,
696 enum A { As, Bs, Cs(Option<i32>) }
705 enum A { As, Bs, Cs(Option<i32>) }
710 A::Cs(${0:_}) => todo!(),
718 fn add_missing_match_arms_empty_body() {
719 cov_mark::check!(add_missing_match_arms_empty_body);
721 add_missing_match_arms,
723 enum A { As, Bs, Cs(String), Ds(String, String), Es { x: usize, y: usize } }
731 enum A { As, Bs, Cs(String), Ds(String, String), Es { x: usize, y: usize } }
739 A::Ds(_, _) => todo!(),
740 A::Es { x, y } => todo!(),
748 fn add_missing_match_arms_end_of_last_arm() {
749 cov_mark::check!(add_missing_match_arms_end_of_last_arm);
751 add_missing_match_arms,
760 (A::Two, B::One) => {},$0
772 (A::Two, B::One) => {},
773 $0(A::One, B::One) => todo!(),
774 (A::One, B::Two) => todo!(),
775 (A::Two, B::Two) => todo!(),
783 fn add_missing_match_arms_tuple_of_enum() {
785 add_missing_match_arms,
804 $0(A::One, B::One) => todo!(),
805 (A::One, B::Two) => todo!(),
806 (A::Two, B::One) => todo!(),
807 (A::Two, B::Two) => todo!(),
815 fn add_missing_match_arms_tuple_of_enum_ref() {
817 add_missing_match_arms,
836 $0(A::One, B::One) => todo!(),
837 (A::One, B::Two) => todo!(),
838 (A::Two, B::One) => todo!(),
839 (A::Two, B::Two) => todo!(),
847 fn add_missing_match_arms_tuple_of_enum_partial() {
849 add_missing_match_arms,
858 (A::Two, B::One) => {}
870 (A::Two, B::One) => {}
871 $0(A::One, B::One) => todo!(),
872 (A::One, B::Two) => todo!(),
873 (A::Two, B::Two) => todo!(),
881 fn add_missing_match_arms_tuple_of_enum_partial_with_wildcards() {
883 add_missing_match_arms,
891 (None, Some(_)) => {}
901 (None, Some(_)) => {}
902 $0(None, None) => todo!(),
910 fn add_missing_match_arms_partial_with_deep_pattern() {
911 // Fixme: cannot handle deep patterns
912 check_assist_not_applicable(
913 add_missing_match_arms,
927 fn add_missing_match_arms_tuple_of_enum_not_applicable() {
928 check_assist_not_applicable(
929 add_missing_match_arms,
938 (A::Two, B::One) => {}
939 (A::One, B::One) => {}
940 (A::One, B::Two) => {}
941 (A::Two, B::Two) => {}
949 fn add_missing_match_arms_single_element_tuple_of_enum() {
951 add_missing_match_arms,
967 $0(A::One,) => todo!(),
968 (A::Two,) => todo!(),
976 fn test_fill_match_arm_refs() {
978 add_missing_match_arms,
999 add_missing_match_arms,
1002 Es { x: usize, y: usize }
1012 Es { x: usize, y: usize }
1017 $0A::Es { x, y } => todo!(),
1025 fn add_missing_match_arms_target_simple() {
1026 check_assist_target(
1027 add_missing_match_arms,
1040 fn add_missing_match_arms_target_complex() {
1041 check_assist_target(
1042 add_missing_match_arms,
1059 fn add_missing_match_arms_trivial_arm() {
1060 cov_mark::check!(add_missing_match_arms_trivial_arm);
1062 add_missing_match_arms,
1086 fn wildcard_inside_expression_not_applicable() {
1087 check_assist_not_applicable(
1088 add_missing_match_arms,
1105 fn add_missing_match_arms_qualifies_path() {
1107 add_missing_match_arms,
1109 mod foo { pub enum E { X, Y } }
1119 mod foo { pub enum E { X, Y } }
1125 foo::E::Y => todo!(),
1133 fn add_missing_match_arms_preserves_comments() {
1135 add_missing_match_arms,
1142 // This is where the rest should be
1152 $0A::Two => todo!(),
1153 // This is where the rest should be
1161 fn add_missing_match_arms_preserves_comments_empty() {
1163 add_missing_match_arms,
1176 $0A::One => todo!(),
1186 fn add_missing_match_arms_placeholder() {
1188 add_missing_match_arms,
1190 enum A { One, Two, }
1198 enum A { One, Two, }
1201 $0A::One => todo!(),
1211 cov_mark::check!(option_order);
1213 add_missing_match_arms,
1215 //- minicore: option
1216 fn foo(opt: Option<i32>) {
1222 fn foo(opt: Option<i32>) {
1224 Some(${0:_}) => todo!(),
1233 fn works_inside_macro_call() {
1235 add_missing_match_arms,
1237 macro_rules! m { ($expr:expr) => {$expr}}
1248 macro_rules! m { ($expr:expr) => {$expr}}
1257 $0Test::A => todo!(),
1266 fn lazy_computation() {
1267 // Computing a single missing arm is enough to determine applicability of the assist.
1268 cov_mark::check_count!(add_missing_match_arms_lazy_computation, 1);
1269 check_assist_unresolved(
1270 add_missing_match_arms,
1272 enum A { One, Two, }
1273 fn foo(tuple: (A, A)) {
1281 fn adds_comma_before_new_arms() {
1283 add_missing_match_arms,
1301 fn does_not_add_extra_comma() {
1303 add_missing_match_arms,
1321 fn does_not_remove_catch_all_with_non_empty_expr() {
1322 cov_mark::check!(add_missing_match_arms_empty_expr);
1324 add_missing_match_arms,
1343 fn does_not_fill_hidden_variants() {
1344 cov_mark::check!(added_wildcard_pattern);
1346 add_missing_match_arms,
1348 //- /main.rs crate:main deps:e
1354 pub enum E { A, #[doc(hidden)] B, }
1359 $0e::E::A => todo!(),
1368 fn does_not_fill_hidden_variants_tuple() {
1369 cov_mark::check!(added_wildcard_pattern);
1371 add_missing_match_arms,
1373 //- /main.rs crate:main deps:e
1374 fn foo(t: (bool, ::e::E)) {
1379 pub enum E { A, #[doc(hidden)] B, }
1382 fn foo(t: (bool, ::e::E)) {
1384 $0(true, e::E::A) => todo!(),
1385 (false, e::E::A) => todo!(),
1394 fn fills_wildcard_with_only_hidden_variants() {
1395 cov_mark::check!(added_wildcard_pattern);
1397 add_missing_match_arms,
1399 //- /main.rs crate:main deps:e
1405 pub enum E { #[doc(hidden)] A, }
1418 fn does_not_fill_wildcard_when_hidden_variants_are_explicit() {
1419 check_assist_not_applicable(
1420 add_missing_match_arms,
1422 //- /main.rs crate:main deps:e
1429 pub enum E { #[doc(hidden)] A, }
1434 // FIXME: I don't think the assist should be applicable in this case
1436 fn does_not_fill_wildcard_with_wildcard() {
1438 add_missing_match_arms,
1440 //- /main.rs crate:main deps:e
1447 pub enum E { #[doc(hidden)] A, }
1460 fn fills_wildcard_on_non_exhaustive_with_explicit_matches() {
1461 cov_mark::check!(added_wildcard_pattern);
1463 add_missing_match_arms,
1465 //- /main.rs crate:main deps:e
1487 fn fills_wildcard_on_non_exhaustive_without_matches() {
1488 cov_mark::check!(added_wildcard_pattern);
1490 add_missing_match_arms,
1492 //- /main.rs crate:main deps:e
1504 $0e::E::A => todo!(),
1513 fn fills_wildcard_on_non_exhaustive_with_doc_hidden() {
1514 cov_mark::check!(added_wildcard_pattern);
1516 add_missing_match_arms,
1518 //- /main.rs crate:main deps:e
1525 pub enum E { A, #[doc(hidden)] B }"#,
1529 $0e::E::A => todo!(),
1538 fn fills_wildcard_on_non_exhaustive_with_doc_hidden_with_explicit_arms() {
1539 cov_mark::check!(added_wildcard_pattern);
1541 add_missing_match_arms,
1543 //- /main.rs crate:main deps:e
1551 pub enum E { A, #[doc(hidden)] B }"#,
1564 fn fill_wildcard_with_partial_wildcard() {
1565 cov_mark::check!(added_wildcard_pattern);
1567 add_missing_match_arms,
1569 //- /main.rs crate:main deps:e
1570 fn foo(t: ::e::E, b: bool) {
1576 pub enum E { #[doc(hidden)] A, }"#,
1578 fn foo(t: ::e::E, b: bool) {
1589 fn does_not_fill_wildcard_with_partial_wildcard_and_wildcard() {
1591 add_missing_match_arms,
1593 //- /main.rs crate:main deps:e
1594 fn foo(t: ::e::E, b: bool) {
1601 pub enum E { #[doc(hidden)] A, }"#,
1603 fn foo(t: ::e::E, b: bool) {
1614 fn non_exhaustive_doc_hidden_tuple_fills_wildcard() {
1615 cov_mark::check!(added_wildcard_pattern);
1617 add_missing_match_arms,
1619 //- /main.rs crate:main deps:e
1626 pub enum E { A, #[doc(hidden)] B, }"#,
1630 $0e::E::A => todo!(),
1639 fn ignores_doc_hidden_for_crate_local_enums() {
1641 add_missing_match_arms,
1643 enum E { A, #[doc(hidden)] B, }
1650 enum E { A, #[doc(hidden)] B, }
1662 fn ignores_non_exhaustive_for_crate_local_enums() {
1664 add_missing_match_arms,
1687 fn ignores_doc_hidden_and_non_exhaustive_for_crate_local_enums() {
1689 add_missing_match_arms,
1692 enum E { A, #[doc(hidden)] B, }
1700 enum E { A, #[doc(hidden)] B, }