amxmodx/dlls/nvault/sdk/CString.h

368 lines
4.9 KiB
C
Raw Normal View History

// vim: set ts=4 sw=4 tw=99 noet:
//
// AMX Mod X, based on AMX Mod by Aleksander Naszko ("OLO").
// Copyright (C) The AMX Mod X Development Team.
//
// This software is licensed under the GNU General Public License, version 3 or higher.
// Additional exceptions apply. For full license details, see LICENSE.txt or visit:
// https://alliedmods.net/amxmodx-license
2004-08-13 10:41:39 +00:00
2004-06-29 08:14:44 +00:00
#ifndef _INCLUDE_CSTRING_H
#define _INCLUDE_CSTRING_H
2005-07-31 06:04:42 +00:00
#include <string.h>
2005-08-02 07:46:41 +00:00
#include <stdio.h>
2005-07-31 06:04:42 +00:00
2004-06-29 08:14:44 +00:00
//by David "BAILOPAN" Anderson
2004-09-08 21:13:04 +00:00
class String
2004-06-29 08:14:44 +00:00
{
public:
2004-09-08 21:13:04 +00:00
String()
{
v = NULL;
2005-07-22 09:26:37 +00:00
a_size = 0;
//assign("");
2004-09-08 21:13:04 +00:00
}
~String()
{
if (v)
delete [] v;
}
String(const char *src)
{
v = NULL;
2005-07-22 09:26:37 +00:00
a_size = 0;
assign(src);
2004-09-08 21:13:04 +00:00
}
2004-06-29 08:14:44 +00:00
2005-08-02 07:46:41 +00:00
const char * _fread(FILE *fp)
{
Grow(512, false);
char *ret = fgets(v, 511, fp);
return ret;
}
2005-11-15 20:48:11 +00:00
String(const String &src)
2004-09-08 21:13:04 +00:00
{
v = NULL;
2005-07-22 09:26:37 +00:00
a_size = 0;
2004-09-08 21:13:04 +00:00
assign(src.c_str());
}
2004-08-13 10:41:39 +00:00
2005-07-31 06:04:42 +00:00
const char *c_str() { return v?v:""; }
2005-07-22 09:26:37 +00:00
2005-07-31 06:04:42 +00:00
const char *c_str() const { return v?v:""; }
2004-06-29 08:14:44 +00:00
void append(const char *t)
{
Grow(size() + strlen(t) + 1);
2004-06-29 08:14:44 +00:00
strcat(v, t);
2004-09-08 21:13:04 +00:00
}
void append(const char c)
{
size_t len = size();
2005-07-22 09:26:37 +00:00
Grow(len + 2);
v[len] = c;
v[len + 1] = '\0';
2004-06-29 08:14:44 +00:00
}
2004-09-08 21:13:04 +00:00
void append(String &d)
2004-06-29 08:14:44 +00:00
{
2005-07-22 09:26:37 +00:00
append(d.c_str());
2004-09-08 21:13:04 +00:00
}
void assign(const String &src)
{
assign(src.c_str());
2004-06-29 08:14:44 +00:00
}
void assign(const char *d)
{
if (!d)
{
2005-07-22 09:26:37 +00:00
clear();
2004-09-08 21:13:04 +00:00
} else {
2006-02-05 19:16:16 +00:00
size_t len = strlen(d);
Grow(len + 1, false);
memcpy(v, d, len);
v[len] = '\0';
2004-09-08 21:13:04 +00:00
}
2004-06-29 08:14:44 +00:00
}
void clear()
{
if (v)
v[0] = '\0';
2004-06-29 08:14:44 +00:00
}
2006-02-05 19:16:16 +00:00
int compare (const char *d) const
2004-06-29 08:14:44 +00:00
{
if (!v)
return strcmp("", d);
else
return strcmp(v, d);
2004-06-29 08:14:44 +00:00
}
2004-08-13 10:41:39 +00:00
//Added this for amxx inclusion
bool empty()
{
if (!v)
2005-08-02 07:46:41 +00:00
return true;
2005-07-22 09:26:37 +00:00
if (v[0] == '\0')
2004-08-13 10:41:39 +00:00
return true;
return false;
}
2005-07-22 09:26:37 +00:00
size_t size()
2004-06-29 08:14:44 +00:00
{
if (v)
return strlen(v);
else
return 0;
2004-09-08 21:13:04 +00:00
}
int find(const char c, int index = 0)
{
2005-11-15 20:48:11 +00:00
int len = static_cast<int>(size());
if (len < 1)
return npos;
2005-11-15 20:48:11 +00:00
if (index >= len || index < 0)
2004-09-08 21:13:04 +00:00
return npos;
2005-11-15 20:48:11 +00:00
int i = 0;
for (i=index; i<len; i++)
2004-09-08 21:13:04 +00:00
{
if (v[i] == c)
{
return i;
}
}
return npos;
}
bool is_space(int c)
{
if (c == '\f' || c == '\n' ||
c == '\t' || c == '\r' ||
2004-09-17 19:04:44 +00:00
c == '\v' || c == ' ')
2004-09-08 21:13:04 +00:00
{
return true;
}
return false;
}
void trim()
{
if (!v)
return;
2004-09-08 21:13:04 +00:00
unsigned int i = 0;
unsigned int j = 0;
2005-07-22 09:26:37 +00:00
size_t len = strlen(v);
2004-09-08 21:13:04 +00:00
2005-07-22 09:26:37 +00:00
if (len == 1)
2004-09-08 21:13:04 +00:00
{
if (is_space(v[i]))
{
clear();
return;
}
}
unsigned char c0 = v[0];
if (is_space(c0))
{
2005-07-22 09:26:37 +00:00
for (i=0; i<len; i++)
2004-09-08 21:13:04 +00:00
{
2005-07-22 09:26:37 +00:00
if (!is_space(v[i]) || (is_space(v[i]) && ((unsigned char)i==len-1)))
2004-09-08 21:13:04 +00:00
{
erase(0, i);
break;
}
}
}
2005-07-22 09:26:37 +00:00
len = strlen(v);
2004-09-08 21:13:04 +00:00
2005-07-22 09:26:37 +00:00
if (len < 1)
2004-09-08 21:13:04 +00:00
{
return;
}
2005-07-22 09:26:37 +00:00
if (is_space(v[len-1]))
2004-09-08 21:13:04 +00:00
{
for (i=len-1; i<len; i--)
2004-09-08 21:13:04 +00:00
{
if (!is_space(v[i])
|| (is_space(v[i]) && i==0))
{
erase(i+1, j);
break;
}
j++;
}
}
2005-07-22 09:26:37 +00:00
if (len == 1)
2004-09-08 21:13:04 +00:00
{
if (is_space(v[0]))
{
clear();
return;
}
}
}
2005-07-22 09:26:37 +00:00
void erase(unsigned int start, int num = npos)
2004-09-08 21:13:04 +00:00
{
if (!v)
return;
2004-09-08 21:13:04 +00:00
unsigned int i = 0;
2005-07-22 09:26:37 +00:00
size_t len = size();
2004-09-08 21:13:04 +00:00
//check for bounds
2005-11-15 20:48:11 +00:00
if (num == npos || start+num > len-start)
2005-07-22 09:26:37 +00:00
num = len - start;
2004-09-08 21:13:04 +00:00
//do the erasing
bool copyflag = false;
2005-07-22 09:26:37 +00:00
for (i=0; i<len; i++)
2004-09-08 21:13:04 +00:00
{
if (i>=start && i<start+num)
{
2005-07-22 09:26:37 +00:00
if (i+num < len)
2004-09-08 21:13:04 +00:00
{
v[i] = v[i+num];
} else {
v[i] = 0;
}
copyflag = true;
} else if (copyflag) {
2005-07-22 09:26:37 +00:00
if (i+num < len)
2004-09-08 21:13:04 +00:00
{
v[i] = v[i+num];
} else {
v[i] = 0;
}
}
}
2005-07-22 09:26:37 +00:00
len -= num;
v[len] = 0;
2004-09-08 21:13:04 +00:00
}
String substr(unsigned int index, int num = npos)
{
if (!v)
2005-08-02 08:12:47 +00:00
{
String b("");
return b;
}
2004-09-08 21:13:04 +00:00
String ns;
2005-07-22 09:26:37 +00:00
size_t len = size();
if (index >= len || !v)
2004-09-08 21:13:04 +00:00
return ns;
if (num == npos)
{
2005-07-22 09:26:37 +00:00
num = len - index;
} else if (index+num >= len) {
num = len - index;
2004-09-08 21:13:04 +00:00
}
2005-11-15 20:48:11 +00:00
unsigned int i = 0;
2005-07-22 09:26:37 +00:00
unsigned int nslen = num + 2;
2004-09-08 21:13:04 +00:00
2005-07-22 09:26:37 +00:00
ns.Grow(nslen);
2004-09-08 21:13:04 +00:00
2005-07-22 09:26:37 +00:00
for (i=index; i<index+num; i++)
ns.append(v[i]);
2004-09-08 21:13:04 +00:00
return ns;
}
void toLower()
{
if (!v)
return;
2004-09-08 21:13:04 +00:00
unsigned int i = 0;
2005-07-22 09:26:37 +00:00
size_t len = strlen(v);
for (i=0; i<len; i++)
2004-09-08 21:13:04 +00:00
{
if (v[i] >= 65 && v[i] <= 90)
2005-07-22 09:26:37 +00:00
v[i] &= ~(1<<5);
2004-09-08 21:13:04 +00:00
}
}
String & operator = (const String &src)
{
assign(src);
return *this;
}
String & operator = (const char *src)
{
assign(src);
return *this;
}
char operator [] (unsigned int index)
{
if (index > size() || !v)
2004-09-08 21:13:04 +00:00
{
return -1;
} else {
return v[index];
}
}
int at(int a)
{
if (a < 0 || a >= (int)size() || !v)
2004-09-08 21:13:04 +00:00
return -1;
return v[a];
}
bool at(int at, char c)
{
if (at < 0 || at >= (int)size() || !v)
2004-09-08 21:13:04 +00:00
return false;
v[at] = c;
return true;
2004-06-29 08:14:44 +00:00
}
private:
2005-07-22 09:26:37 +00:00
void Grow(unsigned int d, bool copy=true)
2004-06-29 08:14:44 +00:00
{
2005-07-22 09:26:37 +00:00
if (d <= a_size)
2004-06-30 03:21:14 +00:00
return;
2005-07-22 09:26:37 +00:00
char *n = new char[d + 1];
if (copy && v)
2005-07-22 09:26:37 +00:00
strcpy(n, v);
if (v)
delete [] v;
2005-08-02 07:46:41 +00:00
else
strcpy(n, "");
2005-07-22 09:26:37 +00:00
v = n;
a_size = d + 1;
2004-06-29 08:14:44 +00:00
}
char *v;
2005-07-22 09:26:37 +00:00
unsigned int a_size;
2004-09-08 21:13:04 +00:00
public:
static const int npos = -1;
2004-06-29 08:14:44 +00:00
};
#endif //_INCLUDE_CSTRING_H