/* extern */
void (*arrange)(Arg *) = DEFMODE;
+Bool isvertical = VERTICALSTACK;
+StackPos stackpos = STACKPOS;
void
detach(Client *c) {
restack();
}
+/* This algorithm is based on a (M)aster area and a (S)tacking area.
+ * It supports following arrangements:
+ * MMMS MMMM SMMM
+ * MMMS MMMM SMMM
+ * MMMS SSSS SMMM
+ */
void
dotile(Arg *arg) {
int h, i, n, w;
Client *c;
- w = sw - mw;
for(n = 0, c = nexttiled(clients); c; c = nexttiled(c->next))
n++;
- if(n > 1)
- h = (sh - bh) / (n - 1);
- else
- h = sh - bh;
+ if(isvertical) {
+ if(stackpos == StackBottom) {
+ w = sw;
+ if(n > 1)
+ h = (sh - bh) / (n - 1);
+ else
+ h = sh - bh;
+ }
+ else {
+ w = sw - master;
+ if(n > 1)
+ h = (sh - bh) / (n - 1);
+ else
+ h = sh - bh;
+ }
+ }
+ else { /* horizontal stack */
+
+ }
for(i = 0, c = clients; c; c = c->next) {
if(isvisible(c)) {
else if(i == 0) {
c->x = sx;
c->y = sy + bh;
- c->w = mw - 2 * BORDERPX;
+ c->w = master - 2 * BORDERPX;
c->h = sh - 2 * BORDERPX - bh;
}
else if(h > bh) {
- c->x = sx + mw;
+ c->x = sx + master;
c->y = sy + (i - 1) * h + bh;
c->w = w - 2 * BORDERPX;
if(i + 1 == n)
c->h = h - 2 * BORDERPX;
}
else { /* fallback if h < bh */
- c->x = sx + mw;
+ c->x = sx + master;
c->y = sy + bh;
c->w = w - 2 * BORDERPX;
c->h = sh - 2 * BORDERPX - bh;
return;
if(sel == getnext(clients)) {
- if(mw + arg->i > sw - 100 || mw + arg->i < 100)
+ if(master + arg->i > sw - 100 || master + arg->i < 100)
return;
- mw += arg->i;
+ master += arg->i;
}
else {
- if(mw - arg->i > sw - 100 || mw - arg->i < 100)
+ if(master - arg->i > sw - 100 || master - arg->i < 100)
return;
- mw -= arg->i;
+ master -= arg->i;
}
arrange(NULL);
}