equal
deleted
inserted
replaced
258 return; |
258 return; |
259 } |
259 } |
260 for(n = 0, c = nexttiled(clients); c; c = nexttiled(c->next)) |
260 for(n = 0, c = nexttiled(clients); c; c = nexttiled(c->next)) |
261 n++; |
261 n++; |
262 |
262 |
263 c = sel; |
263 if((c = sel) == nexttiled(clients)) |
264 if((arrange != dofloat) && c != nexttiled(clients)) { |
264 if(!(c = nexttiled(c->next))) |
265 detach(c); |
265 return; |
266 if(clients) |
266 detach(c); |
267 clients->prev = c; |
267 if(clients) |
268 c->next = clients; |
268 clients->prev = c; |
269 clients = c; |
269 c->next = clients; |
270 focus(c); |
270 clients = c; |
271 arrange(); |
271 focus(c); |
272 } |
272 arrange(); |
273 } |
273 } |