Skip to content

Commit

Permalink
Use temp vars for implicit coercion to ^[T]
Browse files Browse the repository at this point in the history
  • Loading branch information
nrc committed Aug 26, 2014
1 parent 34d607f commit 37a94b8
Show file tree
Hide file tree
Showing 31 changed files with 381 additions and 215 deletions.
2 changes: 1 addition & 1 deletion src/libcollections/bitv.rs
Expand Up @@ -2557,7 +2557,7 @@ mod tests {
}

fn rng() -> rand::IsaacRng {
let seed = &[1, 2, 3, 4, 5, 6, 7, 8, 9, 0];
let seed: &[_] = &[1, 2, 3, 4, 5, 6, 7, 8, 9, 0];
rand::SeedableRng::from_seed(seed)
}

Expand Down
3 changes: 2 additions & 1 deletion src/libcollections/dlist.rs
Expand Up @@ -1088,7 +1088,8 @@ mod tests {
let n = list_from([1i,2,3]);
spawn(proc() {
check_links(&n);
assert_eq!(&[&1,&2,&3], n.iter().collect::<Vec<&int>>().as_slice());
let a: &[_] = &[&1,&2,&3];
assert_eq!(a, n.iter().collect::<Vec<&int>>().as_slice());
});
}

Expand Down
3 changes: 2 additions & 1 deletion src/libcollections/hash/mod.rs
Expand Up @@ -346,7 +346,8 @@ mod tests {
assert_eq!(hasher.hash(&'a'), 97);

assert_eq!(hasher.hash(&("a")), 97 + 0xFF);
assert_eq!(hasher.hash(& &[1u8, 2u8, 3u8]), 9);
let cs: &[u8] = &[1u8, 2u8, 3u8];
assert_eq!(hasher.hash(& cs), 9);

unsafe {
let ptr: *const int = mem::transmute(5i);
Expand Down
4 changes: 2 additions & 2 deletions src/libcollections/hash/sip.rs
Expand Up @@ -495,8 +495,8 @@ mod tests {
assert!(s != t && t != u);
assert!(hash(&s) != hash(&t) && hash(&s) != hash(&u));

let v = (&[1u8], &[0u8, 0], &[0u8]);
let w = (&[1u8, 0, 0, 0], &[], &[]);
let v: (&[u8], &[u8], &[u8]) = (&[1u8], &[0u8, 0], &[0u8]);
let w: (&[u8], &[u8], &[u8]) = (&[1u8, 0, 0, 0], &[], &[]);

assert!(v != w);
assert!(hash(&v) != hash(&w));
Expand Down
18 changes: 14 additions & 4 deletions src/libcollections/ringbuf.rs
Expand Up @@ -865,12 +865,18 @@ mod tests {
for i in range(0i, 5) {
d.push_back(i);
}
assert_eq!(d.iter().collect::<Vec<&int>>().as_slice(), &[&0,&1,&2,&3,&4]);
{
let b: &[_] = &[&0,&1,&2,&3,&4];
assert_eq!(d.iter().collect::<Vec<&int>>().as_slice(), b);
}

for i in range(6i, 9) {
d.push_front(i);
}
assert_eq!(d.iter().collect::<Vec<&int>>().as_slice(), &[&8,&7,&6,&0,&1,&2,&3,&4]);
{
let b: &[_] = &[&8,&7,&6,&0,&1,&2,&3,&4];
assert_eq!(d.iter().collect::<Vec<&int>>().as_slice(), b);
}

let mut it = d.iter();
let mut len = d.len();
Expand All @@ -890,12 +896,16 @@ mod tests {
for i in range(0i, 5) {
d.push_back(i);
}
assert_eq!(d.iter().rev().collect::<Vec<&int>>().as_slice(), &[&4,&3,&2,&1,&0]);
{
let b: &[_] = &[&4,&3,&2,&1,&0];
assert_eq!(d.iter().rev().collect::<Vec<&int>>().as_slice(), b);
}

for i in range(6i, 9) {
d.push_front(i);
}
assert_eq!(d.iter().rev().collect::<Vec<&int>>().as_slice(), &[&4,&3,&2,&1,&0,&6,&7,&8]);
let b: &[_] = &[&4,&3,&2,&1,&0,&6,&7,&8];
assert_eq!(d.iter().rev().collect::<Vec<&int>>().as_slice(), b);
}

#[test]
Expand Down

0 comments on commit 37a94b8

Please sign in to comment.