|
| 1 | +"""Tests for data structure operations — mixed-type scenarios""" |
| 2 | + |
| 3 | +import unittest |
| 4 | + |
| 5 | + |
| 6 | +class NestedStructTest(unittest.TestCase): |
| 7 | + |
| 8 | + def test_list_of_dicts(self): |
| 9 | + data = [{"name": "a", "val": 1}, {"name": "b", "val": 2}] |
| 10 | + self.assertEqual(data[0]["name"], "a") |
| 11 | + self.assertEqual(data[1]["val"], 2) |
| 12 | + |
| 13 | + def test_dict_of_lists(self): |
| 14 | + d = {"evens": [0, 2, 4], "odds": [1, 3, 5]} |
| 15 | + self.assertEqual(d["evens"][1], 2) |
| 16 | + self.assertEqual(d["odds"][2], 5) |
| 17 | + |
| 18 | + def test_nested_list(self): |
| 19 | + matrix = [[1, 2, 3], [4, 5, 6], [7, 8, 9]] |
| 20 | + flat = [x for row in matrix for x in row] |
| 21 | + self.assertEqual(flat, [1, 2, 3, 4, 5, 6, 7, 8, 9]) |
| 22 | + |
| 23 | + def test_list_of_tuples(self): |
| 24 | + pairs = [(1, 'a'), (2, 'b'), (3, 'c')] |
| 25 | + keys = [k for k, v in pairs] |
| 26 | + vals = [v for k, v in pairs] |
| 27 | + self.assertEqual(keys, [1, 2, 3]) |
| 28 | + self.assertEqual(vals, ['a', 'b', 'c']) |
| 29 | + |
| 30 | + def test_dict_from_zip(self): |
| 31 | + keys = ['a', 'b', 'c'] |
| 32 | + vals = [1, 2, 3] |
| 33 | + d = {} |
| 34 | + for k, v in zip(keys, vals): |
| 35 | + d[k] = v |
| 36 | + self.assertEqual(d['b'], 2) |
| 37 | + |
| 38 | + def test_set_from_list(self): |
| 39 | + data = [1, 2, 2, 3, 3, 3] |
| 40 | + unique = sorted(list(set(data))) |
| 41 | + self.assertEqual(unique, [1, 2, 3]) |
| 42 | + |
| 43 | + def test_stack(self): |
| 44 | + stack = [] |
| 45 | + stack.append(1) |
| 46 | + stack.append(2) |
| 47 | + stack.append(3) |
| 48 | + self.assertEqual(stack.pop(), 3) |
| 49 | + self.assertEqual(stack.pop(), 2) |
| 50 | + self.assertEqual(len(stack), 1) |
| 51 | + |
| 52 | + def test_queue_via_list(self): |
| 53 | + q = [] |
| 54 | + q.append("first") |
| 55 | + q.append("second") |
| 56 | + q.append("third") |
| 57 | + self.assertEqual(q.pop(0), "first") |
| 58 | + self.assertEqual(q.pop(0), "second") |
| 59 | + |
| 60 | + def test_frequency_count(self): |
| 61 | + text = "abracadabra" |
| 62 | + freq = {} |
| 63 | + for ch in text: |
| 64 | + freq[ch] = freq.get(ch, 0) + 1 |
| 65 | + self.assertEqual(freq['a'], 5) |
| 66 | + self.assertEqual(freq['b'], 2) |
| 67 | + |
| 68 | + def test_groupby_manual(self): |
| 69 | + data = [("a", 1), ("b", 2), ("a", 3), ("b", 4)] |
| 70 | + groups = {} |
| 71 | + for key, val in data: |
| 72 | + if key not in groups: |
| 73 | + groups[key] = [] |
| 74 | + groups[key].append(val) |
| 75 | + self.assertEqual(groups["a"], [1, 3]) |
| 76 | + self.assertEqual(groups["b"], [2, 4]) |
| 77 | + |
| 78 | + |
| 79 | +class SortingTest(unittest.TestCase): |
| 80 | + |
| 81 | + def test_sort_key(self): |
| 82 | + data = ["banana", "apple", "cherry"] |
| 83 | + data.sort(key=len) |
| 84 | + self.assertEqual(data, ["apple", "banana", "cherry"]) |
| 85 | + |
| 86 | + def test_sorted_key(self): |
| 87 | + data = [(3, "c"), (1, "a"), (2, "b")] |
| 88 | + result = sorted(data, key=lambda x: x[0]) |
| 89 | + self.assertEqual(result, [(1, "a"), (2, "b"), (3, "c")]) |
| 90 | + |
| 91 | + def test_reverse_sort(self): |
| 92 | + data = [3, 1, 4, 1, 5] |
| 93 | + self.assertEqual(sorted(data, reverse=True), [5, 4, 3, 1, 1]) |
| 94 | + |
| 95 | + def test_stable_sort(self): |
| 96 | + data = [(1, 'b'), (2, 'a'), (1, 'a'), (2, 'b')] |
| 97 | + result = sorted(data, key=lambda x: x[0]) |
| 98 | + self.assertEqual(result[0], (1, 'b')) |
| 99 | + self.assertEqual(result[1], (1, 'a')) |
| 100 | + |
| 101 | + |
| 102 | +if __name__ == "__main__": |
| 103 | + unittest.main() |
0 commit comments