void
incnmaster(Arg *arg) {
- if(nmaster + arg->i < 1)
+ if(nmaster + arg->i < 1 || (wah / (nmaster + arg->i) < bh))
return;
nmaster += arg->i;
+
arrange();
}
}
for(n = 0, c = nexttiled(clients); c; c = nexttiled(c->next))
n++;
- if(n <= nmaster || (arrange == dofloat))
- return;
- if(ismaster((c = sel))) {
+ c = sel;
+ if(n <= nmaster || (arrange == dofloat))
+ pop(c);
+ else if(ismaster(sel)) {
if(!(c = topofstack()))
return;
swap(c, sel);