1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
|
/* Skippy - Seduces Kids Into Perversion
*
* Copyright (C) 2004 Hyriand <hyriand@thegraveyard.org>
*
* 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 2 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, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include "skippy.h"
void
layout_run(MainWin *mw, dlist *windows, unsigned int *total_width, unsigned int *total_height)
{
int sum_w = 0, max_h = 0, max_w = 0, max_row_w = 0;
int row_y = 0, y = 0, x = 0, row_h = 0;
dlist *iter, *slots = 0, *slot_iter, *rows;
rows = dlist_add(0, 0);
windows = dlist_first(windows);
*total_width = *total_height = 0;
for(iter = windows; iter; iter = iter->next)
{
ClientWin *cw = (ClientWin *)iter->data;
sum_w += cw->client.width;
max_w = MAX(max_w, cw->client.width);
max_h = MAX(max_h, cw->client.height);
}
for(iter = windows; iter; iter = iter->next)
{
ClientWin *cw = (ClientWin*)iter->data;
dlist *slot_iter = dlist_first(slots);
for(; slot_iter; slot_iter = slot_iter->next)
{
dlist *slot = (dlist *)slot_iter->data;
int slot_h = -DISTANCE(mw);
REDUCE(slot_h = slot_h + ((ClientWin*)iter->data)->client.height + DISTANCE(mw), slot);
if(slot_h + DISTANCE(mw) + cw->client.height < max_h)
{
slot_iter->data = dlist_add(slot, cw);
break;
}
}
if(! slot_iter)
slots = dlist_add(slots, dlist_add(0, cw));
}
max_row_w = sqrt(sum_w * max_h);
for(slot_iter = dlist_first(slots); slot_iter; slot_iter = slot_iter->next)
{
dlist *slot = (dlist *)slot_iter->data;
int slot_w = 0;
REDUCE(slot_w = MAX(slot_w, ((ClientWin*)iter->data)->client.width), slot);
y = row_y;
for(iter = dlist_first(slot); iter; iter = iter->next)
{
ClientWin *cw = (ClientWin *)iter->data;
cw->x = x + (slot_w - cw->client.width) / 2;
cw->y = y;
y += cw->client.height + DISTANCE(mw);
rows->data = dlist_add((dlist *)rows->data, cw);
}
row_h = MAX(row_h, y - row_y);
*total_height = MAX(*total_height, y);
x += slot_w + DISTANCE(mw);
*total_width = MAX(*total_width, x);
if(x > max_row_w)
{
x = 0;
row_y += row_h;
row_h = 0;
rows = dlist_add(rows, 0);
}
dlist_free(slot);
}
dlist_free(slots);
*total_width -= DISTANCE(mw);
*total_height -= DISTANCE(mw);
for(iter = dlist_first(rows); iter; iter = iter->next)
{
dlist *row = (dlist *)iter->data;
int row_w = 0, xoff;
REDUCE(row_w = MAX(row_w, ((ClientWin*)iter->data)->x + ((ClientWin*)iter->data)->client.width), row);
xoff = (*total_width - row_w) / 2;
REDUCE(((ClientWin*)iter->data)->x += xoff, row);
dlist_free(row);
}
dlist_free(rows);
}
|
