(m)
| 21 | return s |
| 22 | |
| 23 | def _common_prefix(m): |
| 24 | if not m: |
| 25 | return "" |
| 26 | s1 = min(m) |
| 27 | s2 = max(m) |
| 28 | for i, c in enumerate(s1): |
| 29 | if c != s2[i]: |
| 30 | return s1[:i] |
| 31 | return s1 |
| 32 | |
| 33 | def _common_shorten_repr(*args): |
| 34 | args = tuple(map(safe_repr, args)) |
no test coverage detected
searching dependent graphs…