{
Client *c;
+ maximized = False;
+
for(c = clients; c; c = c->next) {
- c->ismax = False;
if(isvisible(c)) {
resize(c, True, TopLeft);
}
else
ban(c);
}
- if((sel = getnext(clients)))
- focus(sel);
- else
- XSetInputFocus(dpy, root, RevertToPointerRoot, CurrentTime);
+ if(!sel || !isvisible(sel))
+ focus(getnext(clients));
restack();
}
int h, i, n, w;
Client *c;
+ maximized = False;
+
w = sw - mw;
for(n = 0, c = clients; c; c = c->next)
if(isvisible(c) && !c->isfloat)
h = sh - bh;
for(i = 0, c = clients; c; c = c->next) {
- c->ismax = False;
if(isvisible(c)) {
if(c->isfloat) {
resize(c, True, TopLeft);
else
ban(c);
}
- if((sel = getnext(clients)))
- focus(sel);
- else
- XSetInputFocus(dpy, root, RevertToPointerRoot, CurrentTime);
+ if(!sel || !isvisible(sel))
+ focus(getnext(clients));
restack();
}
return False;
}
+void
+resizecol(Arg *arg)
+{
+ unsigned int n;
+ Client *c;
+
+ for(n = 0, c = clients; c; c = c->next)
+ if(isvisible(c) && !c->isfloat)
+ n++;
+ if(!sel || sel->isfloat || n < 2 || (arrange != dotile) || maximized)
+ return;
+
+ if(sel == getnext(clients)) {
+ if(mw + arg->i > sw - 100 || mw + arg->i < 100)
+ return;
+ mw += arg->i;
+ }
+ else {
+ if(mw - arg->i > sw - 100 || mw - arg->i < 100)
+ return;
+ mw -= arg->i;
+ }
+ arrange(NULL);
+}
+
void
restack()
{
fi = 0;
mi = 2 * f;
- if(sel->isfloat || arrange == dofloat) {
- wins[fi++] = sel->twin;
- wins[fi++] = sel->win;
- }
- else {
- wins[mi++] = sel->twin;
- wins[mi++] = sel->win;
+ if(sel) {
+ if(sel->isfloat || arrange == dofloat) {
+ wins[fi++] = sel->twin;
+ wins[fi++] = sel->win;
+ }
+ else {
+ wins[mi++] = sel->twin;
+ wins[mi++] = sel->win;
+ }
}
for(c = clients; c; c = c->next)
if(isvisible(c) && c != sel) {
view(Arg *arg)
{
unsigned int i;
- Client *c;
for(i = 0; i < ntags; i++)
seltag[i] = False;
arrange(NULL);
}
+void
+viewall(Arg *arg)
+{
+ unsigned int i;
+
+ for(i = 0; i < ntags; i++)
+ seltag[i] = True;
+ reorder();
+ arrange(NULL);
+}
+
void
zoom(Arg *arg)
{
- Client *c = sel;
+ unsigned int n;
+ Client *c;
- if(!c || (arrange != dotile) || c->isfloat || c->ismax)
+ for(n = 0, c = clients; c; c = c->next)
+ if(isvisible(c) && !c->isfloat)
+ n++;
+ if(!sel || sel->isfloat || n < 2 || (arrange != dotile) || maximized)
return;
- if(c == getnext(clients))
- if(!(c = getnext(c->next)))
- return;
+ if((c = sel) == getnext(clients))
+ for(c = getnext(c->next); c && c->isfloat; c = getnext(c->next));
+ if(!c)
+ return;
detach(c);
c->next = clients;
clients->prev = c;