aewl: view.c comparison

this algorithm seems to keep order for any scenario

comparison

equal deleted inserted replaced

-:fc279cd6c7be
+:4bf79305d675
 * (C)opyright MMVI Anselm R. Garbe <garbeam at gmail dot com>
 * See LICENSE file for license details.
 */
 #include "dwm.h"
+/* static */
+static Client *
+getslot(Client *c)
+{
+	unsigned int i, tic;
+	Client *p;
+	for(tic = 0; tic < ntags && !c->tags[tic]; tic++);
+	for(p = clients; p; p = p->next) {
+		for(i = 0; i < ntags && !p->tags[i]; i++);
+		if(tic < i)
+			return p;
+	}
+	return p;
+}
+static Client *
+tail()
+{
+	Client *c;
+	for(c = clients; c && c->next; c = c->next);
+	return c;
+}
 /* extern */
 void (*arrange)(Arg *) = DEFMODE;
 void
 attach(Client *c)
 {
-	Client *first = getnext(clients);
+	Client *p;
-	if(!first) {
+	if(!clients) {
-		if(clients) {
+		clients = c;
-			for(first = clients; first->next; first = first->next);
+		return;
-			first->next = c;
+	}
-			c->prev = first;
+	if(!(p = getnext(clients)) && !(p = getslot(c))) {
-		}
+		p = tail();
-		else
+		c->prev = p;
-			clients = c;
+		p->next = c;
-	}
+		return;
-	else if(first == clients) {
+	}
+	if(p == clients) {
 		c->next = clients;
 		clients->prev = c;
 		clients = c;
 	}
 	else {
-		first->prev->next = c;
+		p->prev->next = c;
-		c->prev = first->prev;
+		c->prev = p->prev;
-		first->prev = c;
+		p->prev = c;
-		c->next = first;
+		c->next = p;
 	}
 }
 void
 detach(Client *c)

Mercurial > aewl