| Guido van Rossum | babe2bf | 1992-01-22 22:21:31 +0000 | [diff] [blame] | 1 | # Redo the `...` (representation) but with limits on most sizes. |
| 2 | |
| 3 | import string |
| 4 | |
| 5 | class Repr: |
| 6 | def init(self): |
| 7 | self.maxlevel = 6 |
| 8 | self.maxtuple = 6 |
| 9 | self.maxlist = 6 |
| 10 | self.maxdict = 4 |
| 11 | self.maxstring = 30 |
| 12 | self.maxlong = 40 |
| 13 | self.maxother = 20 |
| 14 | return self |
| 15 | def repr(self, x): |
| 16 | return self.repr1(x, self.maxlevel) |
| 17 | def repr1(self, x, level): |
| 18 | typename = `type(x)`[7:-2] # "<type '......'>" |
| 19 | if ' ' in typename: |
| 20 | parts = string.split(typename) |
| 21 | typename = string.joinfields(parts, '_') |
| 22 | try: |
| 23 | f = eval('self.repr_' + typename) |
| 24 | except AttributeError: |
| 25 | s = `x` |
| 26 | if len(s) > self.maxother: |
| 27 | i = max(0, (self.maxother-3)/2) |
| 28 | j = max(0, self.maxother-3-i) |
| 29 | s = s[:i] + '...' + s[len(s)-j:] |
| 30 | return s |
| 31 | return f(x, level) |
| 32 | def repr_tuple(self, x, level): |
| 33 | n = len(x) |
| 34 | if n == 0: return '()' |
| 35 | if level <= 0: return '(...)' |
| 36 | s = '' |
| 37 | for i in range(min(n, self.maxtuple)): |
| 38 | if s: s = s + ', ' |
| 39 | s = s + self.repr1(x[i], level-1) |
| 40 | if n > self.maxtuple: s = s + ', ...' |
| 41 | elif n == 1: s = s + ',' |
| 42 | return '(' + s + ')' |
| 43 | def repr_list(self, x, level): |
| 44 | n = len(x) |
| 45 | if n == 0: return '[]' |
| 46 | if level <= 0: return '[...]' |
| 47 | s = '' |
| 48 | for i in range(min(n, self.maxlist)): |
| 49 | if s: s = s + ', ' |
| 50 | s = s + self.repr1(x[i], level-1) |
| 51 | if n > self.maxlist: s = s + ', ...' |
| 52 | return '[' + s + ']' |
| 53 | def repr_dictionary(self, x, level): |
| 54 | n = len(x) |
| 55 | if n == 0: return '{}' |
| 56 | if level <= 0: return '{...}' |
| 57 | s = '' |
| 58 | keys = x.keys() |
| 59 | keys.sort() |
| 60 | for i in range(min(n, self.maxdict)): |
| 61 | if s: s = s + ', ' |
| 62 | key = keys[i] |
| 63 | s = s + self.repr1(key, level-1) |
| 64 | s = s + ': ' + self.repr1(x[key], level-1) |
| 65 | if n > self.maxlist: s = s + ', ...' |
| 66 | return '{' + s + '}' |
| 67 | def repr_string(self, x, level): |
| 68 | s = `x[:self.maxstring]` |
| 69 | if len(s) > self.maxstring: |
| 70 | i = max(0, (self.maxstring-3)/2) |
| 71 | j = max(0, self.maxstring-3-i) |
| 72 | s = s[:i] + '...' + s[len(s)-j:] |
| 73 | return s |
| 74 | def repr_long_int(self, x, level): |
| 75 | s = `x` # XXX Hope this isn't too slow... |
| 76 | if len(s) > self.maxlong: |
| 77 | i = max(0, (self.maxlong-3)/2) |
| 78 | j = max(0, self.maxlong-3-i) |
| 79 | s = s[:i] + '...' + s[len(s)-j:] |
| 80 | return s |
| 81 | |
| 82 | aRepr = Repr().init() |
| 83 | repr = aRepr.repr |