From ca197b520e6bcf72b0212999d6f70e701bb7fa0e Mon Sep 17 00:00:00 2001 From: Guido van Rossum Date: Fri, 16 Aug 1991 13:05:37 +0000 Subject: minsize --> getminsize --- Lib/lib-stdwin/CSplit.py | 5 ++--- Lib/stdwin/CSplit.py | 5 ++--- 2 files changed, 4 insertions(+), 6 deletions(-) diff --git a/Lib/lib-stdwin/CSplit.py b/Lib/lib-stdwin/CSplit.py index 03559c1..a9d3556 100644 --- a/Lib/lib-stdwin/CSplit.py +++ b/Lib/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 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 -- cgit v0.12