2018-02-17 16:06:48 -06:00
|
|
|
use super::*;
|
|
|
|
|
|
|
|
pub(super) fn pattern(p: &mut Parser) {
|
2018-08-04 07:47:45 -05:00
|
|
|
let la0 = p.nth(0);
|
|
|
|
let la1 = p.nth(1);
|
|
|
|
if la0 == REF_KW || la0 == MUT_KW
|
|
|
|
|| (la0 == IDENT && !(la1 == COLONCOLON || la1 == L_PAREN || la1 == L_CURLY)) {
|
|
|
|
bind_pat(p, true);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if paths::is_path_start(p) {
|
|
|
|
path_pat(p);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
match la0 {
|
2018-02-17 16:06:48 -06:00
|
|
|
UNDERSCORE => placeholder_pat(p),
|
2018-08-05 10:18:02 -05:00
|
|
|
AMP => ref_pat(p),
|
2018-02-17 16:06:48 -06:00
|
|
|
_ => p.err_and_bump("expected pattern"),
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-08-04 07:47:45 -05:00
|
|
|
// test path_part
|
|
|
|
// fn foo() {
|
|
|
|
// let foo::Bar = ();
|
|
|
|
// let ::Bar = ();
|
|
|
|
// let Bar { .. } = ();
|
|
|
|
// let Bar(..) = ();
|
|
|
|
// }
|
|
|
|
fn path_pat(p: &mut Parser) {
|
|
|
|
let m = p.start();
|
|
|
|
paths::expr_path(p);
|
|
|
|
let kind = match p.current() {
|
|
|
|
L_PAREN => {
|
|
|
|
tuple_pat_fields(p);
|
|
|
|
TUPLE_PAT
|
|
|
|
}
|
|
|
|
L_CURLY => {
|
|
|
|
struct_pat_fields(p);
|
|
|
|
STRUCT_PAT
|
|
|
|
}
|
|
|
|
_ => PATH_PAT
|
|
|
|
};
|
|
|
|
m.complete(p, kind);
|
|
|
|
}
|
|
|
|
|
|
|
|
// test tuple_pat_fields
|
|
|
|
// fn foo() {
|
|
|
|
// let S() = ();
|
|
|
|
// let S(_) = ();
|
|
|
|
// let S(_,) = ();
|
|
|
|
// let S(_, .. , x) = ();
|
|
|
|
// }
|
|
|
|
fn tuple_pat_fields(p: &mut Parser) {
|
|
|
|
assert!(p.at(L_PAREN));
|
|
|
|
p.bump();
|
|
|
|
while !p.at(EOF) && !p.at(R_PAREN) {
|
|
|
|
match p.current() {
|
|
|
|
DOTDOT => p.bump(),
|
|
|
|
_ => pattern(p),
|
|
|
|
}
|
|
|
|
if !p.at(R_PAREN) {
|
|
|
|
p.expect(COMMA);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
p.expect(R_PAREN);
|
|
|
|
}
|
|
|
|
|
|
|
|
// test struct_pat_fields
|
|
|
|
// fn foo() {
|
|
|
|
// let S {} = ();
|
|
|
|
// let S { f, ref mut g } = ();
|
|
|
|
// let S { h: _, ..} = ();
|
|
|
|
// let S { h: _, } = ();
|
|
|
|
// }
|
|
|
|
fn struct_pat_fields(p: &mut Parser) {
|
|
|
|
assert!(p.at(L_CURLY));
|
|
|
|
p.bump();
|
|
|
|
while !p.at(EOF) && !p.at(R_CURLY) {
|
|
|
|
match p.current() {
|
|
|
|
DOTDOT => p.bump(),
|
|
|
|
IDENT if p.nth(1) == COLON => {
|
|
|
|
p.bump();
|
|
|
|
p.bump();
|
|
|
|
pattern(p);
|
|
|
|
}
|
|
|
|
_ => bind_pat(p, false),
|
|
|
|
}
|
|
|
|
if !p.at(R_CURLY) {
|
|
|
|
p.expect(COMMA);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
p.expect(R_CURLY);
|
|
|
|
}
|
|
|
|
|
2018-02-17 16:06:48 -06:00
|
|
|
// test placeholder_pat
|
|
|
|
// fn main() { let _ = (); }
|
|
|
|
fn placeholder_pat(p: &mut Parser) {
|
|
|
|
assert!(p.at(UNDERSCORE));
|
|
|
|
let m = p.start();
|
|
|
|
p.bump();
|
|
|
|
m.complete(p, PLACEHOLDER_PAT);
|
|
|
|
}
|
|
|
|
|
|
|
|
// test ref_pat
|
|
|
|
// fn main() {
|
|
|
|
// let &a = ();
|
|
|
|
// let &mut b = ();
|
|
|
|
// }
|
|
|
|
fn ref_pat(p: &mut Parser) {
|
2018-08-05 10:18:02 -05:00
|
|
|
assert!(p.at(AMP));
|
2018-02-17 16:06:48 -06:00
|
|
|
let m = p.start();
|
|
|
|
p.bump();
|
|
|
|
p.eat(MUT_KW);
|
|
|
|
pattern(p);
|
|
|
|
m.complete(p, REF_PAT);
|
|
|
|
}
|
|
|
|
|
|
|
|
// test bind_pat
|
|
|
|
// fn main() {
|
|
|
|
// let a = ();
|
2018-07-31 07:30:11 -05:00
|
|
|
// let mut b = ();
|
|
|
|
// let ref c = ();
|
|
|
|
// let ref mut d = ();
|
|
|
|
// let e @ _ = ();
|
|
|
|
// let ref mut f @ g @ _ = ();
|
2018-02-17 16:06:48 -06:00
|
|
|
// }
|
2018-08-04 07:47:45 -05:00
|
|
|
fn bind_pat(p: &mut Parser, with_at: bool) {
|
2018-02-17 16:06:48 -06:00
|
|
|
let m = p.start();
|
2018-07-31 07:40:40 -05:00
|
|
|
p.eat(REF_KW);
|
|
|
|
p.eat(MUT_KW);
|
2018-02-17 16:06:48 -06:00
|
|
|
name(p);
|
2018-08-04 07:47:45 -05:00
|
|
|
if with_at && p.eat(AT) {
|
2018-02-17 16:06:48 -06:00
|
|
|
pattern(p);
|
|
|
|
}
|
|
|
|
m.complete(p, BIND_PAT);
|
|
|
|
}
|