# define _CRT_SECURE_NO_WARNINGS 1
# include<string.h>
using namespace std;
# include <iostream>
#include<algorithm>
# include < utility >
# include<string>
# include<assert.h>
namespace bit
{
class string
{
public:
typedef char* iterator;// 用iterator替换char*
string(const char* str = "")//初始化函数
{
_size = strlen(str);
_capacity = _size;
_str = new char (_capacity+1);
strcpy(_str, str);
}
string(const string& s): _str(nullptr), _size(0), _capacity(0)
{
string tmp(s._str);
this->swap(tmp);
}
string& operator=(const string& s)
{
if (this != &s)
{
string temp(s);
this->swap(temp);
}
return *this;
}
~string()
{
if (_str)
{
delete[] _str;
_str = nullptr;
}
}
iterator begin()//char*begin(),相当于有个this
{
return _str;
}
iterator end()
{
return _str + _size;
}
void push_back(char c)
{
if (_size == _capacity)
{
reserve(_capacity * 2);
}
_str[_size++] = c;
_str[_size] = '\0';
}
string& operator+=(char c)
{
push_back(c);
return *this;
}
void append(const char* str);
string& operator+=(const char* str);
void clear()
{
_size = 0;//大小置为0
_str[_size] = '\0';//最后一位置为\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 newSize, char c = '\0')
{
if (newSize > _size) // 如果newSize大于底层空间大小,则需要重新开辟空间
{
if (newSize > _capacity)
{
reserve(newSize);
}
memset(_str + _size, c, newSize - _size);
}
_size = newSize;
_str[newSize] = '\0';
}
void reserve(size_t newCapacity)// 如果新容量大于旧容量,则开辟空间
{
if (newCapacity > _capacity)
{
char* str = new char[newCapacity + 1];//多一个放“\0”
strcpy(str, _str);// 释放原来旧空间,然后使用新空间
delete[] _str;
_str = str;
_capacity = newCapacity;
}
}
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)const
{
int res = strcmp(_str, s._str);
if (res < 0)
return true;
return false;
}
bool operator<=(const string& s)const
{
return !(*this > s);
}
bool operator>(const string& s)const
{
int res = strcmp(_str, s._str);
if (res > 0)
return true;
return false;
}
bool operator>=(const string& s)const
{
return !(*this < s);
}
bool operator==(const string& s)const
{
int res = strcmp(_str, s._str);
if (res == 0)
return true;
return false;
}
bool operator!=(const string& s)const
{
return !(*this == s);
}
size_t find(char c, size_t pos = 0) const
{
for (size_t i = pos; i < _size; ++i)
{
if (_str[i] == c)
return i;//找到,返回下标
}
return -1;//未找到
}
size_t find(const char* s, size_t pos = 0) const
{
assert(s);
assert(pos < _size);
const char* src = _str + pos;
while (*src)
{
const char* match = s;//如果不匹配,返回子串起始处重新查找
const char* cur = src;
while (*match && *match == *cur)//结束条件
{
++match;
++cur;
}
if (*match == '\0')//找到子串
{
return src - _str;//返回下标
}
else
{
++src;
}
}
return -1;//未找到
}
string& insert(size_t pos, char c)
{
assert(pos <= _size);
if (_size > _capacity) //扩容
{
char* newstr = new char[_capacity * 2 + 1];//开空间
strcpy(newstr, _str);
delete[] _str;
_str = newstr;
_capacity *= 2; //Expand(_capacity * 2);
}
for (int i = _size; i >= (int)pos; --i) //移数据
{
_str[i + 1] = _str[i];
}
_str[pos] = c;
_size++;
return *this;
}
string& insert(size_t pos, const char* str)
{
size_t len = strlen(str);
if (_size + len > _capacity)//扩容
{
char* newstr = new char[_capacity * 2 + 1];//开空间
strcpy(newstr, _str);
delete[] _str;
_str = newstr;
_capacity *= 2; //Expand(_size + len);
}
for (int i = _size; i >= (int)pos; --i) //后移数据
{
_str[len + i] = _str[i];
}
while (*str != '\0')//拷贝字符串
{
_str[pos++] = *str++;
}
_size += len;
return *this;
}
string& erase(size_t pos, size_t len)
{
assert(pos < _size);
if (pos + len >= _size)//pos位置之后全为0
{
_str[pos] = '\0';
_size = pos;
}
else
{
strcpy(_str + pos, _str + pos + len);
_size -= len;
}
return *this;
}
istream& bit::operator>>(istream& _cin, bit::string& s)
{
//预分配100个空间
char* str = (char*)malloc(sizeof(char) * 100);
char* buf = str;
int i = 1;
//预处理:跳过流里面的所有空格和回车
while ((*buf = getchar()) == ' ' || (*buf == '\n'));
for (; ; ++i)
{
if (*buf == '\n') //回车跳出
{
*buf = '\0';
break;
}
else if (*buf == ' ') //空格跳出
{
*buf = '\0';
break;
}
else if (i % 100 == 0) //空间不足
{
i += 100; //追加100个空间
str = (char*)realloc(str, i);
}
else //每次getchar()一个值
{
buf = (str + i);//为了避免realloc返回首地址改变,不使用++buf,而是用str加上偏移.
//每次读取一个字符
*buf = getchar();
}
}
//输入完成,更新s
s._str = str;
s._capacity = s._size = i;
return _cin;
}
ostream& bit::operator<<(ostream& _cout, const bit::string& s)
{
for (size_t i = 0; i < s.size(); ++i)
{
_cout << s[i];
}
return _cout;
}
private:
char* _str;
size_t _capacity;
size_t _size;
};
}
int main()
{
string b[2];
return 0;
}
c++string实现
最新推荐文章于 2024-01-25 16:19:22 发布