STL的string模拟实现

#pragma once
#include<string.h>
#include<assert.h>
namespace lhw
{
	class string
	{
		typedef char* iterator;
		typedef const char* const_iterator;
	public:
		string(const char* str = " ")
		{
			_size = strlen(str);
			_capacity = _size;
			_str = new char[_capacity + 1];
			my_strcpy(_str, str);
		}

		//传统写法
		string(const string& s)
			:_str(new char[s._capacity + 1])
			, _size(s._size)
			, _capacity(s._capacity)
		{
			my_strcpy(_str, s._str);
		}

		//现代写法
		/*string(const string& s)
			:_str(new char[s._capacity + 1])
			, _size(s._size)
			, _capacity(s._capacity)
		{
			string tmp(s._str);
			swap(tmp);
		}*/

		string& operator=(const string& s)
		{
			if (this != &s)
			{
				delete[] _str;
				_str = new char[s._capacity + 1];
				my_strcpy(_str, s._str);
				_size = s._size;
				_capacity = s._capacity;
			}
			return *this;

		}

		//现代写法
		/*string& operator=(const string& s)
		{
			if (this != &s)
			{
				string tmp(s);
				swap(tmp);
			}
			return *this;
		}*/

		~string()
		{
			delete[] _str;
			_str = nullptr;
			_size = _capacity = 0;
		}

		iterator begin()
		{
			return _str;
		}

		const_iterator begin()const 
		{
			return _str;
		}

		iterator end()
		{
			return _str + _size;
		}

		const_iterator end()const
		{
			return _str + _size;
		}

		void swap(string& s)
		{
			::swap(_str, s._str);
			::swap(_size, s._size);
			::swap(_capacity, s._capacity);
		}

		char* my_strcpy(char* dest, const char* src)
		{
			assert(dest);
			assert(src);
			char* cur = dest;
			while (*src)
			{
				*cur++ = *src++;
			}
			*cur = '\0';
			return dest;
		}

		size_t size()const
		{
			return _size;
		}

		size_t capacity()const
		{
			return _capacity;
		}

		void reserve(size_t n)
		{
			if (n > _capacity)
			{
				char* tmp = new char[n + 1];
				strncpy(tmp, _str, _size + 1);
				delete[] _str;
				_str = tmp;
				_capacity = n;
			}
		}

		void resize(size_t n, char ch = '\0')
		{
			if (n <= size())
			{
				_size = n;
				_str[n] = '\0';
			}
			else
			{
				if (n > capacity())
				{
					reserve(n);
				}
				for (size_t i = _size; i < n; i++)
				{
					_str[i] = ch;
				}
				_size = n;
				_str[_size] = '\0';
			}
		}

		void push_back(char ch)
		{
			if (_size == _capacity)
			{
				reserve(_size == 0 ? 4 : 2 * _capacity);
			}
			_str[_size] = ch;
			_str[_size + 1] = '\0';
			_size++;
		}

		void append(const char* str)
		{
			size_t len = _size + strlen(str);
			if (len > _capacity)
			{
				reserve(len);
			}
			my_strcpy(_str + _size, str);
			_size = len;
		}

		void insert(size_t pos, char ch)
		{
			assert(pos <= _size);
			if (_size == _capacity)
			{
				reserve(_capacity == 0 ? 4 : 2 * _capacity);
			}
			char* end = _str + _size;
			while (end >= _str + pos)
			{
				*(end + 1) = *end;
				end--;
			}
			_str[pos] = ch;
			_size++;
		}

		string& insert(size_t pos, char* str)
		{
			assert(pos <= _size);
			size_t len = strlen(str);
			if (len + _size > _capacity)
			{
				reserve(len+_size);
			}
			char* end = _str + _size;
			while (end >= _str + pos)
			{
				*(end + len) = *end;
				end--;
			}
			strncpy(_str + pos, str, len);
			_size += len;
			return *this;
		}

		string& erase(size_t pos, size_t len = npos)
		{
			assert(pos <= _size);
			size_t n = _size - pos;
			if (len >= n)
			{
				_size = pos;
				_str[_size] = '\0';
			}
			else
			{
				strcpy(_str + pos, _str + len + pos);
				_size -= len;
			}
			return *this;
		}

		//正向查找第一个匹配的字符
		size_t find(char ch, size_t pos = 0)
		{
			assert(pos < _size);                       //检测下标的合法性
			for (size_t i = pos; i < _size; i++)       //从pos位置开始向后寻找目标字符
			{
				if (_str[i] == ch)
				{
					return i;                         //找到目标字符，返回其下标
				}
			}
			return npos;                              //没有找到目标字符，返回npos 
		}

		//正向查找第一个匹配的字符串
		size_t find(const char* str, size_t pos = 0)
		{
			assert(pos < _size);                           //检测下标的合法性
			const char* ret = strstr(_str + pos, str);     //调用strstr进行查找
			if (ret)                                       //ret不为空指针，说明找到了
			{
				return ret - _str;                         //返回字符串第一个字符的下标
			}
			else                                           //没有找到
			{
				return npos;                               //返回npos
			}
		}


		//反向查找第一个匹配的字符
		size_t rfind(char ch, size_t pos = npos)
		{
			string tmp(*this);                      //拷贝构造对象tmp
			reverse(tmp.begin(), tmp.end());        //调用reverse逆置对象tmp的C字符串
			if (pos >= _size)                       //所给pos大于字符串有效长度
			{
				pos = _size - 1;                    //重新设置pos为字符串最后一个字符的下标
			}
			pos = _size - 1 - pos;                  //将pos改为镜像对称后的位置
			size_t ret = tmp.find(ch, pos);         //复用find函数
			if (ret != npos)
				return _size - 1 - ret;             //找到了，返回ret镜像对称后的位置
			else
				return npos;                        //没找到，返回npos
		}

		//读取一行含有空格的字符串
		istream& getline(istream& in, string& s)
		{
			s.clear();                              //清空字符串
			char ch = in.get();                     //读取一个字符
			while (ch != '\n')                      //当读取到的字符不是'\n'的时候继续读取
			{
				s += ch;                            //将读取到的字符尾插到字符串后面
				ch = in.get();                      //继续读取字符
			}
			return in;
		}


		char& operator[](size_t i)
		{
			return _str[i];
		}

		const char& operator[](size_t i)const
		{
			return _str[i];
		}

		void clear()
		{
			_size = 0;
			_str[_size] = '\0';
		}

		bool empty()
		{
			return _size == _capacity;
		}

		string& operator+=(char ch)
		{
			push_back(ch);
			return *this;
		}

		const char* c_str()const
		{
			return _str;
		}


	private:
		char* _str;
		size_t _size;
		size_t _capacity;
		static const size_t npos;
	};
	const size_t string::npos = -1;

	ostream& operator<<(ostream& cout, const string& s)
	{
		for (auto& e : s)
		{
			cout << e;
		}
		return cout;
	}

	istream& operator>>(istream cin, string& s)
	{
		s.clear();                         //清空字符串
		char ch = cin.get();               //读取一个字符
		while (ch != ' ' && ch != '\n')    //当读取到的字符不是空格或'\n'的时候继续读取
		{
			s += ch;                       //将读取到的字符尾插到字符串后面
			ch = cin.get();                //继续读取字符
		}
		return cin;                        //支持连续输入
		
	}
}