From: blake2-ppc Date: Tue, 6 Aug 2013 15:27:39 +0000 (+0200) Subject: extra: Simplify Eq/Ord in treemap X-Git-Url: https://git.lizzy.rs/?a=commitdiff_plain;h=4ab05f91f49b1248aab7d21630cfb38d6dafacfa;p=rust.git extra: Simplify Eq/Ord in treemap Write the Eq and Ord impls for TreeMap in a more straightforward way using iterator::Zip --- diff --git a/src/libextra/treemap.rs b/src/libextra/treemap.rs index ab7d47255da..2e20752754a 100644 --- a/src/libextra/treemap.rs +++ b/src/libextra/treemap.rs @@ -42,39 +42,23 @@ pub struct TreeMap { impl Eq for TreeMap { fn eq(&self, other: &TreeMap) -> bool { - if self.len() != other.len() { - false - } else { - let mut x = self.iter(); - let mut y = other.iter(); - for _ in range(0u, self.len()) { - if x.next().unwrap() != y.next().unwrap() { - return false - } - } - true - } + self.len() == other.len() && + self.iter().zip(other.iter()).all(|(a, b)| a == b) } - fn ne(&self, other: &TreeMap) -> bool { !self.eq(other) } } // Lexicographical comparison fn lt(a: &TreeMap, b: &TreeMap) -> bool { - let mut x = a.iter(); - let mut y = b.iter(); - - let (a_len, b_len) = (a.len(), b.len()); - for _ in range(0u, num::min(a_len, b_len)) { - let (key_a, value_a) = x.next().unwrap(); - let (key_b, value_b) = y.next().unwrap(); + // the Zip iterator is as long as the shortest of a and b. + for ((key_a, value_a), (key_b, value_b)) in a.iter().zip(b.iter()) { if *key_a < *key_b { return true; } if *key_a > *key_b { return false; } if *value_a < *value_b { return true; } if *value_a > *value_b { return false; } } - a_len < b_len + a.len() < b.len() } impl Ord for TreeMap {