2011-06-15 13:19:50 -05:00
|
|
|
|
|
|
|
|
2011-09-12 04:27:30 -05:00
|
|
|
fn id<@T>(x: T) -> T { ret x; }
|
2011-06-15 13:19:50 -05:00
|
|
|
|
2010-06-29 01:18:51 -05:00
|
|
|
|
2010-08-03 19:52:35 -05:00
|
|
|
/* FIXME (issue #141): See test/run-pass/constrained-type.rs. Uncomment
|
|
|
|
* the constraint once fixed. */
|
2011-07-27 07:19:39 -05:00
|
|
|
type rational = {num: int, den: int};
|
2010-08-03 19:52:35 -05:00
|
|
|
|
2011-06-16 18:55:46 -05:00
|
|
|
|
|
|
|
// : int::positive(*.den);
|
2011-09-12 04:27:30 -05:00
|
|
|
fn rational_leq(x: rational, y: rational) -> bool {
|
2011-05-12 10:24:54 -05:00
|
|
|
// NB: Uses the fact that rationals have positive denominators WLOG:
|
2010-09-22 17:44:13 -05:00
|
|
|
|
2011-06-15 13:19:50 -05:00
|
|
|
ret x.num * y.den <= y.num * x.den;
|
2011-04-06 19:56:44 -05:00
|
|
|
}
|
|
|
|
|
2011-09-12 04:27:30 -05:00
|
|
|
fn orb(a: bool, b: bool) -> bool { ret a || b; }
|
2010-09-22 17:44:13 -05:00
|
|
|
// Local Variables:
|
|
|
|
// mode: rust;
|
|
|
|
// fill-column: 78;
|
|
|
|
// indent-tabs-mode: nil
|
|
|
|
// c-basic-offset: 4
|
|
|
|
// buffer-file-coding-system: utf-8-unix
|
2011-06-15 14:01:19 -05:00
|
|
|
// compile-command: "make -k -C $RBUILD 2>&1 | sed -e 's/\\/x\\//x:\\//g'";
|
2010-09-22 17:44:13 -05:00
|
|
|
// End:
|