02882fbd7e
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.
50 lines
1.4 KiB
Rust
50 lines
1.4 KiB
Rust
// Copyright 2012 The Rust Project Developers. See the COPYRIGHT
|
|
// file at the top-level directory of this distribution and at
|
|
// http://rust-lang.org/COPYRIGHT.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
|
// option. This file may not be copied, modified, or distributed
|
|
// except according to those terms.
|
|
|
|
use std::cmp::Eq;
|
|
|
|
trait MyNum : Add<Self,Self> + Sub<Self,Self> + Mul<Self,Self> + Eq { }
|
|
|
|
#[deriving(Show)]
|
|
struct MyInt { val: int }
|
|
|
|
impl Add<MyInt, MyInt> for MyInt {
|
|
fn add(&self, other: &MyInt) -> MyInt { mi(self.val + other.val) }
|
|
}
|
|
|
|
impl Sub<MyInt, MyInt> for MyInt {
|
|
fn sub(&self, other: &MyInt) -> MyInt { mi(self.val - other.val) }
|
|
}
|
|
|
|
impl Mul<MyInt, MyInt> for MyInt {
|
|
fn mul(&self, other: &MyInt) -> MyInt { mi(self.val * other.val) }
|
|
}
|
|
|
|
impl Eq for MyInt {
|
|
fn eq(&self, other: &MyInt) -> bool { self.val == other.val }
|
|
fn ne(&self, other: &MyInt) -> bool { !self.eq(other) }
|
|
}
|
|
|
|
impl MyNum for MyInt {}
|
|
|
|
fn f<T:MyNum>(x: T, y: T) -> (T, T, T) {
|
|
return (x + y, x - y, x * y);
|
|
}
|
|
|
|
fn mi(v: int) -> MyInt { MyInt { val: v } }
|
|
|
|
pub fn main() {
|
|
let (x, y) = (mi(3), mi(5));
|
|
let (a, b, c) = f(x, y);
|
|
assert_eq!(a, mi(8));
|
|
assert_eq!(b, mi(-2));
|
|
assert_eq!(c, mi(15));
|
|
}
|