if(!matched)
for(i = 0; i < ntags; i++)
c->tags[i] = seltag[i];
- for(c->weight = 0; c->weight < ntags && !c->tags[c->weight]; c->weight++);
+ if(!c->isfloat)
+ for(c->weight = 0; c->weight < ntags && !c->tags[c->weight]; c->weight++);
}
void
for(i = 0; i < ntags; i++)
sel->tags[i] = False;
sel->tags[arg->i] = True;
- sel->weight = arg->i;
+ if(!sel->isfloat)
+ sel->weight = arg->i;
arrange(NULL);
}
for(i = 0; i < ntags && !sel->tags[i]; i++);
if(i == ntags)
sel->tags[arg->i] = True;
- sel->weight = (i == ntags) ? arg->i : i;
+ if(!sel->isfloat)
+ sel->weight = (i == ntags) ? arg->i : i;
arrange(NULL);
}
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;
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;
- /* this is somewhat tricky, it asserts to only zoom tiled clients */
- for(c = getnext(clients); c && c->isfloat; c = getnext(c->next));
- if(c) {
- if(c == sel)
- for(c = getnext(c->next); c && c->isfloat; c = getnext(c->next));
- else
- c = sel;
- }
- if(!c)
- return;
+ if((c = sel) == getnext(clients))
+ if(!(c = getnext(c->next)) || c->isfloat)
+ return;
detach(c);
c->next = clients;
clients->prev = c;