|
| 1 | +"""Tests for function features — defaults, varargs, kwargs, closures, recursion""" |
| 2 | + |
| 3 | +import unittest |
| 4 | + |
| 5 | + |
| 6 | +class FunctionBasicTest(unittest.TestCase): |
| 7 | + |
| 8 | + def test_no_args(self): |
| 9 | + def f(): |
| 10 | + return 42 |
| 11 | + self.assertEqual(f(), 42) |
| 12 | + |
| 13 | + def test_positional(self): |
| 14 | + def f(a, b, c): |
| 15 | + return a + b + c |
| 16 | + self.assertEqual(f(1, 2, 3), 6) |
| 17 | + |
| 18 | + def test_default_args(self): |
| 19 | + def f(a, b=10, c=20): |
| 20 | + return a + b + c |
| 21 | + self.assertEqual(f(1), 31) |
| 22 | + self.assertEqual(f(1, 2), 23) |
| 23 | + self.assertEqual(f(1, 2, 3), 6) |
| 24 | + |
| 25 | + def test_keyword_args(self): |
| 26 | + def f(a, b=0, c=0): |
| 27 | + return (a, b, c) |
| 28 | + self.assertEqual(f(1, c=3), (1, 0, 3)) |
| 29 | + self.assertEqual(f(1, b=2, c=3), (1, 2, 3)) |
| 30 | + |
| 31 | + def test_keyword_only(self): |
| 32 | + def f(a, *, b, c=10): |
| 33 | + return a + b + c |
| 34 | + self.assertEqual(f(1, b=2), 13) |
| 35 | + self.assertEqual(f(1, b=2, c=3), 6) |
| 36 | + |
| 37 | + def test_varargs(self): |
| 38 | + def f(*args): |
| 39 | + return args |
| 40 | + self.assertEqual(f(), ()) |
| 41 | + self.assertEqual(f(1, 2, 3), (1, 2, 3)) |
| 42 | + |
| 43 | + def test_kwargs(self): |
| 44 | + def f(**kw): |
| 45 | + return sorted(kw.items()) |
| 46 | + self.assertEqual(f(a=1, b=2), [('a', 1), ('b', 2)]) |
| 47 | + |
| 48 | + def test_mixed(self): |
| 49 | + def f(a, b, *args, **kw): |
| 50 | + return (a, b, args, sorted(kw.items())) |
| 51 | + result = f(1, 2, 3, 4, x=5) |
| 52 | + self.assertEqual(result, (1, 2, (3, 4), [('x', 5)])) |
| 53 | + |
| 54 | + def test_return_none(self): |
| 55 | + def f(): |
| 56 | + pass |
| 57 | + self.assertIsNone(f()) |
| 58 | + |
| 59 | + def test_multiple_return(self): |
| 60 | + def f(): |
| 61 | + return 1, 2, 3 |
| 62 | + a, b, c = f() |
| 63 | + self.assertEqual((a, b, c), (1, 2, 3)) |
| 64 | + |
| 65 | + |
| 66 | +class RecursionTest(unittest.TestCase): |
| 67 | + |
| 68 | + def test_factorial(self): |
| 69 | + def fact(n): |
| 70 | + if n <= 1: |
| 71 | + return 1 |
| 72 | + return n * fact(n - 1) |
| 73 | + self.assertEqual(fact(10), 3628800) |
| 74 | + |
| 75 | + def test_fibonacci(self): |
| 76 | + def fib(n): |
| 77 | + if n < 2: |
| 78 | + return n |
| 79 | + return fib(n - 1) + fib(n - 2) |
| 80 | + self.assertEqual(fib(10), 55) |
| 81 | + |
| 82 | + def test_mutual_recursion(self): |
| 83 | + def is_even(n): |
| 84 | + if n == 0: |
| 85 | + return True |
| 86 | + return is_odd(n - 1) |
| 87 | + def is_odd(n): |
| 88 | + if n == 0: |
| 89 | + return False |
| 90 | + return is_even(n - 1) |
| 91 | + self.assertTrue(is_even(10)) |
| 92 | + self.assertFalse(is_even(11)) |
| 93 | + self.assertTrue(is_odd(7)) |
| 94 | + |
| 95 | + |
| 96 | +class HigherOrderTest(unittest.TestCase): |
| 97 | + |
| 98 | + def test_function_as_arg(self): |
| 99 | + def apply(f, x): |
| 100 | + return f(x) |
| 101 | + self.assertEqual(apply(str, 42), "42") |
| 102 | + self.assertEqual(apply(len, [1, 2, 3]), 3) |
| 103 | + |
| 104 | + def test_function_as_return(self): |
| 105 | + def make_adder(n): |
| 106 | + def adder(x): |
| 107 | + return x + n |
| 108 | + return adder |
| 109 | + add10 = make_adder(10) |
| 110 | + self.assertEqual(add10(5), 15) |
| 111 | + |
| 112 | + def test_map(self): |
| 113 | + result = list(map(lambda x: x * 2, [1, 2, 3])) |
| 114 | + self.assertEqual(result, [2, 4, 6]) |
| 115 | + |
| 116 | + def test_filter(self): |
| 117 | + result = list(filter(lambda x: x > 2, [1, 2, 3, 4, 5])) |
| 118 | + self.assertEqual(result, [3, 4, 5]) |
| 119 | + |
| 120 | + def test_sorted_key(self): |
| 121 | + data = ["banana", "apple", "cherry"] |
| 122 | + result = sorted(data, key=len) |
| 123 | + self.assertEqual(result, ["apple", "banana", "cherry"]) |
| 124 | + |
| 125 | + |
| 126 | +if __name__ == "__main__": |
| 127 | + unittest.main() |
0 commit comments