| commit | 41305ec3938aceb6a1f000100f2a9ef4664476bc | |
| author | Kirill Smelkov <kirr@landau.phys.spbu.ru> | |
| Thu, 7 Aug 2008 20:02:52 +0000 (8 00:02 +0400) | ||
| committer | Kirill Smelkov <kirr@landau.phys.spbu.ru> | |
| Thu, 7 Aug 2008 20:02:52 +0000 (8 00:02 +0400) | ||
| tree | 904c9d2eae276615590f13498e51e0e4b4eefd20 | treesnapshot (tar.gz zip) |
| parent | e1e9f605f0f1fb4ea07130dda5fc74589cb95bc8 | commitdiff |
printing: let's pretty-sort dicts
Now Latex, Str and Pretty printers all first pretty-sort dicts by their keys
before printing. This brings two benefits:
1. the output is easier to read, e.g.
⎧ 2 3 4 ⎫
⎨1: c₀, x: c₁, x : c₂, x : c₃, x : c₄⎬
⎩ ⎭
2. the output is stable wrt hash changes
Signed-off-by: Kirill Smelkov <kirr@landau.phys.spbu.ru>
Signed-off-by: Ondrej Certik <ondrej@certik.cz>
Now Latex, Str and Pretty printers all first pretty-sort dicts by their keys
before printing. This brings two benefits:
1. the output is easier to read, e.g.
⎧ 2 3 4 ⎫
⎨1: c₀, x: c₁, x : c₂, x : c₃, x : c₄⎬
⎩ ⎭
2. the output is stable wrt hash changes
Signed-off-by: Kirill Smelkov <kirr@landau.phys.spbu.ru>
Signed-off-by: Ondrej Certik <ondrej@certik.cz>