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
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
|
/*
* File: libutil.h
* Summary: System indepentant functions
*
* Modified for Crawl Reference by $Author$ on $Date$
*
* Change History (most recent first):
*
* <1> 2001/Nov/01 BWR Created
*
*/
#ifndef LIBUTIL_H
#define LIBUTIL_H
#include <string>
#include <vector>
// getch() that returns a consistent set of values for all platforms.
int c_getch();
void play_sound(const char *file);
// Pattern matching
void *compile_pattern(const char *pattern, bool ignore_case = false);
void free_compiled_pattern(void *cp);
bool pattern_match(void *compiled_pattern, const char *text, int length);
void get_input_line( char *const buff, int len );
class input_history;
// Returns true if user pressed Enter, false if user hit Escape.
bool cancelable_get_line( char *buf, int len, int wrapcol = 80,
input_history *mh = NULL );
std::string & trim_string( std::string &str );
std::vector<std::string> split_string(const char *sep, std::string s);
#ifdef NEED_USLEEP
void usleep( unsigned long time );
#endif
#ifdef NEED_SNPRINTF
int snprintf( char *str, size_t size, const char *format, ... );
#endif
// Keys that getch() must return for keys Crawl is interested in.
enum KEYS
{
CK_ENTER = '\r',
CK_BKSP = 8,
CK_ESCAPE = '\x1b',
// 128 is off-limits because it's the code that's used when running
CK_DELETE = 129,
// This sequence of enums should not be rearranged.
CK_UP,
CK_DOWN,
CK_LEFT,
CK_RIGHT,
CK_INSERT,
CK_HOME,
CK_END,
CK_CLEAR,
CK_PGUP,
CK_PGDN,
CK_SHIFT_UP,
CK_SHIFT_DOWN,
CK_SHIFT_LEFT,
CK_SHIFT_RIGHT,
CK_SHIFT_INSERT,
CK_SHIFT_HOME,
CK_SHIFT_END,
CK_SHIFT_CLEAR,
CK_SHIFT_PGUP,
CK_SHIFT_PGDN,
CK_CTRL_UP,
CK_CTRL_DOWN,
CK_CTRL_LEFT,
CK_CTRL_RIGHT,
CK_CTRL_INSERT,
CK_CTRL_HOME,
CK_CTRL_END,
CK_CTRL_CLEAR,
CK_CTRL_PGUP,
CK_CTRL_PGDN
};
class base_pattern
{
public:
virtual ~base_pattern() { };
virtual bool valid() const = 0;
virtual bool matches(const std::string &s) const = 0;
};
class text_pattern : public base_pattern
{
public:
text_pattern(const std::string &s, bool icase = false)
: pattern(s), compiled_pattern(NULL),
isvalid(true), ignore_case(icase)
{
}
text_pattern()
: pattern(), compiled_pattern(NULL),
isvalid(false), ignore_case(false)
{
}
text_pattern(const text_pattern &tp)
: base_pattern(tp),
pattern(tp.pattern),
compiled_pattern(NULL),
isvalid(tp.isvalid),
ignore_case(tp.ignore_case)
{
}
~text_pattern()
{
if (compiled_pattern)
free_compiled_pattern(compiled_pattern);
}
const text_pattern &operator= (const text_pattern &tp)
{
if (this == &tp)
return tp;
if (compiled_pattern)
free_compiled_pattern(compiled_pattern);
pattern = tp.pattern;
compiled_pattern = NULL;
isvalid = tp.isvalid;
ignore_case = tp.ignore_case;
return *this;
}
const text_pattern &operator= (const std::string &spattern)
{
if (pattern == spattern)
return *this;
if (compiled_pattern)
free_compiled_pattern(compiled_pattern);
pattern = spattern;
compiled_pattern = NULL;
isvalid = true;
// We don't change ignore_case
return *this;
}
bool compile() const
{
// This function is const because compiled_pattern is not really part of
// the state of the object.
void *&cp = const_cast<text_pattern*>( this )->compiled_pattern;
return !empty()?
!!(cp = compile_pattern(pattern.c_str(), ignore_case))
: false;
}
bool empty() const
{
return !pattern.length();
}
bool valid() const
{
return isvalid &&
(compiled_pattern ||
(const_cast<text_pattern*>( this )->isvalid = compile()));
}
bool matches(const char *s, int length) const
{
return valid() && pattern_match(compiled_pattern, s, length);
}
bool matches(const char *s) const
{
return matches(std::string(s));
}
bool matches(const std::string &s) const
{
return matches(s.c_str(), s.length());
}
const std::string &tostring() const
{
return pattern;
}
private:
std::string pattern;
void *compiled_pattern;
bool isvalid;
bool ignore_case;
};
#endif
|
