test_node.py 5.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160
  1. import unittest
  2. from src.node import ExpressionNode as N, ExpressionLeaf as L, OP_ADD
  3. from tests.rulestestcase import tree
  4. class TestNode(unittest.TestCase):
  5. def setUp(self):
  6. self.l = [L(1), N('*', L(2), L(3)), L(4), L(5)]
  7. def test___lt__(self):
  8. self.assertTrue(L(1) < L(2))
  9. self.assertFalse(L(1) < L(1))
  10. self.assertFalse(L(2) < L(1))
  11. self.assertTrue(L(2) < N('+', L(1), L(2)))
  12. self.assertFalse(N('+', L(1), L(2)) < L(1))
  13. self.assertTrue(N('^', L('a'), L(2)) < N('^', L('a'), L(3)))
  14. self.assertTrue(N('^', L(2), L('a')) < N('^', L(3), L('a')))
  15. self.assertTrue(N('*', L(2), N('^', L('a'), L('b')))
  16. < N('*', L(3), N('^', L('a'), L('b'))))
  17. self.assertFalse(N('^', L('a'), L(3)) < N('^', L('a'), L(2)))
  18. def test_is_op(self):
  19. self.assertTrue(N('+', *self.l[:2]).is_op(OP_ADD))
  20. self.assertFalse(N('-', *self.l[:2]).is_op(OP_ADD))
  21. def test_is_op_or_negated(self):
  22. self.assertTrue(N('+', *self.l[:2]).is_op_or_negated(OP_ADD))
  23. self.assertTrue(N('-', N('+', *self.l[:2])).is_op_or_negated(OP_ADD))
  24. self.assertFalse(N('-', *self.l[:2]).is_op_or_negated(OP_ADD))
  25. def test_is_leaf(self):
  26. self.assertTrue(L(2).is_leaf())
  27. self.assertFalse(N('+', *self.l[:2]).is_leaf())
  28. def test_is_leaf_or_negated(self):
  29. self.assertTrue(L(2).is_leaf_or_negated())
  30. self.assertTrue(N('-', L(2)).is_leaf_or_negated())
  31. self.assertFalse(N('+', *self.l[:2]).is_leaf_or_negated())
  32. self.assertFalse(N('-', N('+', *self.l[:2])).is_leaf_or_negated())
  33. def test_is_power(self):
  34. self.assertTrue(N('^', *self.l[:2]).is_power())
  35. self.assertFalse(N('+', *self.l[:2]).is_power())
  36. def test_is_nary(self):
  37. self.assertTrue(N('+', *self.l[:2]).is_nary())
  38. self.assertTrue(N('-', *self.l[:2]).is_nary())
  39. self.assertTrue(N('*', *self.l[:2]).is_nary())
  40. self.assertFalse(N('^', *self.l[:2]).is_nary())
  41. def test_is_identifier(self):
  42. self.assertTrue(L('a').is_identifier())
  43. self.assertFalse(L(1).is_identifier())
  44. def test_is_int(self):
  45. self.assertTrue(L(1).is_int())
  46. self.assertFalse(L(1.5).is_int())
  47. self.assertFalse(L('a').is_int())
  48. def test_is_float(self):
  49. self.assertTrue(L(1.5).is_float())
  50. self.assertFalse(L(1).is_float())
  51. self.assertFalse(L('a').is_float())
  52. def test_is_numeric(self):
  53. self.assertTrue(L(1).is_numeric())
  54. self.assertTrue(L(1.5).is_numeric())
  55. self.assertFalse(L('a').is_numeric())
  56. def test_extract_polynome_properties_identifier(self):
  57. self.assertEqual(L('a').extract_polynome_properties(),
  58. (L(1), L('a'), L(1)))
  59. def test_extract_polynome_properties_None(self):
  60. self.assertIsNone(N('+').extract_polynome_properties())
  61. def test_extract_polynome_properties_power(self):
  62. power = N('^', L('a'), L(2))
  63. self.assertEqual(power.extract_polynome_properties(),
  64. (L(1), L('a'), L(2)))
  65. def test_extract_polynome_properties_coefficient_exponent_int(self):
  66. times = N('*', L(3), N('^', L('a'), L(2)))
  67. self.assertEqual(times.extract_polynome_properties(),
  68. (L(3), L('a'), L(2)))
  69. def test_extract_polynome_properties_coefficient_exponent_id(self):
  70. times = N('*', L(3), N('^', L('a'), L('b')))
  71. self.assertEqual(times.extract_polynome_properties(),
  72. (L(3), L('a'), L('b')))
  73. def test_get_scope_binary(self):
  74. plus = N('+', *self.l[:2])
  75. self.assertEqual(plus.get_scope(), self.l[:2])
  76. def test_get_scope_nested_left(self):
  77. plus = N('+', N('+', *self.l[:2]), self.l[2])
  78. self.assertEqual(plus.get_scope(), self.l[:3])
  79. def test_get_scope_nested_right(self):
  80. plus = N('+', self.l[0], N('+', *self.l[1:3]))
  81. self.assertEqual(plus.get_scope(), self.l[:3])
  82. def test_get_scope_nested_deep(self):
  83. plus = N('+', N('+', N('+', *self.l[:2]), self.l[2]), self.l[3])
  84. self.assertEqual(plus.get_scope(), self.l)
  85. def test_equals_node_leaf(self):
  86. a, b = plus = tree('a + b')
  87. self.assertFalse(a.equals(plus))
  88. self.assertFalse(plus.equals(a))
  89. def test_equals_other_op(self):
  90. plus, mul = tree('a + b, a * b')
  91. self.assertFalse(plus.equals(mul))
  92. def test_equals_add(self):
  93. p0, p1, p2, p3 = tree('a + b,a + b,b + a, a + c')
  94. self.assertTrue(p0.equals(p1))
  95. self.assertTrue(p0.equals(p2))
  96. self.assertFalse(p0.equals(p3))
  97. self.assertFalse(p2.equals(p3))
  98. def test_equals_mul(self):
  99. m0, m1, m2, m3 = tree('a * b,a * b,b * a, a * c')
  100. self.assertTrue(m0.equals(m1))
  101. self.assertTrue(m0.equals(m2))
  102. self.assertFalse(m0.equals(m3))
  103. self.assertFalse(m2.equals(m3))
  104. def test_equals_nary(self):
  105. p0, p1, p2, p3, p4 = \
  106. tree('a + b + c,a + c + b,b + a + c,b + c + a, a + b + d')
  107. self.assertTrue(p0.equals(p1))
  108. self.assertTrue(p0.equals(p2))
  109. self.assertTrue(p0.equals(p3))
  110. self.assertTrue(p1.equals(p2))
  111. self.assertTrue(p1.equals(p3))
  112. self.assertTrue(p2.equals(p3))
  113. self.assertFalse(p2.equals(p4))
  114. def test_equals_nary_mary(self):
  115. m0, m1 = tree('ab,2ab')
  116. self.assertFalse(m0.equals(m1))
  117. def test_equals_div(self):
  118. d0, d1, d2 = tree('a / b,a / b,b / a')
  119. self.assertTrue(d0.equals(d1))
  120. self.assertFalse(d0.equals(d2))