1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
|
#
# Copyright (C) 2005, 2006 Stephen Jungels
#
# This program is free software; you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation; either version 2 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful, but
# WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# General Public License for more details.
#
# See COPYING for the full text of the license.
BEGIN {
all = "";
search = "";
levelsep = "/";
skipindex = 0;
playindex = 0;
}
state==0 {
printf \
("y: yes\nn: no\nY: yes to all\nN: no to all\n") > "/dev/tty";
printf \
("u: up a level\nd: down a level\n/: search\n") > "/dev/tty";
state = 1;
}
state==1 {
brief = $0;
sub(prefix, "", brief);
action = "";
response = "";
len = 0;
# take the advice of the longest (most specific) hint
for (i=1; i<=skipindex; i++)
{
if (index(tolower(brief), tolower(skiphints[i])) > 0 && length(skiphints[i]) > len)
{
action = "n";
len = length(skiphints[i]);
}
}
for (i=1; i<=playindex; i++)
{
if (index(tolower(brief), tolower(playhints[i])) > 0 && length(playhints[i]) > len)
{
action = "y";
break;
}
}
if (action=="" && all!="")
{
action = all;
}
if (action=="" && search!="")
{
if (tolower(brief) ~ tolower(search))
{
search = "";
}
else
{
action = "n";
}
}
if (action=="y")
{
printf ("%s\n", $0);
}
# if hints and "all" gave no instructions, ask the user
else if (action=="")
{
levels = split(brief, briefparts, levelsep);
if (levels + levelindex < 1)
{
levelindex = 1 - levels;
}
for (i=1; i<=levels; i++)
{
# escape regex special chars that might appear in a filename
briefparts2[i] = briefparts[i];
# gsub("\\(", "\\(", briefparts2[i]);
# gsub("\\)", "\\)", briefparts2[i]);
# gsub("\\+", "\\+", briefparts2[i]);
# gsub("\\[", "\\[", briefparts2[i]);
# gsub("\\]", "\\]", briefparts2[i]);
# gsub("\\|", "\\|", briefparts2[i]);
# gsub("\\*", "\\*", briefparts2[i]);
}
cont = 1;
while (cont==1)
{
cont = 0;
str = "";
str2 = "";
sep = "";
sep2 = "";
for (i=1; i<=levels+levelindex; i++)
{
str = str sep briefparts2[i];
str2 = str2 sep2 briefparts[i];
sep = levelsep;
sep2 = "/";
}
printf("Play %s (ynYNud/)? ", str2) > "/dev/tty";
getline response < "/dev/tty";
if (response ~ /^u(p)?/)
{
cont = 1;
levelindex -= 1;
if (levels + levelindex < 1)
{
levelindex = 1 - levels;
}
}
if (response ~ /^d(own)?/)
{
cont = 1;
levelindex += 1;
if (levelindex > 0)
{
levelindex = 0;
}
}
}
if (response ~ /^Y(es)?/)
{
response = "y";
all = "y";
}
else if (response ~ /^N(o)?/)
{
response = "n";
all = "n";
}
else if (response ~ /^\//)
{
search = substr(response, 2);
if (search=="")
{
search = savesearch;
}
if (search=="")
{
printf("Search string: ") > "/dev/tty";
getline search < "/dev/tty";
}
savesearch = search;
response = "n";
}
if (response ~ /y(es)?/ || response=="")
{
printf("%s\n", $0);
# if we're above track level, this may match more than one track, so save it
if (levelindex < 0)
{
playhints[++playindex] = str;
}
}
else if (response ~ /n(o)?/)
{
if (levelindex < 0)
{
skiphints[++skipindex] = str;
}
}
}
}
|
