git.stevedylan.dev

fififif 321e8d51

arg@mig29 · 2006-11-22 16:17 3 file(s) · +1 −37

dwm.h +1 −1

	int basew, baseh, incw, inch, maxw, maxh, minw, minh;
	int grav;
	long flags; 
	unsigned int border, weight;
	unsigned int border;
	Bool isfloat, isfixed, ismax;
	Bool *tags;
	Client *next;

tag.c +0 −3

	if(!matched)
		for(i = 0; i < ntags; i++)
			c->tags[i] = seltag[i];
	for(c->weight = 0; c->weight < ntags && !c->tags[c->weight]; c->weight++);
}

void

	for(i = 0; i < ntags; i++)
		sel->tags[i] = False;
	sel->tags[arg->i] = True;
	sel->weight = arg->i;
	arrange();
}


	for(i = 0; i < ntags && !sel->tags[i]; i++);
	if(i == ntags)
		sel->tags[arg->i] = True;
	sel->weight = (i == ntags) ? arg->i : i;
	arrange();
}

view.c +0 −33

/* static */

static Client *
minclient(void) {
	Client *c, *min;

	if((clients && clients->isfloat) || arrange == dofloat)
		return clients; /* don't touch floating order */
	for(min = c = clients; c; c = c->next)
		if(c->weight < min->weight)
			min = c;
	return min;
}

static Client *
nexttiled(Client *c) {
	for(c = getnext(c); c && c->isfloat; c = getnext(c->next));
	return c;
}

static void
reorder(void) {
	Client *c, *newclients, *tail;

	newclients = tail = NULL;
	while((c = minclient())) {
		detach(c);
		if(tail) {
			c->prev = tail;
			tail->next = c;
			tail = c;
		}
		else
			tail = newclients = c;
	}
	clients = newclients;
}

static void

	for(i = 0; i < ntags && !seltag[i]; i++);
	if(i == ntags)
		seltag[arg->i] = True; /* cannot toggle last view */
	reorder();
	arrange();
}


	for(i = 0; i < ntags; i++)
		seltag[i] = False;
	seltag[arg->i] = True;
	reorder();
	arrange();
}



	for(i = 0; i < ntags; i++)
		seltag[i] = True;
	reorder();
	arrange();
}


82	82		int basew, baseh, incw, inch, maxw, maxh, minw, minh;
83	83		int grav;
84	84		long flags;
85		-	unsigned int border, weight;
	85	+	unsigned int border;
86	86		Bool isfloat, isfixed, ismax;
87	87		Bool *tags;
88	88		Client *next;

104	104		if(!matched)
105	105		for(i = 0; i < ntags; i++)
106	106		c->tags[i] = seltag[i];
107		-	for(c->weight = 0; c->weight < ntags && !c->tags[c->weight]; c->weight++);
108	107		}
109	108
110	109		void

116	115		for(i = 0; i < ntags; i++)
117	116		sel->tags[i] = False;
118	117		sel->tags[arg->i] = True;
119		-	sel->weight = arg->i;
120	118		arrange();
121	119		}
122	120

130	128		for(i = 0; i < ntags && !sel->tags[i]; i++);
131	129		if(i == ntags)
132	130		sel->tags[arg->i] = True;
133		-	sel->weight = (i == ntags) ? arg->i : i;
134	131		arrange();
135	132		}

6	6		/* static */
7	7
8	8		static Client *
9		-	minclient(void) {
10		-	Client c, min;
11		-
12		-	if((clients && clients->isfloat) \|\| arrange == dofloat)
13		-	return clients; /* don't touch floating order */
14		-	for(min = c = clients; c; c = c->next)
15		-	if(c->weight < min->weight)
16		-	min = c;
17		-	return min;
18		-	}
19		-
20		-	static Client *
21	9		nexttiled(Client *c) {
22	10		for(c = getnext(c); c && c->isfloat; c = getnext(c->next));
23	11		return c;
24		-	}
25		-
26		-	static void
27		-	reorder(void) {
28		-	Client c, newclients, *tail;
29		-
30		-	newclients = tail = NULL;
31		-	while((c = minclient())) {
32		-	detach(c);
33		-	if(tail) {
34		-	c->prev = tail;
35		-	tail->next = c;
36		-	tail = c;
37		-	}
38		-	else
39		-	tail = newclients = c;
40		-	}
41		-	clients = newclients;
42	12		}
43	13
44	14		static void

247	217		for(i = 0; i < ntags && !seltag[i]; i++);
248	218		if(i == ntags)
249	219		seltag[arg->i] = True; /* cannot toggle last view */
250		-	reorder();
251	220		arrange();
252	221		}
253	222

258	227		for(i = 0; i < ntags; i++)
259	228		seltag[i] = False;
260	229		seltag[arg->i] = True;
261		-	reorder();
262	230		arrange();
263	231		}
264	232

268	236
269	237		for(i = 0; i < ntags; i++)
270	238		seltag[i] = True;
271		-	reorder();
272	239		arrange();
273	240		}
274	241