equal
deleted
inserted
replaced
100 int h, i, n, w; |
100 int h, i, n, w; |
101 Client *c; |
101 Client *c; |
102 |
102 |
103 w = sw - mw; |
103 w = sw - mw; |
104 for(n = 0, c = clients; c; c = c->next) |
104 for(n = 0, c = clients; c; c = c->next) |
105 if(isvisible(c)) { |
105 if(isvisible(c) && !c->isfloat) |
106 if(c->isfloat) { |
106 n++; |
107 if(c->ismax) |
|
108 togglemax(c); |
|
109 } |
|
110 else |
|
111 n++; |
|
112 } |
|
113 |
107 |
114 if(n > 1) |
108 if(n > 1) |
115 h = (sh - bh) / (n - 1); |
109 h = (sh - bh) / (n - 1); |
116 else |
110 else |
117 h = sh - bh; |
111 h = sh - bh; |
118 |
112 |
119 for(i = 0, c = clients; c; c = c->next) { |
113 for(i = 0, c = clients; c; c = c->next) { |
120 if(isvisible(c)) { |
114 if(isvisible(c)) { |
|
115 if(c->ismax) |
|
116 togglemax(c); |
121 if(c->isfloat) { |
117 if(c->isfloat) { |
122 resize(c, True, TopLeft); |
118 resize(c, True, TopLeft); |
123 continue; |
119 continue; |
124 } |
120 } |
125 if(n == 1) { |
121 if(n == 1) { |