| 1 | 1 | """Redo the builtin repr() (representation) but with limits on most sizes.""" |
|---|
| 2 | n/a | |
|---|
| 3 | 1 | __all__ = ["Repr","repr"] |
|---|
| 4 | n/a | |
|---|
| 5 | 1 | import __builtin__ |
|---|
| 6 | 1 | from itertools import islice |
|---|
| 7 | n/a | |
|---|
| 8 | 2 | class Repr: |
|---|
| 9 | n/a | |
|---|
| 10 | 1 | def __init__(self): |
|---|
| 11 | 5 | self.maxlevel = 6 |
|---|
| 12 | 5 | self.maxtuple = 6 |
|---|
| 13 | 5 | self.maxlist = 6 |
|---|
| 14 | 5 | self.maxarray = 5 |
|---|
| 15 | 5 | self.maxdict = 4 |
|---|
| 16 | 5 | self.maxset = 6 |
|---|
| 17 | 5 | self.maxfrozenset = 6 |
|---|
| 18 | 5 | self.maxdeque = 6 |
|---|
| 19 | 5 | self.maxstring = 30 |
|---|
| 20 | 5 | self.maxlong = 40 |
|---|
| 21 | 5 | self.maxother = 20 |
|---|
| 22 | n/a | |
|---|
| 23 | 1 | def repr(self, x): |
|---|
| 24 | 73 | return self.repr1(x, self.maxlevel) |
|---|
| 25 | n/a | |
|---|
| 26 | 1 | def repr1(self, x, level): |
|---|
| 27 | 240 | typename = type(x).__name__ |
|---|
| 28 | 240 | if ' ' in typename: |
|---|
| 29 | 0 | parts = typename.split() |
|---|
| 30 | 0 | typename = '_'.join(parts) |
|---|
| 31 | 240 | if hasattr(self, 'repr_' + typename): |
|---|
| 32 | 123 | return getattr(self, 'repr_' + typename)(x, level) |
|---|
| 33 | n/a | else: |
|---|
| 34 | 117 | s = __builtin__.repr(x) |
|---|
| 35 | 117 | if len(s) > self.maxother: |
|---|
| 36 | 1 | i = max(0, (self.maxother-3)//2) |
|---|
| 37 | 1 | j = max(0, self.maxother-3-i) |
|---|
| 38 | 1 | s = s[:i] + '...' + s[len(s)-j:] |
|---|
| 39 | 117 | return s |
|---|
| 40 | n/a | |
|---|
| 41 | 1 | def _repr_iterable(self, x, level, left, right, maxiter, trail=''): |
|---|
| 42 | 98 | n = len(x) |
|---|
| 43 | 98 | if level <= 0 and n: |
|---|
| 44 | 5 | s = '...' |
|---|
| 45 | n/a | else: |
|---|
| 46 | 93 | newlevel = level - 1 |
|---|
| 47 | 93 | repr1 = self.repr1 |
|---|
| 48 | 251 | pieces = [repr1(elem, newlevel) for elem in islice(x, maxiter)] |
|---|
| 49 | 93 | if n > maxiter: pieces.append('...') |
|---|
| 50 | 93 | s = ', '.join(pieces) |
|---|
| 51 | 93 | if n == 1 and trail: right = trail + right |
|---|
| 52 | 98 | return '%s%s%s' % (left, s, right) |
|---|
| 53 | n/a | |
|---|
| 54 | 1 | def repr_tuple(self, x, level): |
|---|
| 55 | 46 | return self._repr_iterable(x, level, '(', ')', self.maxtuple, ',') |
|---|
| 56 | n/a | |
|---|
| 57 | 1 | def repr_list(self, x, level): |
|---|
| 58 | 32 | return self._repr_iterable(x, level, '[', ']', self.maxlist) |
|---|
| 59 | n/a | |
|---|
| 60 | 1 | def repr_array(self, x, level): |
|---|
| 61 | 7 | header = "array('%s', [" % x.typecode |
|---|
| 62 | 7 | return self._repr_iterable(x, level, header, '])', self.maxarray) |
|---|
| 63 | n/a | |
|---|
| 64 | 1 | def repr_set(self, x, level): |
|---|
| 65 | 6 | x = _possibly_sorted(x) |
|---|
| 66 | 6 | return self._repr_iterable(x, level, 'set([', '])', self.maxset) |
|---|
| 67 | n/a | |
|---|
| 68 | 1 | def repr_frozenset(self, x, level): |
|---|
| 69 | 6 | x = _possibly_sorted(x) |
|---|
| 70 | 6 | return self._repr_iterable(x, level, 'frozenset([', '])', |
|---|
| 71 | 6 | self.maxfrozenset) |
|---|
| 72 | n/a | |
|---|
| 73 | 1 | def repr_deque(self, x, level): |
|---|
| 74 | 1 | return self._repr_iterable(x, level, 'deque([', '])', self.maxdeque) |
|---|
| 75 | n/a | |
|---|
| 76 | 1 | def repr_dict(self, x, level): |
|---|
| 77 | 7 | n = len(x) |
|---|
| 78 | 7 | if n == 0: return '{}' |
|---|
| 79 | 5 | if level <= 0: return '{...}' |
|---|
| 80 | 5 | newlevel = level - 1 |
|---|
| 81 | 5 | repr1 = self.repr1 |
|---|
| 82 | 5 | pieces = [] |
|---|
| 83 | 17 | for key in islice(_possibly_sorted(x), self.maxdict): |
|---|
| 84 | 12 | keyrepr = repr1(key, newlevel) |
|---|
| 85 | 12 | valrepr = repr1(x[key], newlevel) |
|---|
| 86 | 12 | pieces.append('%s: %s' % (keyrepr, valrepr)) |
|---|
| 87 | 5 | if n > self.maxdict: pieces.append('...') |
|---|
| 88 | 5 | s = ', '.join(pieces) |
|---|
| 89 | 5 | return '{%s}' % (s,) |
|---|
| 90 | n/a | |
|---|
| 91 | 1 | def repr_str(self, x, level): |
|---|
| 92 | 13 | s = __builtin__.repr(x[:self.maxstring]) |
|---|
| 93 | 13 | if len(s) > self.maxstring: |
|---|
| 94 | 2 | i = max(0, (self.maxstring-3)//2) |
|---|
| 95 | 2 | j = max(0, self.maxstring-3-i) |
|---|
| 96 | 2 | s = __builtin__.repr(x[:i] + x[len(x)-j:]) |
|---|
| 97 | 2 | s = s[:i] + '...' + s[len(s)-j:] |
|---|
| 98 | 13 | return s |
|---|
| 99 | n/a | |
|---|
| 100 | 1 | def repr_long(self, x, level): |
|---|
| 101 | 2 | s = __builtin__.repr(x) # XXX Hope this isn't too slow... |
|---|
| 102 | 2 | if len(s) > self.maxlong: |
|---|
| 103 | 1 | i = max(0, (self.maxlong-3)//2) |
|---|
| 104 | 1 | j = max(0, self.maxlong-3-i) |
|---|
| 105 | 1 | s = s[:i] + '...' + s[len(s)-j:] |
|---|
| 106 | 2 | return s |
|---|
| 107 | n/a | |
|---|
| 108 | 1 | def repr_instance(self, x, level): |
|---|
| 109 | 3 | try: |
|---|
| 110 | 3 | s = __builtin__.repr(x) |
|---|
| 111 | n/a | # Bugs in x.__repr__() can cause arbitrary |
|---|
| 112 | n/a | # exceptions -- then make up something |
|---|
| 113 | 1 | except Exception: |
|---|
| 114 | 1 | return '<%s instance at %x>' % (x.__class__.__name__, id(x)) |
|---|
| 115 | 2 | if len(s) > self.maxstring: |
|---|
| 116 | 1 | i = max(0, (self.maxstring-3)//2) |
|---|
| 117 | 1 | j = max(0, self.maxstring-3-i) |
|---|
| 118 | 1 | s = s[:i] + '...' + s[len(s)-j:] |
|---|
| 119 | 2 | return s |
|---|
| 120 | n/a | |
|---|
| 121 | n/a | |
|---|
| 122 | 1 | def _possibly_sorted(x): |
|---|
| 123 | n/a | # Since not all sequences of items can be sorted and comparison |
|---|
| 124 | n/a | # functions may raise arbitrary exceptions, return an unsorted |
|---|
| 125 | n/a | # sequence in that case. |
|---|
| 126 | 17 | try: |
|---|
| 127 | 17 | return sorted(x) |
|---|
| 128 | 3 | except Exception: |
|---|
| 129 | 3 | return list(x) |
|---|
| 130 | n/a | |
|---|
| 131 | 1 | aRepr = Repr() |
|---|
| 132 | 1 | repr = aRepr.repr |
|---|
