equal
deleted
inserted
replaced
106 stackh = sh - bh; |
106 stackh = sh - bh; |
107 th = stackh; |
107 th = stackh; |
108 if(n > 1) |
108 if(n > 1) |
109 th /= (n - 1); |
109 th /= (n - 1); |
110 |
110 |
111 for(i = 0, c = clients; c; c = c->next, i++) |
111 for(i = 0, c = clients; c; c = c->next) |
112 if(isvisible(c)) { |
112 if(isvisible(c)) { |
113 if(c->isfloat) { |
113 if(c->isfloat) { |
114 resize(c, True, TopLeft); |
114 resize(c, True, TopLeft); |
115 continue; |
115 continue; |
116 } |
116 } |
137 } |
137 } |
138 else /* fallback if th < bh */ |
138 else /* fallback if th < bh */ |
139 c->h = stackh - 2 * BORDERPX; |
139 c->h = stackh - 2 * BORDERPX; |
140 } |
140 } |
141 resize(c, False, TopLeft); |
141 resize(c, False, TopLeft); |
|
142 i++; |
142 } |
143 } |
143 else |
144 else |
144 ban(c); |
145 ban(c); |
145 |
146 |
146 if(!sel || !isvisible(sel)) { |
147 if(!sel || !isvisible(sel)) { |