callirhoe/lib/geom.py
geortz@gmail.com 21c3f79c9f first import
git-svn-id: https://callirhoe.googlecode.com/svn/trunk@5 81c8bb96-aa45-f2e2-0eef-c4fa4a15c6df
2012-07-17 20:44:12 +00:00

159 lines
4.9 KiB
Python

# -*- coding: utf-8 -*-
# callirhoe - high quality calendar rendering
# Copyright (C) 2012 George M. Tzoumas
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program. If not, see http://www.gnu.org/licenses/
# *****************************************
# #
# general-purpose geometry routines #
# #
# *****************************************
def rect_rel_scale(r, fw, fh):
x, y, w, h = r
return (x + w*(1 - fw)/2.0, y + h*(1 - fh)/2.0, w*fw, h*fh)
def rect_to_abs(r):
x, y, w, h = r
return (x, y, x + w, y + h)
def abs_to_rect(a):
x1, y1, x2, y2 = a
return (x1, y1, x2 - x1, y2 - y1)
def rect_hull(r1,r2):
x1, y1, x2, y2 = rect_to_abs(r1)
x3, y3, x4, y4 = rect_to_abs(r2)
return abs_to_rect((min(x1,x3), min(y1,y3), max(x2,x4), max(y2,y4)))
def rect_hsplit(r, f = 0.5):
x, y, w, h = r
r1 = (x, y, w*f, h)
r2 =(x + w*f, y, w*(1 - f), h)
return (r1, r2)
def rect_vsplit(r, f = 0.5):
x, y, w, h = r
r1 = (x, y, w, h*f)
r2 = (x, y + h*f, w, h*(1 - f))
return (r1, r2)
def rect_qsplit(r, fv = 0.5, fh = 0.5):
x, y, w, h = r
rv = rect_vsplit(r, fv)
return rect_hsplit(rv[0], fh) + rect_hsplit(rv[1], fh)
def color_mix(a, b, frac):
k = min(len(a), len(b))
return map(lambda (x,y): x*frac + y*(1 - frac), zip(a,b))
def color_auto_fg(bg, light = (1,1,1), dark = (0,0,0)):
return light if bg[0] + bg[1] + bg[2] < 1.5 else dark
# ********* layout managers ***********
class VLayout:
def __init__(self, rect, nitems = 1, pad = (0.0,0.0,0.0,0.0)): # TLBR
self.pos = (rect[0], rect[1])
self.size = (rect[2], rect[3])
self.items = nitems
self.pad = pad
def count(self):
return self.items
def resize(self, k):
self.items = k
def grow(self, delta = 1):
self.items += delta
def move(newpos):
self.pos = newpos;
def item(self, i = 0):
vinter = (self.pad[0] + self.pad[2])/2.0;
vsize = (self.size[1] - vinter)/self.items;
return (self.pos[0] + self.pad[1], self.pos[1] + self.pad[0] + i*vsize,
self.size[0] -self.pad[1] - self.pad[3], vsize - vinter)
def item_span(self, n, k = -1):
if k < 0: k = (self.count() - n) // 2
return rect_hull(self.item(k), self.item(k + n - 1))
class HLayout:
def __init__(self, rect, nitems = 1, pad = (0.0,0.0,0.0,0.0)): # TLBR
self.pos = (rect[0],rect[1])
self.rep = VLayout((0.0, 0.0, rect[3], rect[2]), nitems, (pad[1], pad[0], pad[3], pad[2]))
def count(self):
return self.rep.count()
def resize(self, k):
self.rep.resize(k)
def move(newpos):
self.rep.move(newpos)
def item(self, i = 0):
t = self.rep.item(i)
return (t[1] + self.pos[0], t[0] + self.pos[1], t[3], t[2])
def item_span(self, n, k = -1):
if k < 0: k = (self.rep.count() - n) // 2
return rect_hull(self.item(k), self.item(k + n - 1))
class GLayout:
def __init__(self, rect, nrows = 1, ncols = 1, pad = (0.0,0.0,0.0,0.0)): # TLBR
self.vrep = VLayout(rect, nrows, (pad[0], 0.0, pad[2], 0.0))
t = self.vrep.item(0)
self.hrep = HLayout((rect[0], rect[1], t[2], t[3]), ncols, (0.0, pad[1], 0.0, pad[3]))
def row_count(self):
return self.vrep.count()
def col_count(self):
return self.hrep.count()
def count(self):
return self.row_count()*self.col_count()
def resize(self, rows, cols):
self.vrep.resize(rows)
t = self.vrep.item(0)
self.hrep = HLayout(t[0:2], t[2:4], cols, (0.0, pad[1], 0.0, pad[3]))
def move(newpos):
self.vrep.move(newpos)
self.hrep.move(newpos)
def item(self, row, col):
ty = self.vrep.item(row)
tx = self.hrep.item(col)
return (tx[0], ty[1], tx[2], tx[3])
def item_seq(self, k, column_wise = False):
if not column_wise:
row, col = k // self.col_count(), k % self.col_count()
else:
col, row = k // self.row_count(), k % self.row_count()
return self.item(row, col)
def item_span(self, nr, nc, row = -1, col = -1):
if row < 0: row = (self.row_count() - nr) // 2
if col < 0: col = (self.col_count() - nc) // 2
return rect_hull(self.item(row, col), self.item(row + nr - 1, col + nc - 1))