流插入,流提取
friend ostream& operator<<(ostream& _cout, const zx::string& s)
{
for (size_t i = 0; i < s._size; i++)
{
_cout << s._str[i];
}
return _cout;
}
friend istream& operator>>(istream& _cin, zx::string& s)
{
s.clear();
char Buff[129];
size_t i = 0;
char ch;
ch = _cin.get();
while (ch != ' ' && ch != '\n')
{
Buff[i++] = ch;
if (i == 128)
{
Buff[i] = '\0';
s += Buff[i];
i = 0;
}
ch = _cin.get();
}
if (i != 0)
{
Buff[i] = '\0';
s += Buff[i];
}
return _cin;
}
构造,拷贝构造,析构
string(const char* str = "")
:_size(strlen(str))
,_capacity(_size)
{
_str = new char[_capacity + 1];
strcpy(_str, str);
}
string(const string& s)
{
_str = new char[_capacity + 1];
strcpy(_str, s._str);
_size = s._size;
_capacity = s._capacity;
}
string& operator=(const string& s)
{
if (*this != s)
{
char* tmp = new char[s._capacity + 1];
strcpy(tmp, s._str);
delete[] _str;
_str = tmp;
_size = s._size;
_capacity = s._capacity;
}
return *this;
}
~string()
{
delete[]_str;
_str = nullptr;
_size = _capacity = 0;
}
迭代器
iterator begin()
{
return _str;
}
iterator end()
{
return _str + _size;
}
增删查改
void push_back(char c)
{
if (_size == _capacity)
reserve(_capacity = 0 ? 4 : 2 * _capacity);
_str[_size++] = c;
_str[_size] = '\0';
}
string& operator+=(char c)
{
push_back(c);
return *this;
}
void append(const char* str)
{
size_t len = strlen(str);
if (_size + len > _capacity)
{
reserve(_size + len);
}
strcpy(_str + _size, _str);
_size += len;
}
string& operator+=(const char* str)
{
append(str);
return *this;
}
void clear()
{
_str[0] = '\0';
_size = 0;
}
void swap(string& s)
{
std::swap(_str, s._str);
std::swap(_size, s._size);
std::swap(_capacity, s._capacity);
}
const char* c_str()const
{
return _str;
}
size_t find(char c, size_t pos = 0) const
{
assert(pos < _size);
for (size_t i = pos; i < _size; i++)
if (_str[i] == c)
return i;
}
size_t find(const char* s, size_t pos = 0) const
{
const char* ans = strstr(_str + _size, s);
if (ans)
{
return ans - _str;
}
else {
return npos;
}
}
string& insert(size_t pos, char c)
{
if (_size == _capacity)
reserve(_capacity == 0 ? 4 : 2 * _capacity);
size_t end = _size + 1;
while (end > pos)
{
_str[end] = _str[end - 1];
--end;
}
_str[pos] = c;
_size++;
}
string& insert(size_t pos, const char* str)
{
assert(pos <= _size);
size_t len = strlen(str);
if (_size == _capacity)
reserve(_size + len);
int end = _size;
while (end >= (int)pos)
{
_str[end + len] = _str[end];
--end;
}
strncpy(_str + pos, str, len);
_size += len;
}
string& erase(size_t pos, size_t len)
{
assert(pos < _size);
if (len == npos || pos + len > _size)
{
_str[pos] = '\0';
_size = pos;
}
else {
size_t begin = pos + len;
while (begin <= _size)
{
_str[begin - len] = _str[begin];
++begin;
}
_size -= len;
}
}
访问
char& operator[](size_t index)
{
assert(index < _size);
return _str[index];
}
const char& operator[](size_t index)const
{
assert(index < _size);
return _str[index];
}
运算符重载
bool operator<(const string& s)
{
return strcmp(_str, s._str) < 0;
}
bool operator<=(const string& s)
{
return _str < s._str || _str == s._str;
}
bool operator>(const string& s)
{
return strcmp(_str, s._str) > 0;
}
bool operator>=(const string& s)
{
return _str > s._str || _str == s._str;
}
bool operator==(const string& s)
{
return _str == s._str;
}
bool operator!=(const string& s)
{
return !(_str == s._str);
}
总体代码
#include <iostream>
#include <cassert>
using namespace std;
namespace zx
{
class string
{
friend ostream& operator<<(ostream& _cout, const zx::string& s)
{
for (size_t i = 0; i < s._size; i++)
{
_cout << s._str[i];
}
return _cout;
}
friend istream& operator>>(istream& _cin, zx::string& s)
{
s.clear();
char Buff[129];
size_t i = 0;
char ch;
ch = _cin.get();
while (ch != ' ' && ch != '\n')
{
Buff[i++] = ch;
if (i == 128)
{
Buff[i] = '\0';
s += Buff[i];
i = 0;
}
ch = _cin.get();
}
if (i != 0)
{
Buff[i] = '\0';
s += Buff[i];
}
return _cin;
}
public:
typedef char* iterator;
public:
string(const char* str = "")
:_size(strlen(str))
,_capacity(_size)
{
_str = new char[_capacity + 1];
strcpy(_str, str);
}
string(const string& s)
{
_str = new char[_capacity + 1];
strcpy(_str, s._str);
_size = s._size;
_capacity = s._capacity;
}
string& operator=(const string& s)
{
if (*this != s)
{
char* tmp = new char[s._capacity + 1];
strcpy(tmp, s._str);
delete[] _str;
_str = tmp;
_size = s._size;
_capacity = s._capacity;
}
return *this;
}
~string()
{
delete[]_str;
_str = nullptr;
_size = _capacity = 0;
}
iterator begin()
{
return _str;
}
iterator end()
{
return _str + _size;
}
void push_back(char c)
{
if (_size == _capacity)
reserve(_capacity = 0 ? 4 : 2 * _capacity);
_str[_size++] = c;
_str[_size] = '\0';
}
string& operator+=(char c)
{
push_back(c);
return *this;
}
void append(const char* str)
{
size_t len = strlen(str);
if (_size + len > _capacity)
{
reserve(_size + len);
}
strcpy(_str + _size, _str);
_size += len;
}
string& operator+=(const char* str)
{
append(str);
return *this;
}
void clear()
{
_str[0] = '\0';
_size = 0;
}
void swap(string& s)
{
std::swap(_str, s._str);
std::swap(_size, s._size);
std::swap(_capacity, s._capacity);
}
const char* c_str()const
{
return _str;
}
size_t size()const
{
return _size;
}
size_t capacity()const
{
return _capacity;
}
bool empty()const
{
return _size == 0;
}
void resize(size_t n, char c = '\0')
{
if (n < _size)
{
_str[n] = '\0';
_size = n;
}
else {
reserve(n);
while (_size < n)
{
_str[_size] = n;
_size++;
}
_str[_size] = '\0';
}
}
void reserve(size_t n)
{
if (n > _capacity)
{
char* tmp = new char[n+1];
strcpy(tmp, _str);
delete[]_str;
_str = tmp;
_capacity = n;
}
}
char& operator[](size_t index)
{
assert(index < _size);
return _str[index];
}
const char& operator[](size_t index)const
{
assert(index < _size);
return _str[index];
}
bool operator<(const string& s)
{
return strcmp(_str, s._str) < 0;
}
bool operator<=(const string& s)
{
return _str < s._str || _str == s._str;
}
bool operator>(const string& s)
{
return strcmp(_str, s._str) > 0;
}
bool operator>=(const string& s)
{
return _str > s._str || _str == s._str;
}
bool operator==(const string& s)
{
return _str == s._str;
}
bool operator!=(const string& s)
{
return !(_str == s._str);
}
size_t find(char c, size_t pos = 0) const
{
assert(pos < _size);
for (size_t i = pos; i < _size; i++)
if (_str[i] == c)
return i;
}
size_t find(const char* s, size_t pos = 0) const
{
const char* ans = strstr(_str + _size, s);
if (ans)
{
return ans - _str;
}
else {
return npos;
}
}
string& insert(size_t pos, char c)
{
if (_size == _capacity)
reserve(_capacity == 0 ? 4 : 2 * _capacity);
size_t end = _size + 1;
while (end > pos)
{
_str[end] = _str[end - 1];
--end;
}
_str[pos] = c;
_size++;
}
string& insert(size_t pos, const char* str)
{
assert(pos <= _size);
size_t len = strlen(str);
if (_size == _capacity)
reserve(_size + len);
int end = _size;
while (end >= (int)pos)
{
_str[end + len] = _str[end];
--end;
}
strncpy(_str + pos, str, len);
_size += len;
}
string& erase(size_t pos, size_t len)
{
assert(pos < _size);
if (len == npos || pos + len > _size)
{
_str[pos] = '\0';
_size = pos;
}
else {
size_t begin = pos + len;
while (begin <= _size)
{
_str[begin - len] = _str[begin];
++begin;
}
_size -= len;
}
}
private:
char* _str;
size_t _size;
size_t _capacity;
const static size_t npos = -1;
};
}