|
|
@ -82,8 +82,8 @@ dotile(Arg *arg) |
|
|
|
maximized = False; |
|
|
|
maximized = False; |
|
|
|
|
|
|
|
|
|
|
|
w = sw - mw; |
|
|
|
w = sw - mw; |
|
|
|
for(n = 0, c = clients; c; c = c->next) |
|
|
|
for(n = 0, c = clients; c && !c->isfloat; c = c->next) |
|
|
|
if(isvisible(c) && !c->isfloat) |
|
|
|
if(isvisible(c)) |
|
|
|
n++; |
|
|
|
n++; |
|
|
|
|
|
|
|
|
|
|
|
if(n > 1) |
|
|
|
if(n > 1) |
|
|
@ -186,8 +186,8 @@ resizecol(Arg *arg) |
|
|
|
unsigned int n; |
|
|
|
unsigned int n; |
|
|
|
Client *c; |
|
|
|
Client *c; |
|
|
|
|
|
|
|
|
|
|
|
for(n = 0, c = clients; c; c = c->next) |
|
|
|
for(n = 0, c = clients; c && !c->isfloat; c = c->next) |
|
|
|
if(isvisible(c) && !c->isfloat) |
|
|
|
if(isvisible(c)) |
|
|
|
n++; |
|
|
|
n++; |
|
|
|
if(!sel || sel->isfloat || n < 2 || (arrange != dotile) || maximized) |
|
|
|
if(!sel || sel->isfloat || n < 2 || (arrange != dotile) || maximized) |
|
|
|
return; |
|
|
|
return; |
|
|
@ -311,21 +311,14 @@ zoom(Arg *arg) |
|
|
|
unsigned int n; |
|
|
|
unsigned int n; |
|
|
|
Client *c; |
|
|
|
Client *c; |
|
|
|
|
|
|
|
|
|
|
|
for(n = 0, c = clients; c; c = c->next) |
|
|
|
for(n = 0, c = clients; c && !c->isfloat; c = c->next) |
|
|
|
if(isvisible(c) && !c->isfloat) |
|
|
|
if(isvisible(c)) |
|
|
|
n++; |
|
|
|
n++; |
|
|
|
if(!sel || sel->isfloat || n < 2 || (arrange != dotile) || maximized) |
|
|
|
if(!sel || sel->isfloat || n < 2 || (arrange != dotile) || maximized) |
|
|
|
return; |
|
|
|
return; |
|
|
|
|
|
|
|
|
|
|
|
/* this is somewhat tricky, it asserts to only zoom tiled clients */ |
|
|
|
if((c = sel) == getnext(clients)) |
|
|
|
for(c = getnext(clients); c && c->isfloat; c = getnext(c->next)); |
|
|
|
if(!(c = getnext(c->next)) || c->isfloat) |
|
|
|
if(c) { |
|
|
|
|
|
|
|
if(c == sel) |
|
|
|
|
|
|
|
for(c = getnext(c->next); c && c->isfloat; c = getnext(c->next)); |
|
|
|
|
|
|
|
else |
|
|
|
|
|
|
|
c = sel; |
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
if(!c) |
|
|
|
|
|
|
|
return; |
|
|
|
return; |
|
|
|
detach(c); |
|
|
|
detach(c); |
|
|
|
c->next = clients; |
|
|
|
c->next = clients; |
|
|
|