(*args)
| 31 | return s1 |
| 32 | |
| 33 | def _common_shorten_repr(*args): |
| 34 | args = tuple(map(safe_repr, args)) |
| 35 | maxlen = max(map(len, args)) |
| 36 | if maxlen <= _MAX_LENGTH: |
| 37 | return args |
| 38 | |
| 39 | prefix = _common_prefix(args) |
| 40 | prefixlen = len(prefix) |
| 41 | |
| 42 | common_len = _MAX_LENGTH - \ |
| 43 | (maxlen - prefixlen + _MIN_BEGIN_LEN + _PLACEHOLDER_LEN) |
| 44 | if common_len > _MIN_COMMON_LEN: |
| 45 | assert _MIN_BEGIN_LEN + _PLACEHOLDER_LEN + _MIN_COMMON_LEN + \ |
| 46 | (maxlen - prefixlen) < _MAX_LENGTH |
| 47 | prefix = _shorten(prefix, _MIN_BEGIN_LEN, common_len) |
| 48 | return tuple(prefix + s[prefixlen:] for s in args) |
| 49 | |
| 50 | prefix = _shorten(prefix, _MIN_BEGIN_LEN, _MIN_COMMON_LEN) |
| 51 | return tuple(prefix + _shorten(s[prefixlen:], _MIN_DIFF_LEN, _MIN_END_LEN) |
| 52 | for s in args) |
| 53 | |
| 54 | def safe_repr(obj, short=False): |
| 55 | try: |
searching dependent graphs…