| author | David Anderson <dvander@alliedmods.net> |
| Sat Feb 04 21:45:10 2006 +0000 (2006-02-04) | |
| changeset 178 | db1b448191c0 |
| parent 143 | f6be29c3cdb2 |
| child 193 | 184b3f1559c0 |
| permissions | -rwxr-xr-x |
1 /* ======== SourceMM ========
2 * Copyright (C) 2004-2005 Metamod:Source Development Team
3 * No warranties of any kind
4 *
5 * License: zlib/libpng
6 *
7 * Author(s): David "BAILOPAN" Anderson
8 * ============================
9 */
11 /* AMX Mod X
12 *
13 * by the AMX Mod X Development Team
14 */
16 #ifndef _INCLUDE_CSTRING_H
17 #define _INCLUDE_CSTRING_H
19 #include <string.h>
20 #include <stdio.h>
22 namespace SourceHook
23 {
24 class String
25 {
26 public:
27 String()
28 {
29 v = NULL;
30 a_size = 0;
31 //assign("");
32 }
34 ~String()
35 {
36 if (v)
37 delete [] v;
38 }
40 String(const char *src)
41 {
42 v = NULL;
43 a_size = 0;
44 assign(src);
45 }
47 String(const String &src)
48 {
49 v = NULL;
50 a_size = 0;
51 assign(src.c_str());
52 }
54 const char *c_str() { return v?v:""; }
56 const char *c_str() const { return v?v:""; }
58 void append(const char *t)
59 {
60 Grow(size() + strlen(t) + 1);
61 strcat(v, t);
62 }
64 void append(const char c)
65 {
66 size_t len = size();
67 Grow(len + 2);
68 v[len] = c;
69 v[len + 1] = '\0';
70 }
72 void append(String &d)
73 {
74 append(d.c_str());
75 }
77 void assign(const String &src)
78 {
79 assign(src.c_str());
80 }
82 void assign(const char *d)
83 {
84 if (!d)
85 {
86 clear();
87 } else {
88 Grow(strlen(d) + 1, false);
89 strcpy(v, d);
90 }
91 }
93 void clear()
94 {
95 if (v)
96 v[0] = '\0';
97 }
99 int compare (const char *d)
100 {
101 if (!v)
102 return strcmp("", d);
103 else
104 return strcmp(v, d);
105 }
107 //Added this for amxx inclusion
108 bool empty()
109 {
110 if (!v)
111 return true;
113 if (v[0] == '\0')
114 return true;
116 return false;
117 }
119 size_t size()
120 {
121 if (v)
122 return strlen(v);
123 else
124 return 0;
125 }
127 int find(const char c, int index = 0)
128 {
129 int len = static_cast<int>(size());
130 if (len < 1)
131 return npos;
132 if (index >= len || index < 0)
133 return npos;
134 int i = 0;
135 for (i=index; i<len; i++)
136 {
137 if (v[i] == c)
138 {
139 return i;
140 }
141 }
143 return npos;
144 }
146 bool is_space(int c)
147 {
148 if (c == '\f' || c == '\n' ||
149 c == '\t' || c == '\r' ||
150 c == '\v' || c == ' ')
151 {
152 return true;
153 }
155 return false;
156 }
158 void trim()
159 {
160 if (!v)
161 return;
163 unsigned int i = 0;
164 unsigned int j = 0;
165 size_t len = strlen(v);
167 if (len == 1)
168 {
169 if (is_space(v[i]))
170 {
171 clear();
172 return;
173 }
174 }
176 unsigned char c0 = v[0];
178 if (is_space(c0))
179 {
180 for (i=0; i<len; i++)
181 {
182 if (!is_space(v[i]) || (is_space(v[i]) && ((unsigned char)i==len-1)))
183 {
184 erase(0, i);
185 break;
186 }
187 }
188 }
190 len = strlen(v);
192 if (len < 1)
193 {
194 return;
195 }
197 if (is_space(v[len-1]))
198 {
199 for (i=len-1; i>=0; i--)
200 {
201 if (!is_space(v[i])
202 || (is_space(v[i]) && i==0))
203 {
204 erase(i+1, j);
205 break;
206 }
207 j++;
208 }
209 }
211 if (len == 1)
212 {
213 if (is_space(v[0]))
214 {
215 clear();
216 return;
217 }
218 }
219 }
221 void erase(unsigned int start, int num = npos)
222 {
223 if (!v)
224 return;
225 unsigned int i = 0;
226 size_t len = size();
227 //check for bounds
228 if (num == npos || start+num > len-start)
229 num = len - start;
230 //do the erasing
231 bool copyflag = false;
232 for (i=0; i<len; i++)
233 {
234 if (i>=start && i<start+num)
235 {
236 if (i+num < len)
237 {
238 v[i] = v[i+num];
239 } else {
240 v[i] = 0;
241 }
242 copyflag = true;
243 } else if (copyflag) {
244 if (i+num < len)
245 {
246 v[i] = v[i+num];
247 } else {
248 v[i] = 0;
249 }
250 }
251 }
252 len -= num;
253 v[len] = 0;
254 }
256 String substr(unsigned int index, int num = npos)
257 {
258 if (!v)
259 {
260 String b("");
261 return b;
262 }
264 String ns;
266 size_t len = size();
268 if (index >= len || !v)
269 return ns;
271 if (num == npos)
272 {
273 num = len - index;
274 } else if (index+num >= len) {
275 num = len - index;
276 }
278 unsigned int i = 0;
279 unsigned int nslen = num + 2;
281 ns.Grow(nslen);
283 for (i=index; i<index+num; i++)
284 ns.append(v[i]);
286 return ns;
287 }
289 void toLower()
290 {
291 if (!v)
292 return;
293 unsigned int i = 0;
294 size_t len = strlen(v);
295 for (i=0; i<len; i++)
296 {
297 if (v[i] >= 65 && v[i] <= 90)
298 v[i] &= ~(1<<5);
299 }
300 }
302 String & operator = (const String &src)
303 {
304 assign(src);
305 return *this;
306 }
308 String & operator = (const char *src)
309 {
310 assign(src);
311 return *this;
313 }
315 char operator [] (unsigned int index)
316 {
317 if (index > size() || !v)
318 {
319 return -1;
320 } else {
321 return v[index];
322 }
323 }
325 int at(int a)
326 {
327 if (a < 0 || a >= (int)size() || !v)
328 return -1;
330 return v[a];
331 }
333 bool at(int at, char c)
334 {
335 if (at < 0 || at >= (int)size() || !v)
336 return false;
338 v[at] = c;
340 return true;
341 }
343 private:
344 void Grow(unsigned int d, bool copy=true)
345 {
346 if (d <= a_size)
347 return;
348 char *n = new char[d + 1];
349 if (copy && v)
350 strcpy(n, v);
351 if (v)
352 delete [] v;
353 else
354 strcpy(n, "");
355 v = n;
356 a_size = d + 1;
357 }
359 char *v;
360 unsigned int a_size;
361 public:
362 static const int npos = -1;
363 };
365 }; //NAMESPACE
367 #endif //_INCLUDE_CSTRING_H