diff options
author | Guido van Rossum <guido@python.org> | 1991-08-16 13:05:37 (GMT) |
---|---|---|
committer | Guido van Rossum <guido@python.org> | 1991-08-16 13:05:37 (GMT) |
commit | ca197b520e6bcf72b0212999d6f70e701bb7fa0e (patch) | |
tree | 86094f9bbee27068e9df0df66547c3b3cd82235f /Lib/stdwin | |
parent | 1e5ad4e9bb769ab4a055c4eaf02db8c3b9a29467 (diff) | |
download | cpython-ca197b520e6bcf72b0212999d6f70e701bb7fa0e.zip cpython-ca197b520e6bcf72b0212999d6f70e701bb7fa0e.tar.gz cpython-ca197b520e6bcf72b0212999d6f70e701bb7fa0e.tar.bz2 |
minsize --> getminsize
Diffstat (limited to 'Lib/stdwin')
-rwxr-xr-x | Lib/stdwin/CSplit.py | 5 |
1 files changed, 2 insertions, 3 deletions
diff --git a/Lib/stdwin/CSplit.py b/Lib/stdwin/CSplit.py index 03559c1..a9d3556 100755 --- a/Lib/stdwin/CSplit.py +++ b/Lib/stdwin/CSplit.py @@ -9,14 +9,13 @@ from Split import Split class CSplit() = Split(): # - def minsize(self, m): + def getminsize(self, (m, (width, height))): # Since things look best if the children are spaced evenly # along the circle (and often all children have the same # size anyway) we compute the max child size and assume # this is each child's size. - width, height = 0, 0 for child in self.children: - wi, he = child.minsize(m) + wi, he = child.getminsize(m, (0, 0)) width = max(width, wi) height = max(height, he) # In approximation, the diameter of the circle we need is |