mirror of
https://github.com/rust-lang/rust-analyzer
synced 2024-12-26 04:53:34 +00:00
Add or- and parenthesized-patterns
This commit is contained in:
parent
1b9b13b4b4
commit
8c8d0bb34f
15 changed files with 184 additions and 46 deletions
|
@ -75,10 +75,10 @@ pub(crate) fn fill_match_arms(ctx: AssistCtx) -> Option<Assist> {
|
|||
}
|
||||
|
||||
fn is_trivial(arm: &ast::MatchArm) -> bool {
|
||||
arm.pats().any(|pat| match pat {
|
||||
ast::Pat::PlaceholderPat(..) => true,
|
||||
match arm.pat() {
|
||||
Some(ast::Pat::PlaceholderPat(..)) => true,
|
||||
_ => false,
|
||||
})
|
||||
}
|
||||
}
|
||||
|
||||
fn resolve_enum_def(
|
||||
|
|
|
@ -75,7 +75,7 @@ pub(crate) fn merge_match_arms(ctx: AssistCtx) -> Option<Assist> {
|
|||
} else {
|
||||
arms_to_merge
|
||||
.iter()
|
||||
.flat_map(ast::MatchArm::pats)
|
||||
.filter_map(ast::MatchArm::pat)
|
||||
.map(|x| x.syntax().to_string())
|
||||
.collect::<Vec<String>>()
|
||||
.join(" | ")
|
||||
|
@ -96,10 +96,10 @@ pub(crate) fn merge_match_arms(ctx: AssistCtx) -> Option<Assist> {
|
|||
}
|
||||
|
||||
fn contains_placeholder(a: &ast::MatchArm) -> bool {
|
||||
a.pats().any(|x| match x {
|
||||
ra_syntax::ast::Pat::PlaceholderPat(..) => true,
|
||||
match a.pat() {
|
||||
Some(ra_syntax::ast::Pat::PlaceholderPat(..)) => true,
|
||||
_ => false,
|
||||
})
|
||||
}
|
||||
}
|
||||
|
||||
fn next_arm(arm: &ast::MatchArm) -> Option<ast::MatchArm> {
|
||||
|
|
|
@ -90,7 +90,7 @@ pub(crate) fn move_guard_to_arm_body(ctx: AssistCtx) -> Option<Assist> {
|
|||
// ```
|
||||
pub(crate) fn move_arm_cond_to_match_guard(ctx: AssistCtx) -> Option<Assist> {
|
||||
let match_arm: MatchArm = ctx.find_node_at_offset::<MatchArm>()?;
|
||||
let last_match_pat = match_arm.pats().last()?;
|
||||
let match_pat = match_arm.pat()?;
|
||||
|
||||
let arm_body = match_arm.expr()?;
|
||||
let if_expr: IfExpr = IfExpr::cast(arm_body.syntax().clone())?;
|
||||
|
@ -122,8 +122,8 @@ pub(crate) fn move_arm_cond_to_match_guard(ctx: AssistCtx) -> Option<Assist> {
|
|||
_ => edit.replace(if_expr.syntax().text_range(), then_block.syntax().text()),
|
||||
}
|
||||
|
||||
edit.insert(last_match_pat.syntax().text_range().end(), buf);
|
||||
edit.set_cursor(last_match_pat.syntax().text_range().end() + TextUnit::from(1));
|
||||
edit.insert(match_pat.syntax().text_range().end(), buf);
|
||||
edit.set_cursor(match_pat.syntax().text_range().end() + TextUnit::from(1));
|
||||
},
|
||||
)
|
||||
}
|
||||
|
|
|
@ -164,9 +164,9 @@ where
|
|||
let match_expr = self.collect_expr_opt(condition.expr());
|
||||
let placeholder_pat = self.missing_pat();
|
||||
let arms = vec![
|
||||
MatchArm { pats: vec![pat], expr: then_branch, guard: None },
|
||||
MatchArm { pat, expr: then_branch, guard: None },
|
||||
MatchArm {
|
||||
pats: vec![placeholder_pat],
|
||||
pat: placeholder_pat,
|
||||
expr: else_branch.unwrap_or_else(|| self.empty_block()),
|
||||
guard: None,
|
||||
},
|
||||
|
@ -203,8 +203,8 @@ where
|
|||
let placeholder_pat = self.missing_pat();
|
||||
let break_ = self.alloc_expr_desugared(Expr::Break { expr: None });
|
||||
let arms = vec![
|
||||
MatchArm { pats: vec![pat], expr: body, guard: None },
|
||||
MatchArm { pats: vec![placeholder_pat], expr: break_, guard: None },
|
||||
MatchArm { pat, expr: body, guard: None },
|
||||
MatchArm { pat: placeholder_pat, expr: break_, guard: None },
|
||||
];
|
||||
let match_expr =
|
||||
self.alloc_expr_desugared(Expr::Match { expr: match_expr, arms });
|
||||
|
@ -250,7 +250,7 @@ where
|
|||
match_arm_list
|
||||
.arms()
|
||||
.map(|arm| MatchArm {
|
||||
pats: arm.pats().map(|p| self.collect_pat(p)).collect(),
|
||||
pat: self.collect_pat_opt(arm.pat()),
|
||||
expr: self.collect_expr_opt(arm.expr()),
|
||||
guard: arm
|
||||
.guard()
|
||||
|
@ -587,6 +587,11 @@ where
|
|||
let path = p.path().and_then(|path| self.expander.parse_path(path));
|
||||
path.map(Pat::Path).unwrap_or(Pat::Missing)
|
||||
}
|
||||
ast::Pat::OrPat(p) => {
|
||||
let pats = p.pats().map(|p| self.collect_pat(p)).collect();
|
||||
Pat::Or(pats)
|
||||
}
|
||||
ast::Pat::ParenPat(p) => return self.collect_pat_opt(p.pat()),
|
||||
ast::Pat::TuplePat(p) => {
|
||||
let args = p.args().map(|p| self.collect_pat(p)).collect();
|
||||
Pat::Tuple(args)
|
||||
|
|
|
@ -158,9 +158,7 @@ fn compute_expr_scopes(expr: ExprId, body: &Body, scopes: &mut ExprScopes, scope
|
|||
compute_expr_scopes(*expr, body, scopes, scope);
|
||||
for arm in arms {
|
||||
let scope = scopes.new_scope(scope);
|
||||
for pat in &arm.pats {
|
||||
scopes.add_bindings(body, scope, *pat);
|
||||
}
|
||||
scopes.add_bindings(body, scope, arm.pat);
|
||||
scopes.set_scope(arm.expr, scope);
|
||||
compute_expr_scopes(arm.expr, body, scopes, scope);
|
||||
}
|
||||
|
|
|
@ -202,7 +202,7 @@ pub enum Array {
|
|||
|
||||
#[derive(Debug, Clone, Eq, PartialEq)]
|
||||
pub struct MatchArm {
|
||||
pub pats: Vec<PatId>,
|
||||
pub pat: PatId,
|
||||
pub guard: Option<ExprId>,
|
||||
pub expr: ExprId,
|
||||
}
|
||||
|
@ -382,6 +382,7 @@ pub enum Pat {
|
|||
Missing,
|
||||
Wild,
|
||||
Tuple(Vec<PatId>),
|
||||
Or(Vec<PatId>),
|
||||
Record {
|
||||
path: Option<Path>,
|
||||
args: Vec<RecordFieldPat>,
|
||||
|
@ -420,7 +421,7 @@ impl Pat {
|
|||
Pat::Bind { subpat, .. } => {
|
||||
subpat.iter().copied().for_each(f);
|
||||
}
|
||||
Pat::Tuple(args) | Pat::TupleStruct { args, .. } => {
|
||||
Pat::Or(args) | Pat::Tuple(args) | Pat::TupleStruct { args, .. } => {
|
||||
args.iter().copied().for_each(f);
|
||||
}
|
||||
Pat::Ref { pat, .. } => f(*pat),
|
||||
|
|
|
@ -168,9 +168,7 @@ impl<'a, D: HirDatabase> InferenceContext<'a, D> {
|
|||
let mut result_ty = self.table.new_maybe_never_type_var();
|
||||
|
||||
for arm in arms {
|
||||
for &pat in &arm.pats {
|
||||
let _pat_ty = self.infer_pat(pat, &input_ty, BindingMode::default());
|
||||
}
|
||||
let _pat_ty = self.infer_pat(arm.pat, &input_ty, BindingMode::default());
|
||||
if let Some(guard_expr) = arm.guard {
|
||||
self.infer_expr(
|
||||
guard_expr,
|
||||
|
|
|
@ -82,6 +82,7 @@ impl<'a, D: HirDatabase> InferenceContext<'a, D> {
|
|||
|
||||
let is_non_ref_pat = match &body[pat] {
|
||||
Pat::Tuple(..)
|
||||
| Pat::Or(..)
|
||||
| Pat::TupleStruct { .. }
|
||||
| Pat::Record { .. }
|
||||
| Pat::Range { .. }
|
||||
|
@ -126,6 +127,17 @@ impl<'a, D: HirDatabase> InferenceContext<'a, D> {
|
|||
|
||||
Ty::apply(TypeCtor::Tuple { cardinality: args.len() as u16 }, Substs(inner_tys))
|
||||
}
|
||||
Pat::Or(ref pats) => {
|
||||
if let Some((first_pat, rest)) = pats.split_first() {
|
||||
let ty = self.infer_pat(*first_pat, expected, default_bm);
|
||||
for pat in rest {
|
||||
self.infer_pat(*pat, expected, default_bm);
|
||||
}
|
||||
ty
|
||||
} else {
|
||||
Ty::Unknown
|
||||
}
|
||||
}
|
||||
Pat::Ref { pat, mutability } => {
|
||||
let expectation = match expected.as_reference() {
|
||||
Some((inner_ty, exp_mut)) => {
|
||||
|
|
|
@ -80,8 +80,7 @@ fn get_inlay_hints(
|
|||
},
|
||||
ast::MatchArmList(it) => {
|
||||
it.arms()
|
||||
.map(|match_arm| match_arm.pats())
|
||||
.flatten()
|
||||
.filter_map(|match_arm| match_arm.pat())
|
||||
.for_each(|root_pat| get_pat_type_hints(acc, db, &analyzer, root_pat, true, max_inlay_hint_length));
|
||||
},
|
||||
ast::CallExpr(it) => {
|
||||
|
@ -202,6 +201,7 @@ fn get_leaf_pats(root_pat: ast::Pat) -> Vec<ast::Pat> {
|
|||
Some(pat) => pats_to_process.push_back(pat),
|
||||
_ => leaf_pats.push(maybe_leaf_pat),
|
||||
},
|
||||
ast::Pat::OrPat(ref_pat) => pats_to_process.extend(ref_pat.pats()),
|
||||
ast::Pat::TuplePat(tuple_pat) => pats_to_process.extend(tuple_pat.args()),
|
||||
ast::Pat::RecordPat(record_pat) => {
|
||||
if let Some(pat_list) = record_pat.record_field_pat_list() {
|
||||
|
@ -222,6 +222,7 @@ fn get_leaf_pats(root_pat: ast::Pat) -> Vec<ast::Pat> {
|
|||
ast::Pat::TupleStructPat(tuple_struct_pat) => {
|
||||
pats_to_process.extend(tuple_struct_pat.args())
|
||||
}
|
||||
ast::Pat::ParenPat(inner_pat) => pats_to_process.extend(inner_pat.pat()),
|
||||
ast::Pat::RefPat(ref_pat) => pats_to_process.extend(ref_pat.pat()),
|
||||
_ => (),
|
||||
}
|
||||
|
|
|
@ -336,7 +336,7 @@ fn for_expr(p: &mut Parser, m: Option<Marker>) -> CompletedMarker {
|
|||
fn cond(p: &mut Parser) {
|
||||
let m = p.start();
|
||||
if p.eat(T![let]) {
|
||||
patterns::pattern_list(p);
|
||||
patterns::pattern_top(p);
|
||||
p.expect(T![=]);
|
||||
}
|
||||
expr_no_struct(p);
|
||||
|
@ -430,7 +430,7 @@ fn match_arm(p: &mut Parser) -> BlockLike {
|
|||
// }
|
||||
attributes::outer_attributes(p);
|
||||
|
||||
patterns::pattern_list_r(p, TokenSet::EMPTY);
|
||||
patterns::pattern_top_r(p, TokenSet::EMPTY);
|
||||
if p.at(T![if]) {
|
||||
match_guard(p);
|
||||
}
|
||||
|
|
|
@ -116,7 +116,7 @@ fn value_parameter(p: &mut Parser, flavor: Flavor) {
|
|||
// type Qux = fn(baz: Bar::Baz);
|
||||
Flavor::FnPointer => {
|
||||
if p.at(IDENT) && p.nth(1) == T![:] && !p.nth_at(1, T![::]) {
|
||||
patterns::pattern(p);
|
||||
patterns::pattern_single(p);
|
||||
types::ascription(p);
|
||||
} else {
|
||||
types::type_(p);
|
||||
|
@ -127,7 +127,7 @@ fn value_parameter(p: &mut Parser, flavor: Flavor) {
|
|||
// let foo = |bar, baz: Baz, qux: Qux::Quux| ();
|
||||
// }
|
||||
Flavor::Closure => {
|
||||
patterns::pattern(p);
|
||||
patterns::pattern_single(p);
|
||||
if p.at(T![:]) && !p.at(T![::]) {
|
||||
types::ascription(p);
|
||||
}
|
||||
|
|
|
@ -11,22 +11,49 @@ pub(crate) fn pattern(p: &mut Parser) {
|
|||
}
|
||||
|
||||
/// Parses a pattern list separated by pipes `|`
|
||||
pub(super) fn pattern_list(p: &mut Parser) {
|
||||
pattern_list_r(p, PAT_RECOVERY_SET)
|
||||
pub(super) fn pattern_top(p: &mut Parser) {
|
||||
pattern_top_r(p, PAT_RECOVERY_SET)
|
||||
}
|
||||
|
||||
pub(crate) fn pattern_single(p: &mut Parser) {
|
||||
pattern_single_r(p, PAT_RECOVERY_SET);
|
||||
}
|
||||
|
||||
/// Parses a pattern list separated by pipes `|`
|
||||
/// using the given `recovery_set`
|
||||
pub(super) fn pattern_list_r(p: &mut Parser, recovery_set: TokenSet) {
|
||||
pub(super) fn pattern_top_r(p: &mut Parser, recovery_set: TokenSet) {
|
||||
p.eat(T![|]);
|
||||
pattern_r(p, recovery_set);
|
||||
}
|
||||
|
||||
/// Parses a pattern list separated by pipes `|`, with no leading `|`,using the
|
||||
/// given `recovery_set`
|
||||
// test or_pattern
|
||||
// fn main() {
|
||||
// match () {
|
||||
// (_ | _) => (),
|
||||
// &(_ | _) => (),
|
||||
// (_ | _,) => (),
|
||||
// [_ | _,] => (),
|
||||
// }
|
||||
// }
|
||||
fn pattern_r(p: &mut Parser, recovery_set: TokenSet) {
|
||||
let m = p.start();
|
||||
pattern_single_r(p, recovery_set);
|
||||
|
||||
let mut is_or_pat = false;
|
||||
while p.eat(T![|]) {
|
||||
pattern_r(p, recovery_set);
|
||||
is_or_pat = true;
|
||||
pattern_single_r(p, recovery_set);
|
||||
}
|
||||
if is_or_pat {
|
||||
m.complete(p, OR_PAT);
|
||||
} else {
|
||||
m.abandon(p);
|
||||
}
|
||||
}
|
||||
|
||||
pub(super) fn pattern_r(p: &mut Parser, recovery_set: TokenSet) {
|
||||
fn pattern_single_r(p: &mut Parser, recovery_set: TokenSet) {
|
||||
if let Some(lhs) = atom_pat(p, recovery_set) {
|
||||
// test range_pat
|
||||
// fn main() {
|
||||
|
@ -258,7 +285,7 @@ fn ref_pat(p: &mut Parser) -> CompletedMarker {
|
|||
let m = p.start();
|
||||
p.bump(T![&]);
|
||||
p.eat(T![mut]);
|
||||
pattern(p);
|
||||
pattern_single(p);
|
||||
m.complete(p, REF_PAT)
|
||||
}
|
||||
|
||||
|
@ -269,8 +296,27 @@ fn ref_pat(p: &mut Parser) -> CompletedMarker {
|
|||
fn tuple_pat(p: &mut Parser) -> CompletedMarker {
|
||||
assert!(p.at(T!['(']));
|
||||
let m = p.start();
|
||||
tuple_pat_fields(p);
|
||||
m.complete(p, TUPLE_PAT)
|
||||
p.bump(T!['(']);
|
||||
let mut has_comma = false;
|
||||
let mut has_pat = false;
|
||||
let mut has_rest = false;
|
||||
while !p.at(EOF) && !p.at(T![')']) {
|
||||
has_pat = true;
|
||||
if !p.at_ts(PATTERN_FIRST) {
|
||||
p.error("expected a pattern");
|
||||
break;
|
||||
}
|
||||
has_rest |= p.at(T![..]);
|
||||
|
||||
pattern(p);
|
||||
if !p.at(T![')']) {
|
||||
has_comma = true;
|
||||
p.expect(T![,]);
|
||||
}
|
||||
}
|
||||
p.expect(T![')']);
|
||||
|
||||
m.complete(p, if !has_comma && !has_rest && has_pat { PAREN_PAT } else { TUPLE_PAT })
|
||||
}
|
||||
|
||||
// test slice_pat
|
||||
|
@ -315,7 +361,7 @@ fn bind_pat(p: &mut Parser, with_at: bool) -> CompletedMarker {
|
|||
p.eat(T![mut]);
|
||||
name(p);
|
||||
if with_at && p.eat(T![@]) {
|
||||
pattern(p);
|
||||
pattern_single(p);
|
||||
}
|
||||
m.complete(p, BIND_PAT)
|
||||
}
|
||||
|
@ -330,6 +376,6 @@ fn box_pat(p: &mut Parser) -> CompletedMarker {
|
|||
assert!(p.at(T![box]));
|
||||
let m = p.start();
|
||||
p.bump(T![box]);
|
||||
pattern(p);
|
||||
pattern_single(p);
|
||||
m.complete(p, BOX_PAT)
|
||||
}
|
||||
|
|
|
@ -151,6 +151,8 @@ pub enum SyntaxKind {
|
|||
FOR_TYPE,
|
||||
IMPL_TRAIT_TYPE,
|
||||
DYN_TRAIT_TYPE,
|
||||
OR_PAT,
|
||||
PAREN_PAT,
|
||||
REF_PAT,
|
||||
BOX_PAT,
|
||||
BIND_PAT,
|
||||
|
|
|
@ -1759,8 +1759,8 @@ impl AstNode for MatchArm {
|
|||
}
|
||||
impl ast::AttrsOwner for MatchArm {}
|
||||
impl MatchArm {
|
||||
pub fn pats(&self) -> AstChildren<Pat> {
|
||||
AstChildren::new(&self.syntax)
|
||||
pub fn pat(&self) -> Option<Pat> {
|
||||
AstChildren::new(&self.syntax).next()
|
||||
}
|
||||
pub fn guard(&self) -> Option<MatchGuard> {
|
||||
AstChildren::new(&self.syntax).next()
|
||||
|
@ -1887,6 +1887,60 @@ impl RecordField {
|
|||
}
|
||||
}
|
||||
#[derive(Debug, Clone, PartialEq, Eq, Hash)]
|
||||
pub struct OrPat {
|
||||
pub(crate) syntax: SyntaxNode,
|
||||
}
|
||||
impl AstNode for OrPat {
|
||||
fn can_cast(kind: SyntaxKind) -> bool {
|
||||
match kind {
|
||||
OR_PAT => true,
|
||||
_ => false,
|
||||
}
|
||||
}
|
||||
fn cast(syntax: SyntaxNode) -> Option<Self> {
|
||||
if Self::can_cast(syntax.kind()) {
|
||||
Some(Self { syntax })
|
||||
} else {
|
||||
None
|
||||
}
|
||||
}
|
||||
fn syntax(&self) -> &SyntaxNode {
|
||||
&self.syntax
|
||||
}
|
||||
}
|
||||
impl OrPat {
|
||||
pub fn pats(&self) -> AstChildren<Pat> {
|
||||
AstChildren::new(&self.syntax)
|
||||
}
|
||||
}
|
||||
#[derive(Debug, Clone, PartialEq, Eq, Hash)]
|
||||
pub struct ParenPat {
|
||||
pub(crate) syntax: SyntaxNode,
|
||||
}
|
||||
impl AstNode for ParenPat {
|
||||
fn can_cast(kind: SyntaxKind) -> bool {
|
||||
match kind {
|
||||
PAREN_PAT => true,
|
||||
_ => false,
|
||||
}
|
||||
}
|
||||
fn cast(syntax: SyntaxNode) -> Option<Self> {
|
||||
if Self::can_cast(syntax.kind()) {
|
||||
Some(Self { syntax })
|
||||
} else {
|
||||
None
|
||||
}
|
||||
}
|
||||
fn syntax(&self) -> &SyntaxNode {
|
||||
&self.syntax
|
||||
}
|
||||
}
|
||||
impl ParenPat {
|
||||
pub fn pat(&self) -> Option<Pat> {
|
||||
AstChildren::new(&self.syntax).next()
|
||||
}
|
||||
}
|
||||
#[derive(Debug, Clone, PartialEq, Eq, Hash)]
|
||||
pub struct RefPat {
|
||||
pub(crate) syntax: SyntaxNode,
|
||||
}
|
||||
|
@ -3900,6 +3954,8 @@ impl AstNode for Expr {
|
|||
}
|
||||
#[derive(Debug, Clone, PartialEq, Eq, Hash)]
|
||||
pub enum Pat {
|
||||
OrPat(OrPat),
|
||||
ParenPat(ParenPat),
|
||||
RefPat(RefPat),
|
||||
BoxPat(BoxPat),
|
||||
BindPat(BindPat),
|
||||
|
@ -3913,6 +3969,16 @@ pub enum Pat {
|
|||
RangePat(RangePat),
|
||||
LiteralPat(LiteralPat),
|
||||
}
|
||||
impl From<OrPat> for Pat {
|
||||
fn from(node: OrPat) -> Pat {
|
||||
Pat::OrPat(node)
|
||||
}
|
||||
}
|
||||
impl From<ParenPat> for Pat {
|
||||
fn from(node: ParenPat) -> Pat {
|
||||
Pat::ParenPat(node)
|
||||
}
|
||||
}
|
||||
impl From<RefPat> for Pat {
|
||||
fn from(node: RefPat) -> Pat {
|
||||
Pat::RefPat(node)
|
||||
|
@ -3976,15 +4042,16 @@ impl From<LiteralPat> for Pat {
|
|||
impl AstNode for Pat {
|
||||
fn can_cast(kind: SyntaxKind) -> bool {
|
||||
match kind {
|
||||
REF_PAT | BOX_PAT | BIND_PAT | PLACEHOLDER_PAT | DOT_DOT_PAT | PATH_PAT
|
||||
| RECORD_PAT | TUPLE_STRUCT_PAT | TUPLE_PAT | SLICE_PAT | RANGE_PAT | LITERAL_PAT => {
|
||||
true
|
||||
}
|
||||
OR_PAT | PAREN_PAT | REF_PAT | BOX_PAT | BIND_PAT | PLACEHOLDER_PAT | DOT_DOT_PAT
|
||||
| PATH_PAT | RECORD_PAT | TUPLE_STRUCT_PAT | TUPLE_PAT | SLICE_PAT | RANGE_PAT
|
||||
| LITERAL_PAT => true,
|
||||
_ => false,
|
||||
}
|
||||
}
|
||||
fn cast(syntax: SyntaxNode) -> Option<Self> {
|
||||
let res = match syntax.kind() {
|
||||
OR_PAT => Pat::OrPat(OrPat { syntax }),
|
||||
PAREN_PAT => Pat::ParenPat(ParenPat { syntax }),
|
||||
REF_PAT => Pat::RefPat(RefPat { syntax }),
|
||||
BOX_PAT => Pat::BoxPat(BoxPat { syntax }),
|
||||
BIND_PAT => Pat::BindPat(BindPat { syntax }),
|
||||
|
@ -4003,6 +4070,8 @@ impl AstNode for Pat {
|
|||
}
|
||||
fn syntax(&self) -> &SyntaxNode {
|
||||
match self {
|
||||
Pat::OrPat(it) => &it.syntax,
|
||||
Pat::ParenPat(it) => &it.syntax,
|
||||
Pat::RefPat(it) => &it.syntax,
|
||||
Pat::BoxPat(it) => &it.syntax,
|
||||
Pat::BindPat(it) => &it.syntax,
|
||||
|
|
|
@ -120,6 +120,8 @@ pub(crate) const KINDS_SRC: KindsSrc = KindsSrc {
|
|||
"FOR_TYPE",
|
||||
"IMPL_TRAIT_TYPE",
|
||||
"DYN_TRAIT_TYPE",
|
||||
"OR_PAT",
|
||||
"PAREN_PAT",
|
||||
"REF_PAT",
|
||||
"BOX_PAT",
|
||||
"BIND_PAT",
|
||||
|
@ -412,7 +414,7 @@ pub(crate) const AST_SRC: AstSrc = AstSrc {
|
|||
struct MatchExpr { Expr, MatchArmList }
|
||||
struct MatchArmList: AttrsOwner { arms: [MatchArm] }
|
||||
struct MatchArm: AttrsOwner {
|
||||
pats: [Pat],
|
||||
pat: Pat,
|
||||
guard: MatchGuard,
|
||||
Expr,
|
||||
}
|
||||
|
@ -425,6 +427,8 @@ pub(crate) const AST_SRC: AstSrc = AstSrc {
|
|||
}
|
||||
struct RecordField { NameRef, Expr }
|
||||
|
||||
struct OrPat { pats: [Pat] }
|
||||
struct ParenPat { Pat }
|
||||
struct RefPat { Pat }
|
||||
struct BoxPat { Pat }
|
||||
struct BindPat: NameOwner { Pat }
|
||||
|
@ -601,6 +605,8 @@ pub(crate) const AST_SRC: AstSrc = AstSrc {
|
|||
}
|
||||
|
||||
enum Pat {
|
||||
OrPat,
|
||||
ParenPat,
|
||||
RefPat,
|
||||
BoxPat,
|
||||
BindPat,
|
||||
|
|
Loading…
Reference in a new issue