maximized = False;
w = sw - mw;
- for(n = 0, c = clients; c; c = c->next)
- if(isvisible(c) && !c->isfloat)
+ for(n = 0, c = clients; c && !c->isfloat; c = c->next)
+ if(isvisible(c))
n++;
if(n > 1)
unsigned int n;
Client *c;
- for(n = 0, c = clients; c; c = c->next)
- if(isvisible(c) && !c->isfloat)
+ for(n = 0, c = clients; c && !c->isfloat; c = c->next)
+ if(isvisible(c))
n++;
if(!sel || sel->isfloat || n < 2 || (arrange != dotile) || maximized)
return;
if(sel == getnext(clients)) {
- if(mw + arg->i > sw - 100)
+ if(mw + arg->i > sw - 100 || mw + arg->i < 100)
return;
mw += arg->i;
}
else {
- if(mw - arg->i < 100)
+ if(mw - arg->i > sw - 100 || mw - arg->i < 100)
return;
mw -= arg->i;
}
unsigned int n;
Client *c;
- for(n = 0, c = clients; c; c = c->next)
- if(isvisible(c) && !c->isfloat)
+ for(n = 0, c = clients; c && !c->isfloat; c = c->next)
+ if(isvisible(c))
n++;
if(!sel || sel->isfloat || n < 2 || (arrange != dotile) || maximized)
return;
- if((c = sel) == getnext(clients))
- if(!(c = getnext(c->next)))
+ if((c = sel) == getnext(clients))
+ if(!(c = getnext(c->next)) || c->isfloat)
return;
detach(c);
c->next = clients;