(actual: list[str], expected_order: list[str])
| 135 | |
| 136 | |
| 137 | def match_module_order(actual: list[str], expected_order: list[str]) -> list[str]: |
| 138 | actual_by_mod = defaultdict(list) |
| 139 | actual_order = module_order(actual) |
| 140 | if set(actual_order) != set(expected_order): |
| 141 | # Different files, give up and show actual errors. |
| 142 | return actual |
| 143 | for a in actual: |
| 144 | mod, _ = a.split(":", maxsplit=1) |
| 145 | actual_by_mod[mod].append(a) |
| 146 | result = [] |
| 147 | for mod in expected_order: |
| 148 | result.extend(actual_by_mod[mod]) |
| 149 | return result |
| 150 | |
| 151 | |
| 152 | def assert_string_arrays_equal( |
no test coverage detected
searching dependent graphs…