1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
|
// run-pass
#![feature(unsized_tuple_coercion)]
use std::collections::HashSet;
fn main() {
let x : &(i32, i32, [i32]) = &(0, 1, [2, 3]);
let y : &(i32, i32, [i32]) = &(0, 1, [2, 3, 4]);
let mut a = [y, x];
a.sort();
assert_eq!(a, [x, y]);
assert_eq!(&format!("{:?}", a), "[(0, 1, [2, 3]), (0, 1, [2, 3, 4])]");
let mut h = HashSet::new();
h.insert(x);
h.insert(y);
assert!(h.contains(x));
assert!(h.contains(y));
}
|