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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
|
enum {MaxMon = 8};
static int nmasters[MaxMon];
static int initnm = 0;
static void
initnmaster(void) {
int i;
if(initnm)
return;
for(i = 0; i < MaxMon; i++)
nmasters[i] = nmaster;
initnm = 1;
}
static void
incnmaster(const Arg *arg) {
if(!arg || !selmon->lt[selmon->sellt]->arrange || selmon->num >= MaxMon)
return;
nmasters[selmon->num] += arg->i;
if(nmasters[selmon->num] < 0)
nmasters[selmon->num] = 0;
arrange(selmon);
}
/* static void */
/* setnmaster(const Arg *arg) { */
/* if(!arg || !selmon->lt[selmon->sellt]->arrange || selmon->num >= MaxMon) */
/* return; */
/* nmasters[selmon->num] = arg->i > 0 ? arg->i : 0; */
/* arrange(selmon); */
/* } */
static void
ntile(Monitor *m) {
int x, y, h, w, mw, nm;
unsigned int i, n;
Client *c;
initnmaster();
for(n = 0, c = nexttiled(m->clients); c; c = nexttiled(c->next), n++);
c = nexttiled(m->clients);
nm = m->num < MaxMon ? nmasters[m->num] : nmaster;
if(nm > n)
nm = n;
/* master */
if(nm > 0) {
mw = m->mfact * m->ww;
h = m->wh / nm;
if(h < bh)
h = m->wh;
y = m->wy;
for(i = 0; i < nm; i++, c = nexttiled(c->next)) {
resize(c, m->wx, y, (n == nm ? m->ww : mw) - 2 * c->bw,
((i + 1 == nm) ? m->wy + m->wh - y : h) - 2 * c->bw, False);
if(h != m->wh)
y = c->y + HEIGHT(c);
}
n -= nm;
} else
mw = 0;
if(n == 0)
return;
/* tile stack */
x = m->wx + mw;
y = m->wy;
w = m->ww - mw;
h = m->wh / n;
if(h < bh)
h = m->wh;
for(i = 0; c; c = nexttiled(c->next), i++) {
resize(c, x, y, w - 2 * c->bw,
((i + 1 == n) ? m->wy + m->wh - y : h) - 2 * c->bw, False);
if(h != m->wh)
y = c->y + HEIGHT(c);
}
}
static void
nbstack(Monitor *m) {
int x, y, h, w, mh, nm;
unsigned int i, n;
Client *c;
initnmaster();
for(n = 0, c = nexttiled(m->clients); c; c = nexttiled(c->next), n++);
c = nexttiled(m->clients);
nm = m->num < MaxMon ? nmasters[m->num] : nmaster;
if(nm > n)
nm = n;
/* master */
if(nm > 0) {
mh = m->mfact * m->wh;
w = m->ww / nm;
if(w < bh)
w = m->ww;
x = m->wx;
for(i = 0; i < nm; i++, c = nexttiled(c->next)) {
resize(c, x, m->wy, ((i + 1 == nm) ? m->wx + m->ww - x : w) - 2 * c->bw,
(n == nm ? m->wh : mh) - 2 * c->bw, False);
if(w != m->ww)
x = c->x + WIDTH(c);
}
n -= nm;
} else
mh = 0;
if(n == 0)
return;
/* tile stack */
x = m->wx;
y = m->wy + mh;
w = m->ww / n;
h = m->wh - mh;
if(w < bh)
w = m->ww;
for(i = 0; c; c = nexttiled(c->next), i++) {
resize(c, x, y, ((i + 1 == n) ? m->wx + m->ww - x : w) - 2 * c->bw,
h - 2 * c->bw, False);
if(w != m->ww)
x = c->x + WIDTH(c);
}
}
|
