2 * (C)opyright MMVI Anselm R. Garbe <garbeam at gmail dot com>
3 * See LICENSE file for license details.
13 if((clients && clients->isfloat) || arrange == dofloat)
14 return clients; /* don't touch floating order */
15 for(min = c = clients; c; c = c->next)
16 if(c->weight < min->weight)
22 nexttiled(Client *c) {
23 for(c = getnext(c); c && c->isfloat; c = getnext(c->next));
29 Client *c, *newclients, *tail;
31 newclients = tail = NULL;
32 while((c = minclient())) {
40 tail = newclients = c;
49 if((c->ismax = !c->ismax)) {
50 c->rx = c->x; c->x = sx;
51 c->ry = c->y; c->y = bh;
52 c->rw = c->w; c->w = sw - 2 * BORDERPX;
53 c->rh = c->h; c->h = sh - bh - 2 * BORDERPX;
61 resize(c, True, TopLeft);
62 while(XCheckMaskEvent(dpy, EnterWindowMask, &ev));
67 void (*arrange)(Arg *) = DEFMODE;
68 Bool isvertical = VERTICALSTACK;
69 StackPos stackpos = STACKPOS;
74 c->prev->next = c->next;
76 c->next->prev = c->prev;
79 c->next = c->prev = NULL;
86 for(c = clients; c; c = c->next) {
88 resize(c, True, TopLeft);
93 if(!sel || !isvisible(sel)) {
94 for(c = stack; c && !isvisible(c); c = c->snext);
100 /* This algorithm is based on a (M)aster area and a (S)tacking area.
101 * It supports following arrangements:
107 int i, n, stackw, stackh, tw, th;
110 for(n = 0, c = nexttiled(clients); c; c = nexttiled(c->next))
113 if(stackpos == StackBottom) {
115 stackh = sh - bh - master;
118 stackw = sw - master;
125 th = stackh / (n - 1);
132 tw = stackw / (n - 1);
137 for(i = 0, c = clients; c; c = c->next) {
140 resize(c, True, TopLeft);
144 if(n == 1) { /* only 1 window */
147 c->w = sw - 2 * BORDERPX;
148 c->h = sh - 2 * BORDERPX - bh;
150 else if(i == 0) { /* master window */
155 c->w = master - 2 * BORDERPX;
156 c->h = sh - bh - 2 * BORDERPX;
161 c->w = sw - 2 * BORDERPX;
162 c->h = master - 2 * BORDERPX;
167 c->w = master - 2 * BORDERPX;
168 c->h = sh - bh - 2 * BORDERPX;
172 else if((isvertical && th > bh) || (!isvertical && tw > MINW)) {
174 c->w = tw - 2 * BORDERPX;
175 c->h = th - 2 * BORDERPX;
180 c->y = sy + (i - 1) * th + bh;
182 c->h = sh - c->y - 2 * BORDERPX;
185 c->x = sx + (i - 1) * tw;
188 c->w = sx + stackw - c->x - 2 * BORDERPX;
194 c->y = sy + master + (i - 1) * th + bh;
196 c->h = sh - c->y - 2 * BORDERPX;
199 c->x = sx + (i - 1) * tw;
200 c->y = sy + bh + master;
202 c->w = sw - c->x - 2 * BORDERPX;
208 c->y = sy + (i - 1) * th + bh;
210 c->h = sh - c->y - 2 * BORDERPX;
213 c->x = sx + master + (i - 1) * tw;
216 c->w = sw - c->x - 2 * BORDERPX;
221 else { /* fallback if th < bh resp. tw < MINW */
222 c->w = stackw - 2 * BORDERPX;
223 c->h = stackh - 2 * BORDERPX;
239 resize(c, False, TopLeft);
245 if(!sel || !isvisible(sel)) {
246 for(c = stack; c && !isvisible(c); c = c->snext);
253 focusnext(Arg *arg) {
259 if(!(c = getnext(sel->next)))
260 c = getnext(clients);
268 focusprev(Arg *arg) {
274 if(!(c = getprev(sel->prev))) {
275 for(c = clients; c && c->next; c = c->next);
285 isvisible(Client *c) {
288 for(i = 0; i < ntags; i++)
289 if(c->tags[i] && seltag[i])
295 resizecol(Arg *arg) {
299 for(n = 0, c = clients; c; c = c->next)
300 if(isvisible(c) && !c->isfloat)
302 if(!sel || sel->isfloat || n < 2 || (arrange == dofloat))
305 if(sel == getnext(clients)) {
306 if(master + arg->i > sw - MINW || master + arg->i < MINW)
311 if(master - arg->i > sw - MINW || master - arg->i < MINW)
327 if(sel->isfloat || arrange == dofloat) {
328 XRaiseWindow(dpy, sel->win);
329 XRaiseWindow(dpy, sel->twin);
331 if(arrange != dofloat)
332 for(c = nexttiled(clients); c; c = nexttiled(c->next)) {
333 XLowerWindow(dpy, c->twin);
334 XLowerWindow(dpy, c->win);
338 while(XCheckMaskEvent(dpy, EnterWindowMask, &ev));
342 togglemode(Arg *arg) {
343 arrange = (arrange == dofloat) ? dotile : dofloat;
351 toggleview(Arg *arg) {
354 seltag[arg->i] = !seltag[arg->i];
355 for(i = 0; i < ntags && !seltag[i]; i++);
357 seltag[arg->i] = True; /* cannot toggle last view */
363 togglestackdir(Arg *arg) {
364 if(arrange == dofloat)
366 isvertical = !isvertical;
371 togglestackpos(Arg *arg) {
372 if(arrange == dofloat)
374 if(stackpos == StackBottom)
377 stackpos = StackBottom;
384 master = ((stackpos == StackBottom ? sh - bh : sw) * MASTER) / 100;
391 for(i = 0; i < ntags; i++)
393 seltag[arg->i] = True;
402 for(i = 0; i < ntags; i++)
418 if(sel->isfloat || (arrange == dofloat)) {
423 for(n = 0, c = clients; c; c = c->next)
424 if(isvisible(c) && !c->isfloat)
426 if(n < 2 || (arrange == dofloat))
429 if((c = sel) == nexttiled(clients))
430 if(!(c = nexttiled(c->next)))