X-Git-Url: https://jasonwoof.com/gitweb/?a=blobdiff_plain;f=tag.c;h=bbed872149e657064223b60e5295214f94d72db6;hb=77044e876511f51c34bde379d89e2de754707ee6;hp=ccc295692a85f2d14dfa3f95600a40cbb7562152;hpb=5711609203602bd01b4b131572142bb171ffc560;p=dwm.git

diff --git a/tag.c b/tag.c
index ccc2956..bbed872 100644
--- a/tag.c
+++ b/tag.c
@@ -1,6 +1,4 @@
-/* (C)opyright MMVI-MMVII Anselm R. Garbe <garbeam at gmail dot com>
- * See LICENSE file for license details.
- */
+/* See LICENSE file for copyright and license details. */
 #include "dwm.h"
 #include <regex.h>
 #include <stdio.h>
@@ -12,7 +10,7 @@
 typedef struct {
 	const char *prop;
 	const char *tags;
-	Bool isversatile;
+	Bool isfloating;
 } Rule;
 
 typedef struct {
@@ -83,7 +81,7 @@ settags(Client *c, Client *trans) {
 				ch.res_name ? ch.res_name : "", c->name);
 		for(i = 0; i < nrules; i++)
 			if(regs[i].propregex && !regexec(regs[i].propregex, prop, 1, &tmp, 0)) {
-				c->isversatile = rule[i].isversatile;
+				c->isfloating = rule[i].isfloating;
 				for(j = 0; regs[i].tagregex && j < ntags; j++) {
 					if(!regexec(regs[i].tagregex, tags[j], 1, &tmp, 0)) {
 						matched = True;
@@ -108,11 +106,11 @@ tag(const char *arg) {
 	if(!sel)
 		return;
 	for(i = 0; i < ntags; i++)
-		sel->tags[i] = arg != NULL;
+		sel->tags[i] = arg == NULL;
 	i = arg ? atoi(arg) : 0;
 	if(i >= 0 && i < ntags)
 		sel->tags[i] = True;
-	lt->arrange();
+	arrange();
 }
 
 void
@@ -126,7 +124,7 @@ toggletag(const char *arg) {
 	for(j = 0; j < ntags && !sel->tags[j]; j++);
 	if(j == ntags)
 		sel->tags[i] = True;
-	lt->arrange();
+	arrange();
 }
 
 void
@@ -138,7 +136,7 @@ toggleview(const char *arg) {
 	for(j = 0; j < ntags && !seltag[j]; j++);
 	if(j == ntags)
 		seltag[i] = True; /* cannot toggle last view */
-	lt->arrange();
+	arrange();
 }
 
 void
@@ -146,9 +144,9 @@ view(const char *arg) {
 	int i;
 
 	for(i = 0; i < ntags; i++)
-		seltag[i] = arg != NULL;
+		seltag[i] = arg == NULL;
 	i = arg ? atoi(arg) : 0;
 	if(i >= 0 && i < ntags)
 		seltag[i] = True;
-	lt->arrange();
+	arrange();
 }