模拟String类所需的成员变量
class string
{
public:
string(char* str="")
:_size(strlen(str))
,_capacity(_size+1)
{
_str=new char[_capacity+1];
strcpy(_str,str);
}
~string()
{
delete[] _str;
_str=nullptr;
_size=_capacity=0;
}
string(const string& s)
:_str(nullptr)
,_size(0)
,_capacity(0)
{
string tmp(s._str);
swap(tmp);
}
void swap(string& s)
{
std::swap(_str, s._str);
std::swap(_size, s._size);
std::swap(_capacity, s._capacity);
}
string& operator=(const string tmp)
{
swap(tmp);
return *this;
}
private:
char* _str;
size_t _capacity;
size_t _size;
};
string类的迭代器
class string
{
public:
typedef char* iterator;
typedef const char* const_iterator;
iterator begin()
{
return _str;
}
iterator end()
{
return _str+size();
}
const_iterator begin() const
{
return _str;
}
const_iterator end() const
{
return _str+size();
}
private:
char* _str;
size_t _size;
size_t _capacity;
};
void test()
{
s("halo shijie");
string::iterator it=s.begin();
while(it!=s.begin())
{
cout<<*it<<" ";
}
for(auto e:s)
{
cout<<e<<" ";
}
}
string类的运算符重载
class string
{
public:
char& operator[](size_t pos)
{
assert(pos<size());
return *(_str+pos);
}
bool operator<(const string& s)
{
return strcmp(_str, s._str) < 0;
}
bool operator<=(const string& s)
{
return (*this < s && *this == s);
}
bool operator>(const string& s)
{
return !(*this <= s);
}
bool operator>=(const string& s)
{
return !(*this < s);
}
bool operator==(const string& s)
{
return strcmp(_str, s._str) == 0;
}
bool operator!=(const string& s) {
return !(*this == s);
}
const char& operator[](size_t pos)
{
assert(pos<size());
return *(_str+pos);
}
private:
char* _str;
size_t _size;
size_t _capacity;
}
string类的一些成员方法和接口
class string
{
public:
size_t size()
{
return _size;
}
size_t capacity()
{
return _capacity();
}
const char* c_str() const
{
return _str;
}
void reserve(size_t n)
{
if(n>_capacity)
{
char *tmp=new char[n];
strcpy(tmp,_str);
delete[] _str;
_str=tmp;
_capacity=n;
}
}
void resize(size_t n,char ch='\0')
{
if(n<size())
{
_str[n]='\0';
_size=n;
}
else
{
reserve(n);
while(_size<n)
{
_str[_size]=ch;
_size++;
}
_str[_size]='\0';
}
}
size_t find(char ch,size_t pos=0)
{
assert(pos<size());
while(pos<size())
{
if(ch==_str[pos])
{
return pos;
}
pos++;
}
return npos;
}
size_t find(char* str,size_t pos=0)
{
assert(pos<size());
const char* p=strstr(_str+pos,str);
if(p)
{
return p-_str;
}
else
{
return npos;
}
}
string substr(size_t pos,size_t len=npos)
{
string s;
if(len==npos || pos+len>=_size)
{
for(size_t i=pos;i<_size;i++)
{
s+=_str[i];
}
}
else
{
int i=pos;
while(i<pos+len)
{
s+=_str[i++];
}
return s;
}
}
void push_back(char ch)
{
if (_size == _capacity)
{
reserve(_capacity == 0 ? 4 : _capacity * 2);
}
_str[_size] = ch;
++_size;
_str[_size] = '\0';
}
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+=(char ch)
{
push_back(ch);
return *this;
}
string& operator+=(const char* str)
{
append(str);
return *this;
}
void insert(size_t pos, char ch)
{
assert(pos <= _size);
if (_size == _capacity)
{
reserve(_capacity == 0 ? 4 : _capacity * 2);
}
size_t end = _size + 1;
while (end > pos)
{
_str[end] = _str[end - 1];
--end;
}
_str[pos] = ch;
_size++;
}
string& insert(size_t pos, const char* str)
{
assert(pos < _size);
size_t len = strlen(str);
if (_size +len > _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;
};