107108109110111112113114
assertTrue(tree instanceof Binary); } @Test public void testBinOpBitwiseAnd() throws RecognitionException { HaxeTree tree = parseExpression("x&y"); assertTrue(tree instanceof Binary); }
113114115116117118119120
assertTrue(tree instanceof Binary); } @Test public void testBinOpBitwiseNot() throws RecognitionException { HaxeTree tree = parseExpression("x^y"); assertTrue(tree instanceof Binary); }
120121122123124125126127
} //COMPARISONS @Test public void testBinOpEquals() throws RecognitionException { HaxeTree tree = parseExpression("x==y"); assertTrue(tree instanceof Binary); }
126127128129130131132133
assertTrue(tree instanceof Binary); } @Test public void testBinOpNotEqual() throws RecognitionException { HaxeTree tree = parseExpression("x!=y"); assertTrue(tree instanceof Binary); }
132133134135136137138139
assertTrue(tree instanceof Binary); } @Test public void testBinOpBigger() throws RecognitionException { HaxeTree tree = parseExpression("x>y"); assertTrue(tree instanceof Binary); }
138139140141142143144145
assertTrue(tree instanceof Binary); } @Test public void testBinOpLess() throws RecognitionException { HaxeTree tree = parseExpression("x<y"); assertTrue(tree instanceof Binary); }
144145146147148149150151
assertTrue(tree instanceof Binary); } @Test public void testBinOpBiggerOrEqual() throws RecognitionException { HaxeTree tree = parseExpression("x>=y"); assertTrue(tree instanceof Binary); }
150151152153154155156157
assertTrue(tree instanceof Binary); } @Test public void testBinOpLessOrEqual() throws RecognitionException { HaxeTree tree = parseExpression("x<=y"); assertTrue(tree instanceof Binary); }
157158159160161162163164
} //Boolean @Test public void testBinOpAnd() throws RecognitionException { HaxeTree tree = parseExpression("x&&y"); assertTrue(tree instanceof Binary); }
163164165166167168169170
assertTrue(tree instanceof Binary); } @Test public void testBinOpOr() throws RecognitionException { HaxeTree tree = parseExpression("x||y"); assertTrue(tree instanceof Binary); }