test_node.py 6.7 KB

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