2019-07-26 16:54:25 -05:00
|
|
|
// run-pass
|
|
|
|
|
|
2017-07-04 07:26:46 -05:00
|
|
|
#![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));
|
|
|
|
|
}
|
