Alopex

Check-in [9e3fb049e2]

Many hyperlinks are disabled.
Use anonymous login to enable hyperlinks.

Overview
Comment:fixed no-bar bug for monocle layout without clients
Downloads: Tarball | ZIP archive | SQL archive
Timelines: family | ancestors | descendants | both | trunk | master
Files: files | file ages | folders
SHA3-256: 9e3fb049e20b88d212b8daa08cf89b200da1562fb4294782c93ffb816350b0df
User & Date: jesse@mccluresk9.com 2014-02-19 19:03:39
Context
2014-02-19
21:34
ridiculous work around for SDL games check-in: 726de2392a user: jesse@mccluresk9.com tags: trunk, master
19:03
fixed no-bar bug for monocle layout without clients check-in: 9e3fb049e2 user: jesse@mccluresk9.com tags: trunk, master
2014-02-18
00:28
reverting 0ad fix due to unintended side effects check-in: 282e275f8f user: jesse@mccluresk9.com tags: trunk, master
Changes
Hide Diffs Unified Diffs Ignore Whitespace Patch

Changes to src/tile.c. 

18
19
20
21
22
23
24
25
26
27
28
29
30
31

32
33
34
35
36
37
38

	Container *C;
	Client *c, *pc, *t;
	int num, cn, numC, ord;
	for (M = mons; M; M = M->next) {
		/* calculate how many containers will be used: */
		if (M->mode == MONOCLE) {
			M->focus = M->container;
			numC = 1;
			M->occ = 0;
			for (c = clients; c; c = c->next) {
				M->occ |= (c->tags & 0xFFFF);
				if (tile_check(M, c)) {
					if (!winmarks[1]) winmarks[1] = c;
					if (c == winmarks[1]) M->container->top = c;

				}
			}
		}
		else { /* {r/b}stack: */
			c = clients;
			M->occ = 0;
			for (numC = 0, C = M->container; C; C = C->next, numC++) {








|






>








18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39

	Container *C;
	Client *c, *pc, *t;
	int num, cn, numC, ord;
	for (M = mons; M; M = M->next) {
		/* calculate how many containers will be used: */
		if (M->mode == MONOCLE) {
			M->focus = M->container;
			numC = 0;
			M->occ = 0;
			for (c = clients; c; c = c->next) {
				M->occ |= (c->tags & 0xFFFF);
				if (tile_check(M, c)) {
					if (!winmarks[1]) winmarks[1] = c;
					if (c == winmarks[1]) M->container->top = c;
					numC = 1;
				}
			}
		}
		else { /* {r/b}stack: */
			c = clients;
			M->occ = 0;
			for (numC = 0, C = M->container; C; C = C->next, numC++) {