From 808390817aa50b6251e957075c22a688bc96ce9f Mon Sep 17 00:00:00 2001 From: Andre Bogus Date: Tue, 8 Sep 2015 01:03:01 +0200 Subject: [PATCH] fixes/improvements thanks to @Manishearth --- src/libserialize/json.rs | 6 +++--- src/libstd/sys/unix/os.rs | 3 +-- src/libtest/stats.rs | 1 - 3 files changed, 4 insertions(+), 6 deletions(-) diff --git a/src/libserialize/json.rs b/src/libserialize/json.rs index 050b1a3bc16..4bcaa4b5dbc 100644 --- a/src/libserialize/json.rs +++ b/src/libserialize/json.rs @@ -1324,7 +1324,7 @@ impl Stack { pub fn is_equal_to(&self, rhs: &[StackElement]) -> bool { if self.stack.len() != rhs.len() { return false; } for (i, r) in rhs.iter().enumerate() { - if &self.get(i) != r { return false; } + if self.get(i) != *r { return false; } } true } @@ -1334,7 +1334,7 @@ impl Stack { pub fn starts_with(&self, rhs: &[StackElement]) -> bool { if self.stack.len() < rhs.len() { return false; } for (i, r) in rhs.iter().enumerate() { - if &self.get(i) != r { return false; } + if self.get(i) != *r { return false; } } true } @@ -1345,7 +1345,7 @@ impl Stack { if self.stack.len() < rhs.len() { return false; } let offset = self.stack.len() - rhs.len(); for (i, r) in rhs.iter().enumerate() { - if &self.get(i + offset) != r { return false; } + if self.get(i + offset) != *r { return false; } } true } diff --git a/src/libstd/sys/unix/os.rs b/src/libstd/sys/unix/os.rs index af0d8da05f4..15f04d37674 100644 --- a/src/libstd/sys/unix/os.rs +++ b/src/libstd/sys/unix/os.rs @@ -141,8 +141,7 @@ pub fn split_paths(unparsed: &OsStr) -> SplitPaths { fn is_colon(b: &u8) -> bool { *b == b':' } let unparsed = unparsed.as_bytes(); SplitPaths { - iter: unparsed.split(is_colon as fn(&u8) -> bool) - .map(bytes_to_path as fn(&[u8]) -> PathBuf) + iter: unparsed.split(is_colon).map(bytes_to_path) } } diff --git a/src/libtest/stats.rs b/src/libtest/stats.rs index 332d06bf465..b0d33f9e710 100644 --- a/src/libtest/stats.rs +++ b/src/libtest/stats.rs @@ -169,7 +169,6 @@ impl Stats for [f64] { // This inner loop applies `hi`/`lo` summation to each // partial so that the list of partial sums remains exact. for mut y in &mut partials { - let mut y: f64 = partials[i]; if x.abs() < y.abs() { mem::swap(&mut x, &mut y); }