Return the common prefix of all 'names
(names)
| 190 | |
| 191 | |
| 192 | def commonprefix(names): |
| 193 | """Return the common prefix of all 'names'""" |
| 194 | if not names: |
| 195 | return '' |
| 196 | s1 = min(names) |
| 197 | s2 = max(names) |
| 198 | for i, c in enumerate(s1): |
| 199 | if c != s2[i]: |
| 200 | return s1[:i] |
| 201 | return s1 |
searching dependent graphs…