1 // Copyright 2012-2014 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 // This is a regression test for something that only came up while
12 // attempting to bootstrap librustc with new destructor lifetime
15 use std::collections::HashMap;
16 use std::cell::RefCell;
18 // This version does not yet work (associated type issues)...
19 #[cfg(cannot_use_this_yet)]
20 fn foo<'a>(map: RefCell<HashMap<&'static str, &'a [u8]>>) {
22 assert_eq!(map.borrow().get("one"), Some(&one[]));
25 #[cfg(cannot_use_this_yet_either)]
26 // ... and this version does not work (the lifetime of `one` is
27 // supposed to match the lifetime `'a`) ...
28 fn foo<'a>(map: RefCell<HashMap<&'static str, &'a [u8]>>) {
30 assert_eq!(map.borrow().get("one"), Some(&one.as_slice()));
33 #[cfg(all(not(cannot_use_this_yet),not(cannot_use_this_yet_either)))]
34 fn foo<'a>(map: RefCell<HashMap<&'static str, &'a [u8]>>) {
35 // ...so instead we walk through the trivial slice and make sure
36 // it contains the element we expect.
38 for (i, &x) in map.borrow().get("one").unwrap().iter().enumerate() {
39 assert_eq!((i, x), (0, 1));
47 let mut map = HashMap::new();
48 map.insert("zero", &zer[]);
49 map.insert("one", &one[]);
50 map.insert("two", &two[]);
51 let map = RefCell::new(map);