summaryrefslogtreecommitdiff
path: root/Lib/stdwin/HVSplit.py
diff options
context:
space:
mode:
authorGuido van Rossum <guido@python.org>1997-09-09 03:39:21 +0000
committerGuido van Rossum <guido@python.org>1997-09-09 03:39:21 +0000
commitd7500fcbb4d0257f3bcd0c87d17ee61f3b1545e8 (patch)
treedb4a6e4835e04851df721eb4595d7172d8e05c34 /Lib/stdwin/HVSplit.py
parent045e688f6fc06c87cc93f84e42fb4767a04ba559 (diff)
downloadcpython-git-d7500fcbb4d0257f3bcd0c87d17ee61f3b1545e8.tar.gz
These directories renamed: tkinter -> lib-tk, stdwin -> lib-stdwin.
Diffstat (limited to 'Lib/stdwin/HVSplit.py')
-rwxr-xr-xLib/stdwin/HVSplit.py62
1 files changed, 0 insertions, 62 deletions
diff --git a/Lib/stdwin/HVSplit.py b/Lib/stdwin/HVSplit.py
deleted file mode 100755
index 62e0de75f7..0000000000
--- a/Lib/stdwin/HVSplit.py
+++ /dev/null
@@ -1,62 +0,0 @@
-# HVSplit contains generic code for HSplit and VSplit.
-# HSplit and VSplit are specializations to either dimension.
-
-# XXX This does not yet stretch/shrink children if there is too much
-# XXX or too little space in the split dimension.
-# XXX (NB There is no interface to ask children for stretch preferences.)
-
-from Split import Split
-
-class HVSplit(Split):
- #
- def create(self, parent, hv):
- # hv is 0 for HSplit, 1 for VSplit
- self = Split.create(self, parent)
- self.hv = hv
- return self
- #
- def getminsize(self, m, sugg_size):
- hv, vh = self.hv, 1 - self.hv
- size = [0, 0]
- sugg_size = [sugg_size[0], sugg_size[1]]
- sugg_size[hv] = 0
- sugg_size = sugg_size[0], sugg_size[1] # Make a tuple
- for c in self.children:
- csize = c.getminsize(m, sugg_size)
- if csize[vh] > size[vh]: size[vh] = csize[vh]
- size[hv] = size[hv] + csize[hv]
- return size[0], size[1]
- #
- def getbounds(self):
- return self.bounds
- #
- def setbounds(self, bounds):
- self.bounds = bounds
- hv, vh = self.hv, 1 - self.hv
- mf = self.parent.beginmeasuring
- begin, end = bounds
- sugg_size = end[0] - begin[0], end[1] - begin[1]
- size = self.getminsize(mf(), sugg_size)
- origin = [begin[0], begin[1]]
- sugg_size = [sugg_size[0], sugg_size[1]] # Make a list
- sugg_size[hv] = 0
- sugg_size = sugg_size[0], sugg_size[1] # Make a tuple
- for c in self.children:
- size = c.getminsize(mf(), sugg_size)
- corner = [0, 0]
- corner[vh] = end[vh]
- corner[hv] = origin[hv] + size[hv]
- c.setbounds(((origin[0], origin[1]), \
- (corner[0], corner[1])))
- origin[hv] = corner[hv]
- # XXX stretch
- # XXX too-small
- #
-
-class HSplit(HVSplit):
- def create(self, parent):
- return HVSplit.create(self, parent, 0)
-
-class VSplit(HVSplit):
- def create(self, parent):
- return HVSplit.create(self, parent, 1)