aboutsummaryrefslogtreecommitdiffstats
path: root/tag.c
diff options
context:
space:
mode:
authorAnselm R. Garbe <arg@suckless.org>2007-02-22 11:42:08 +0100
committerAnselm R. Garbe <arg@suckless.org>2007-02-22 11:42:08 +0100
commit2c477cf66147d369ae8ff17acdce743c6811ee6a (patch)
tree121a031caf30be9f6931e37e26cf2469c8c7acfa /tag.c
parent986ca73074ef165880c75ee46a4eb6a1b328dc5b (diff)
downloaddwm-2c477cf66147d369ae8ff17acdce743c6811ee6a.tar.gz
replaced Arg union with const char *arg, seems cleaner to me, even if we need atoi() in some places
Diffstat (limited to 'tag.c')
-rw-r--r--tag.c50
1 files changed, 27 insertions, 23 deletions
diff --git a/tag.c b/tag.c
index d946309..a96cc62 100644
--- a/tag.c
+++ b/tag.c
@@ -102,49 +102,53 @@ settags(Client *c, Client *trans) {
}
void
-tag(Arg arg) {
- unsigned int i;
+tag(const char *arg) {
+ int i;
if(!sel)
return;
for(i = 0; i < ntags; i++)
- sel->tags[i] = (arg.i == -1) ? True : False;
- if(arg.i >= 0 && arg.i < ntags)
- sel->tags[arg.i] = True;
+ sel->tags[i] = arg ? False : True;
+ i = arg ? atoi(arg) : 0;
+ if(i >= 0 && i < ntags)
+ sel->tags[i] = True;
lt->arrange();
}
void
-toggletag(Arg arg) {
- unsigned int i;
+toggletag(const char *arg) {
+ int i, j;
if(!sel)
return;
- sel->tags[arg.i] = !sel->tags[arg.i];
- for(i = 0; i < ntags && !sel->tags[i]; i++);
- if(i == ntags)
- sel->tags[arg.i] = True;
+ i = arg ? atoi(arg) : 0;
+ sel->tags[i] = !sel->tags[i];
+ for(j = 0; j < ntags && !sel->tags[j]; j++);
+ if(j == ntags)
+ sel->tags[i] = True;
lt->arrange();
}
void
-toggleview(Arg arg) {
- unsigned int i;
-
- seltag[arg.i] = !seltag[arg.i];
- for(i = 0; i < ntags && !seltag[i]; i++);
- if(i == ntags)
- seltag[arg.i] = True; /* cannot toggle last view */
+toggleview(const char *arg) {
+ int i, j;
+
+ i = arg ? atoi(arg) : 0;
+ seltag[i] = !seltag[i];
+ for(j = 0; j < ntags && !seltag[j]; i++);
+ if(j == ntags)
+ seltag[i] = True; /* cannot toggle last view */
lt->arrange();
}
void
-view(Arg arg) {
- unsigned int i;
+view(const char *arg) {
+ int i;
for(i = 0; i < ntags; i++)
- seltag[i] = (arg.i == -1) ? True : False;
- if(arg.i >= 0 && arg.i < ntags)
- seltag[arg.i] = True;
+ seltag[i] = arg ? False : True;
+ i = arg ? atoi(arg) : 0;
+ if(i >= 0 && i < ntags)
+ seltag[i] = True;
lt->arrange();
}
remember that computers suck.