| commit | daf5443c7cc5157bf8a276a15df03631be4f3b51 | |
| author | g@localhost.localdomain <g@localhost.localdomain> | |
| Sat, 1 Jul 2006 14:23:25 +0000 (1 16:23 +0200) | ||
| committer | g@localhost.localdomain <g@localhost.localdomain> | |
| Sat, 1 Jul 2006 14:23:25 +0000 (1 16:23 +0200) | ||
| tree | e40e337fd061e86fb8a2991f5b2c0d1cf041dea9 | treesnapshot (tar.gz zip) |
| parent | f3b6975a637671d359b58e44bf0333d850f97b9b | commitdiff |
Modify algorithm in order to be sure previous items have more room than
the next ones, since they are bigger. For this, we compute the vertical
size of an item using math.ceil() and its allocated room.
the next ones, since they are bigger. For this, we compute the vertical
size of an item using math.ceil() and its allocated room.
| ui/char_matrix.py | diffblobblamehistory |