equal
deleted
inserted
replaced
257 return False; |
257 return False; |
258 } |
258 } |
259 |
259 |
260 void |
260 void |
261 resizecol(Arg *arg) { |
261 resizecol(Arg *arg) { |
|
262 int s; |
262 unsigned int n; |
263 unsigned int n; |
263 Client *c; |
264 Client *c; |
264 |
265 |
265 for(n = 0, c = clients; c; c = c->next) |
266 for(n = 0, c = clients; c; c = c->next) |
266 if(isvisible(c) && !c->isfloat) |
267 if(isvisible(c) && !c->isfloat) |
267 n++; |
268 n++; |
268 if(!sel || sel->isfloat || n < 2 || (arrange == dofloat)) |
269 if(!sel || sel->isfloat || n < 2 || (arrange == dofloat)) |
269 return; |
270 return; |
270 |
271 |
|
272 s = stackpos == StackBottom ? sh - bh : sw; |
271 if(sel == getnext(clients)) { |
273 if(sel == getnext(clients)) { |
272 if(master + arg->i > sw - MINW || master + arg->i < MINW) |
274 if(master + arg->i > s - MINW || master + arg->i < MINW) |
273 return; |
275 return; |
274 master += arg->i; |
276 master += arg->i; |
275 } |
277 } |
276 else { |
278 else { |
277 if(master - arg->i > sw - MINW || master - arg->i < MINW) |
279 if(master - arg->i > s - MINW || master - arg->i < MINW) |
278 return; |
280 return; |
279 master -= arg->i; |
281 master -= arg->i; |
280 } |
282 } |
281 arrange(NULL); |
283 arrange(NULL); |
282 } |
284 } |