Xinqi Bao's Git
projects
/
dwm.git
/ blobdiff
summary
|
log
|
commit
|
diff
|
tree
raw
|
inline
| side by side
allowing swap() for first master client
[dwm.git]
/
view.c
diff --git
a/view.c
b/view.c
index
72a4991
..
f2e4040
100644
(file)
--- a/
view.c
+++ b/
view.c
@@
-69,12
+69,16
@@
dofloat(void) {
void
dotile(void) {
void
dotile(void) {
- unsigned int i, n, m
p
w, th;
+ unsigned int i, n, m
w, mh, t
w, th;
Client *c;
for(n = 0, c = nexttiled(clients); c; c = nexttiled(c->next))
n++;
Client *c;
for(n = 0, c = nexttiled(clients); c; c = nexttiled(c->next))
n++;
- mpw = (waw * master) / 1000;
+ /* window geoms */
+ mw = (n > nmaster) ? (waw * master) / 1000 : waw;
+ mh = (n > nmaster) ? wah / nmaster : wah / (n > 0 ? n : 1);
+ tw = waw - mw;
+ th = (n > nmaster) ? wah / (n - nmaster) : 0;
for(i = 0, c = clients; c; c = c->next)
if(isvisible(c)) {
for(i = 0, c = clients; c; c = c->next)
if(isvisible(c)) {
@@
-85,20
+89,16
@@
dotile(void) {
c->ismax = False;
c->x = wax;
c->y = way;
c->ismax = False;
c->x = wax;
c->y = way;
- if(n == 1) { /* only 1 window */
- c->w = waw - 2 * BORDERPX;
- c->h = wah - 2 * BORDERPX;
- }
- else if(i == 0) { /* master window */
- c->w = mpw - 2 * BORDERPX;
- c->h = wah - 2 * BORDERPX;
- th = wah / (n - 1);
+ if(i < nmaster) {
+ c->y += i * mh;
+ c->w = mw - 2 * BORDERPX;
+ c->h = mh - 2 * BORDERPX;
}
else { /* tile window */
}
else { /* tile window */
- c->x += m
p
w;
- c->w =
(waw - mpw)
- 2 * BORDERPX;
+ c->x += mw;
+ c->w =
tw
- 2 * BORDERPX;
if(th > bh) {
if(th > bh) {
- c->y += (i -
1
) * th;
+ c->y += (i -
nmaster
) * th;
c->h = th - 2 * BORDERPX;
}
else /* fallback if th < bh */
c->h = th - 2 * BORDERPX;
}
else /* fallback if th < bh */
@@
-147,6
+147,14
@@
focusprev(Arg *arg) {
}
}
}
}
+void
+incnmaster(Arg *arg) {
+ if((nmaster + arg->i < 1) || (wah / (nmaster + arg->i) < bh))
+ return;
+ nmaster += arg->i;
+ arrange();
+}
+
Bool
isvisible(Client *c) {
unsigned int i;
Bool
isvisible(Client *c) {
unsigned int i;
@@
-249,11
+257,9
@@
zoom(Arg *arg) {
togglemax(sel);
return;
}
togglemax(sel);
return;
}
- for(n = 0, c = clients; c; c = c->next)
- if(isvisible(c) && !c->isfloat)
- n++;
- if(n < 2 || (arrange == dofloat))
- return;
+ for(n = 0, c = nexttiled(clients); c; c = nexttiled(c->next))
+ n++;
+
if((c = sel) == nexttiled(clients))
if(!(c = nexttiled(c->next)))
return;
if((c = sel) == nexttiled(clients))
if(!(c = nexttiled(c->next)))
return;