| author | David Anderson <dvander@alliedmods.net> |
| Fri Aug 12 17:33:59 2005 +0000 (2005-08-12) | |
| changeset 97 | 7d3a2a8d5bf5 |
| parent 96 | e023f17b7b73 |
| 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 * originally developed by OLO
15 */
17 #ifndef _INCLUDE_CSTRING_H
18 #define _INCLUDE_CSTRING_H
20 #include <string.h>
21 #include <stdio.h>
23 class String
24 {
25 public:
26 String()
27 {
28 v = NULL;
29 a_size = 0;
30 //assign("");
31 }
33 ~String()
34 {
35 if (v)
36 delete [] v;
37 }
39 String(const char *src)
40 {
41 v = NULL;
42 a_size = 0;
43 assign(src);
44 }
46 String(String &src)
47 {
48 v = NULL;
49 a_size = 0;
50 assign(src.c_str());
51 }
53 const char *c_str() { return v?v:""; }
55 const char *c_str() const { return v?v:""; }
57 void append(const char *t)
58 {
59 Grow(size() + strlen(t) + 1);
60 strcat(v, t);
61 }
63 void append(const char c)
64 {
65 size_t len = size();
66 Grow(len + 2);
67 v[len] = c;
68 v[len + 1] = '\0';
69 }
71 void append(String &d)
72 {
73 append(d.c_str());
74 }
76 void assign(const String &src)
77 {
78 assign(src.c_str());
79 }
81 void assign(const char *d)
82 {
83 if (!d)
84 {
85 clear();
86 } else {
87 Grow(strlen(d) + 1, false);
88 strcpy(v, d);
89 }
90 }
92 void clear()
93 {
94 if (v)
95 v[0] = '\0';
96 }
98 int compare (const char *d)
99 {
100 if (!v)
101 return strcmp("", d);
102 else
103 return strcmp(v, d);
104 }
106 //Added this for amxx inclusion
107 bool empty()
108 {
109 if (!v)
110 return true;
112 if (v[0] == '\0')
113 return true;
115 return false;
116 }
118 size_t size()
119 {
120 if (v)
121 return strlen(v);
122 else
123 return 0;
124 }
126 int find(const char c, int index = 0)
127 {
128 size_t len = size();
129 if (len < 1)
130 return npos;
131 if (index >= (int)len || index < 0)
132 return npos;
133 unsigned int i = 0;
134 for (i=index; i<(int)len; i++)
135 {
136 if (v[i] == c)
137 {
138 return i;
139 }
140 }
142 return npos;
143 }
145 bool is_space(int c)
146 {
147 if (c == '\f' || c == '\n' ||
148 c == '\t' || c == '\r' ||
149 c == '\v' || c == ' ')
150 {
151 return true;
152 }
154 return false;
155 }
157 void trim()
158 {
159 if (!v)
160 return;
162 unsigned int i = 0;
163 unsigned int j = 0;
164 size_t len = strlen(v);
166 if (len == 1)
167 {
168 if (is_space(v[i]))
169 {
170 clear();
171 return;
172 }
173 }
175 unsigned char c0 = v[0];
177 if (is_space(c0))
178 {
179 for (i=0; i<len; i++)
180 {
181 if (!is_space(v[i]) || (is_space(v[i]) && ((unsigned char)i==len-1)))
182 {
183 erase(0, i);
184 break;
185 }
186 }
187 }
189 len = strlen(v);
191 if (len < 1)
192 {
193 return;
194 }
196 if (is_space(v[len-1]))
197 {
198 for (i=len-1; i>=0; i--)
199 {
200 if (!is_space(v[i])
201 || (is_space(v[i]) && i==0))
202 {
203 erase(i+1, j);
204 break;
205 }
206 j++;
207 }
208 }
210 if (len == 1)
211 {
212 if (is_space(v[0]))
213 {
214 clear();
215 return;
216 }
217 }
218 }
220 void erase(unsigned int start, int num = npos)
221 {
222 if (!v)
223 return;
224 unsigned int i = 0;
225 size_t len = size();
226 //check for bounds
227 if (num == npos || start+num > len-num+1)
228 num = len - start;
229 //do the erasing
230 bool copyflag = false;
231 for (i=0; i<len; i++)
232 {
233 if (i>=start && i<start+num)
234 {
235 if (i+num < len)
236 {
237 v[i] = v[i+num];
238 } else {
239 v[i] = 0;
240 }
241 copyflag = true;
242 } else if (copyflag) {
243 if (i+num < len)
244 {
245 v[i] = v[i+num];
246 } else {
247 v[i] = 0;
248 }
249 }
250 }
251 len -= num;
252 v[len] = 0;
253 }
255 String substr(unsigned int index, int num = npos)
256 {
257 if (!v)
258 {
259 String b("");
260 return b;
261 }
263 String ns;
265 size_t len = size();
267 if (index >= len || !v)
268 return ns;
270 if (num == npos)
271 {
272 num = len - index;
273 } else if (index+num >= len) {
274 num = len - index;
275 }
277 unsigned int i = 0, j=0;
278 unsigned int nslen = num + 2;
280 ns.Grow(nslen);
282 for (i=index; i<index+num; i++)
283 ns.append(v[i]);
285 return ns;
286 }
288 void toLower()
289 {
290 if (!v)
291 return;
292 unsigned int i = 0;
293 size_t len = strlen(v);
294 for (i=0; i<len; i++)
295 {
296 if (v[i] >= 65 && v[i] <= 90)
297 v[i] &= ~(1<<5);
298 }
299 }
301 String & operator = (const String &src)
302 {
303 assign(src);
304 return *this;
305 }
307 String & operator = (const char *src)
308 {
309 assign(src);
310 return *this;
312 }
314 char operator [] (unsigned int index)
315 {
316 if (index > size() || !v)
317 {
318 return -1;
319 } else {
320 return v[index];
321 }
322 }
324 int at(int a)
325 {
326 if (a < 0 || a >= (int)size() || !v)
327 return -1;
329 return v[a];
330 }
332 bool at(int at, char c)
333 {
334 if (at < 0 || at >= (int)size() || !v)
335 return false;
337 v[at] = c;
339 return true;
340 }
342 private:
343 void Grow(unsigned int d, bool copy=true)
344 {
345 if (d <= a_size)
346 return;
347 char *n = new char[d + 1];
348 if (copy && v)
349 strcpy(n, v);
350 if (v)
351 delete [] v;
352 else
353 strcpy(n, "");
354 v = n;
355 a_size = d + 1;
356 }
358 char *v;
359 unsigned int a_size;
360 public:
361 static const int npos = -1;
362 };
364 #endif //_INCLUDE_CSTRING_H