-dofloat(Arg *arg) {
- Client *c;
-
- for(c = clients; c; c = c->next) {
- if(isvisible(c)) {
- resize(c, True, TopLeft);
- }
- else
- ban(c);
- }
- if(!sel || !isvisible(sel)) {
- for(c = stack; c && !isvisible(c); c = c->snext);
- focus(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;
-
- for(n = 0, c = nexttiled(clients); c; c = nexttiled(c->next))
- n++;
-
- 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)) {
- if(c->isfloat) {
- resize(c, True, TopLeft);
- continue;
- }
- c->ismax = False;
- if(n == 1) {
- c->x = sx;
- c->y = sy + bh;
- c->w = sw - 2 * BORDERPX;
- c->h = sh - 2 * BORDERPX - bh;
- }
- else if(i == 0) {
- c->x = sx;
- c->y = sy + bh;
- c->w = master - 2 * BORDERPX;
- c->h = sh - 2 * BORDERPX - bh;
- }
- else if(h > bh) {
- c->x = sx + master;
- c->y = sy + (i - 1) * h + bh;
- c->w = w - 2 * BORDERPX;
- if(i + 1 == n)
- c->h = sh - c->y - 2 * BORDERPX;
- else
- c->h = h - 2 * BORDERPX;
- }
- else { /* fallback if h < bh */
- c->x = sx + master;
- c->y = sy + bh;
- c->w = w - 2 * BORDERPX;
- c->h = sh - 2 * BORDERPX - bh;
- }
- resize(c, False, TopLeft);
- i++;
- }
- else
- ban(c);
- }
- if(!sel || !isvisible(sel)) {
- for(c = stack; c && !isvisible(c); c = c->snext);
- focus(c);
- }
- restack();