2017-09-18 05:47:33 -05:00
|
|
|
|
|
|
|
|
2015-04-30 04:48:43 -05:00
|
|
|
|
2017-05-17 07:19:44 -05:00
|
|
|
#[warn(eq_op)]
|
2017-04-28 10:07:39 -05:00
|
|
|
#[allow(identity_op, double_parens, many_single_char_names)]
|
2016-12-29 17:00:55 -06:00
|
|
|
#[allow(no_effect, unused_variables, unnecessary_operation, short_circuit_statement)]
|
2017-05-17 07:19:44 -05:00
|
|
|
#[warn(nonminimal_bool)]
|
2015-04-30 04:48:43 -05:00
|
|
|
fn main() {
|
2015-08-11 13:22:20 -05:00
|
|
|
// simple values and comparisons
|
2017-02-08 07:58:07 -06:00
|
|
|
1 == 1;
|
|
|
|
"no" == "no";
|
2015-08-11 13:22:20 -05:00
|
|
|
// even though I agree that no means no ;-)
|
2017-02-08 07:58:07 -06:00
|
|
|
false != false;
|
|
|
|
1.5 < 1.5;
|
|
|
|
1u64 >= 1u64;
|
2015-08-11 13:22:20 -05:00
|
|
|
|
2015-08-13 02:44:03 -05:00
|
|
|
// casts, methods, parentheses
|
2017-02-08 07:58:07 -06:00
|
|
|
(1 as u64) & (1 as u64);
|
|
|
|
1 ^ ((((((1))))));
|
2015-08-11 13:22:20 -05:00
|
|
|
|
|
|
|
// unary and binary operators
|
2017-02-08 07:58:07 -06:00
|
|
|
(-(2) < -(2));
|
2015-04-30 04:48:43 -05:00
|
|
|
((1 + 1) & (1 + 1) == (1 + 1) & (1 + 1));
|
2017-02-08 07:58:07 -06:00
|
|
|
(1 * 2) + (3 * 4) == 1 * 2 + 3 * 4;
|
2015-08-11 13:22:20 -05:00
|
|
|
|
|
|
|
// various other things
|
2017-02-08 07:58:07 -06:00
|
|
|
([1] != [1]);
|
|
|
|
((1, 2) != (1, 2));
|
2015-04-30 04:48:43 -05:00
|
|
|
vec![1, 2, 3] == vec![1, 2, 3]; //no error yet, as we don't match macros
|
2015-08-21 05:26:03 -05:00
|
|
|
|
|
|
|
// const folding
|
2017-02-08 07:58:07 -06:00
|
|
|
1 + 1 == 2;
|
|
|
|
1 - 1 == 0;
|
|
|
|
|
|
|
|
1 - 1;
|
|
|
|
1 / 1;
|
|
|
|
true && true;
|
|
|
|
|
|
|
|
true || true;
|
2016-02-03 13:42:05 -06:00
|
|
|
|
2016-01-30 13:10:14 -06:00
|
|
|
|
2016-11-16 14:57:56 -06:00
|
|
|
let a: u32 = 0;
|
|
|
|
let b: u32 = 0;
|
2016-03-24 10:11:38 -05:00
|
|
|
|
2017-02-08 07:58:07 -06:00
|
|
|
a == b && b == a;
|
|
|
|
a != b && b != a;
|
|
|
|
a < b && b > a;
|
|
|
|
a <= b && b >= a;
|
|
|
|
|
2016-01-30 13:10:14 -06:00
|
|
|
let mut a = vec![1];
|
2017-02-08 07:58:07 -06:00
|
|
|
a == a;
|
2016-01-30 13:10:14 -06:00
|
|
|
2*a.len() == 2*a.len(); // ok, functions
|
|
|
|
a.pop() == a.pop(); // ok, functions
|
2017-04-28 10:07:39 -05:00
|
|
|
|
|
|
|
use std::ops::BitAnd;
|
|
|
|
struct X(i32);
|
|
|
|
impl BitAnd for X {
|
|
|
|
type Output = X;
|
|
|
|
fn bitand(self, rhs: X) -> X {
|
|
|
|
X(self.0 & rhs.0)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
impl<'a> BitAnd<&'a X> for X {
|
|
|
|
type Output = X;
|
|
|
|
fn bitand(self, rhs: &'a X) -> X {
|
|
|
|
X(self.0 & rhs.0)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
let x = X(1);
|
|
|
|
let y = X(2);
|
|
|
|
let z = x & &y;
|
|
|
|
|
|
|
|
#[derive(Copy, Clone)]
|
|
|
|
struct Y(i32);
|
|
|
|
impl BitAnd for Y {
|
|
|
|
type Output = Y;
|
|
|
|
fn bitand(self, rhs: Y) -> Y {
|
|
|
|
Y(self.0 & rhs.0)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
impl<'a> BitAnd<&'a Y> for Y {
|
|
|
|
type Output = Y;
|
|
|
|
fn bitand(self, rhs: &'a Y) -> Y {
|
|
|
|
Y(self.0 & rhs.0)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
let x = Y(1);
|
|
|
|
let y = Y(2);
|
|
|
|
let z = x & &y;
|
2017-12-22 12:37:44 -06:00
|
|
|
|
|
|
|
check_ignore_macro();
|
2018-03-23 13:26:52 -05:00
|
|
|
|
|
|
|
// named constants
|
|
|
|
const A: u32 = 10;
|
|
|
|
const B: u32 = 10;
|
|
|
|
const C: u32 = A / B; // ok, different named constants
|
|
|
|
const D: u32 = A / A;
|
2017-12-22 12:37:44 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
macro_rules! check_if_named_foo {
|
|
|
|
($expression:expr) => (
|
|
|
|
if stringify!($expression) == "foo" {
|
|
|
|
println!("foo!");
|
|
|
|
} else {
|
|
|
|
println!("not foo.");
|
|
|
|
}
|
|
|
|
)
|
|
|
|
}
|
|
|
|
|
|
|
|
fn check_ignore_macro() {
|
|
|
|
check_if_named_foo!(foo);
|
2015-04-30 04:48:43 -05:00
|
|
|
}
|