test_line.py 2.9 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192
  1. import unittest
  2. from node import Node as N, Leaf as L
  3. from line import generate_line
  4. class TestLine(unittest.TestCase):
  5. def test_empty(self):
  6. self.assertEquals(generate_line(None), '<empty expression>')
  7. def test_simple(self):
  8. l0, l1 = L(1), L(2)
  9. plus = N('+', l0, l1)
  10. self.assertEquals(generate_line(plus), '1 + 2')
  11. def test_parentheses(self):
  12. l0, l1 = L(1), L(2)
  13. plus = N('+', l0, l1)
  14. times = N('*', plus, plus)
  15. self.assertEquals(generate_line(times), '(1 + 2) * (1 + 2)')
  16. def test_parentheses_equal_precedence(self):
  17. l0, l1, l2 = L(1), L(2), L(3)
  18. plus = N('+', l1, l2)
  19. minus = N('-', l0, plus)
  20. self.assertEquals(generate_line(minus), '1 - (2 + 3)')
  21. def test_parentheses_nary(self):
  22. l0, l1, l2 = L(1), L(2), L(3)
  23. plus = N('+', N('+', l0, l1), l2)
  24. self.assertEquals(generate_line(plus), '1 + 2 + 3')
  25. def test_function(self):
  26. exp = L('x')
  27. inf = L('oo')
  28. minus_inf = N('-', inf)
  29. integral = N('int', exp, minus_inf, inf)
  30. self.assertEquals(generate_line(integral), 'int(x, -oo, oo)')
  31. def test_mod(self):
  32. l0, l1 = L(1), L(2)
  33. mod = N('mod', l1, l0)
  34. self.assertEquals(generate_line(mod), '2 mod 1')
  35. def test_multiplication_identifiers(self):
  36. a, b = L('a'), L('b')
  37. mul = N('*', a, b)
  38. self.assertEquals(generate_line(mul), 'ab')
  39. def test_multiplication_constant_identifier(self):
  40. l0, a = L(2), L('a')
  41. mul = N('*', l0, a)
  42. self.assertEquals(generate_line(mul), '2a')
  43. def test_multiplication_identifier_constant(self):
  44. l0, a = L(2), L('a')
  45. mul = N('*', a, l0)
  46. self.assertEquals(generate_line(mul), 'a * 2')
  47. def test_multiplication_constants(self):
  48. l0, l1 = L(1), L(2)
  49. mul = N('*', l0, l1)
  50. self.assertEquals(generate_line(mul), '1 * 2')
  51. def test_nary(self):
  52. l0, l1, l2 = L(1), L(2), L(3)
  53. plus = N('+', l0, l1, l2)
  54. self.assertEquals(generate_line(plus), '1 + 2 + 3')
  55. def test_pow_basic(self):
  56. a, b, c = L('a'), L('b'), L('c')
  57. node_pow = N('^', a, N('+', b, c))
  58. self.assertEquals(generate_line(node_pow), 'a ^ (b + c)')
  59. def test_pow_intermediate1(self):
  60. # expression: (a(b+c))^(d+e)
  61. a, b, c, d, e = L('a'), L('b'), L('c'), L('d'), L('e')
  62. node_bc = N('+', b, c)
  63. node_de = N('+', d, e)
  64. node_mul = N('*', a, node_bc)
  65. node_pow = N('^', node_mul, node_de)
  66. self.assertEquals(generate_line(node_pow), '(a(b + c)) ^ (d + e)')
  67. def test_pow_intermediate2(self):
  68. # expression: a(b+c)^(d+e)
  69. a, b, c, d, e = L('a'), L('b'), L('c'), L('d'), L('e')
  70. node_bc = N('+', b, c)
  71. node_de = N('+', d, e)
  72. node_pow = N('^', node_bc, node_de)
  73. node_mul = N('*', a, node_pow)
  74. self.assertEquals(generate_line(node_mul), 'a(b + c) ^ (d + e)')