diff --git a/Lib/lib-stdwin/CSplit.py b/Lib/lib-stdwin/CSplit.py
index 03559c1cbfd..a9d3556533e 100644
--- a/Lib/lib-stdwin/CSplit.py
+++ b/Lib/lib-stdwin/CSplit.py
@@ -9,14 +9,13 @@
 
 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 03559c1cbfd..a9d3556533e 100755
--- a/Lib/stdwin/CSplit.py
+++ b/Lib/stdwin/CSplit.py
@@ -9,14 +9,13 @@
 
 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