diff options
| author | Alex Crichton <alex@alexcrichton.com> | 2014-02-28 01:23:06 -0800 |
|---|---|---|
| committer | Alex Crichton <alex@alexcrichton.com> | 2014-02-28 23:01:54 -0800 |
| commit | 02882fbd7edcb8d0d152afcdc8571216efcbd664 (patch) | |
| tree | ab893c74b3fdd3d58394e8dd9d74561adfe3326b /src/libcollections/ringbuf.rs | |
| parent | 123eb4ebea695f724a2375a73db53b91273e5ce0 (diff) | |
| download | rust-02882fbd7edcb8d0d152afcdc8571216efcbd664.tar.gz rust-02882fbd7edcb8d0d152afcdc8571216efcbd664.zip | |
std: Change assert_eq!() to use {} instead of {:?}
Formatting via reflection has been a little questionable for some time now, and
it's a little unfortunate that one of the standard macros will silently use
reflection when you weren't expecting it. This adds small bits of code bloat to
libraries, as well as not always being necessary. In light of this information,
this commit switches assert_eq!() to using {} in the error message instead of
{:?}.
In updating existing code, there were a few error cases that I encountered:
* It's impossible to define Show for [T, ..N]. I think DST will alleviate this
because we can define Show for [T].
* A few types here and there just needed a #[deriving(Show)]
* Type parameters needed a Show bound, I often moved this to `assert!(a == b)`
* `Path` doesn't implement `Show`, so assert_eq!() cannot be used on two paths.
I don't think this is much of a regression though because {:?} on paths looks
awful (it's a byte array).
Concretely speaking, this shaved 10K off a 656K binary. Not a lot, but sometime
significant for smaller binaries.
Diffstat (limited to 'src/libcollections/ringbuf.rs')
| -rw-r--r-- | src/libcollections/ringbuf.rs | 15 |
1 files changed, 8 insertions, 7 deletions
diff --git a/src/libcollections/ringbuf.rs b/src/libcollections/ringbuf.rs index 4b97bfbd18d..e09bf1023d6 100644 --- a/src/libcollections/ringbuf.rs +++ b/src/libcollections/ringbuf.rs @@ -409,6 +409,7 @@ mod tests { use deque::Deque; use std::clone::Clone; use std::cmp::Eq; + use std::fmt::Show; use super::RingBuf; #[test] @@ -493,7 +494,7 @@ mod tests { } #[cfg(test)] - fn test_parameterized<T:Clone + Eq>(a: T, b: T, c: T, d: T) { + fn test_parameterized<T:Clone + Eq + Show>(a: T, b: T, c: T, d: T) { let mut deq = RingBuf::new(); assert_eq!(deq.len(), 0); deq.push_front(a.clone()); @@ -578,21 +579,21 @@ mod tests { }) } - #[deriving(Clone, Eq)] + #[deriving(Clone, Eq, Show)] enum Taggy { One(int), Two(int, int), Three(int, int, int), } - #[deriving(Clone, Eq)] + #[deriving(Clone, Eq, Show)] enum Taggypar<T> { Onepar(int), Twopar(int, int), Threepar(int, int, int), } - #[deriving(Clone, Eq)] + #[deriving(Clone, Eq, Show)] struct RecCy { x: int, y: int, @@ -812,7 +813,7 @@ mod tests { #[test] fn test_eq() { let mut d = RingBuf::new(); - assert_eq!(&d, &RingBuf::with_capacity(0)); + assert!(d == RingBuf::with_capacity(0)); d.push_front(137); d.push_front(17); d.push_front(42); @@ -822,11 +823,11 @@ mod tests { e.push_back(17); e.push_back(137); e.push_back(137); - assert_eq!(&e, &d); + assert!(&e == &d); e.pop_back(); e.push_back(0); assert!(e != d); e.clear(); - assert_eq!(e, RingBuf::new()); + assert!(e == RingBuf::new()); } } |
