0b5bc3314f
Key points are: 1. `a + b` maps directly to `Add<A,B>`, where `A` and `B` are the types of `a` and `b`. 2. Indexing and slicing autoderefs consistently.
22 lines
750 B
Rust
22 lines
750 B
Rust
// Copyright 2014 The Rust Project Developers. See the COPYRIGHT
|
|
// file at the top-level directory of this distribution and at
|
|
// http://rust-lang.org/COPYRIGHT.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
|
// option. This file may not be copied, modified, or distributed
|
|
// except according to those terms.
|
|
|
|
// compile-flags:-Z verbose
|
|
|
|
fn main() {
|
|
let x = [1,2];
|
|
let y = match x {
|
|
[] => None,
|
|
//~^ ERROR types: expected `[_#0i, ..2]`, found `[_#7t, ..0]`
|
|
// (expected array of 2 elements, found array of 0 elements)
|
|
[a,_] => Some(a)
|
|
};
|
|
}
|