string的增删查改模拟（c++）

通过模拟实现string，让我对与string的使用熟练度以及string的内部成员函数更加的熟悉，使用起来也更加得心应手。

#pragma once
#include<iostream>
#include<utility>
#include<string>
#include<assert.h>
using namespace std;

namespace bit
{
	class string
	{
	public:
		typedef char* iterator;
		string(const char* str = "")
		{
			_size = strlen(str);
			_capacity = strlen(str);
			_str = new char[_capacity + 1];
			memcpy(_str, str, _size+1);
		}
		string(const bit::string & s)
		{
			_capacity = s._capacity;
			_size = s.size();
			_str = new char[_capacity + 1];
			memcpy(_str, s._str, s._size);
		}
		~string()
		{
			delete[]_str;
			_str = nullptr;
			_size = 0;
			_capacity = 0;
		}
		size_t size()const
		{
			return _size;
		}
		const char* c_str()const
		{
			return _str;
		}
		iterator begin()
		{
			return _str;
		}
		iterator end()
		{
			return _str + _size;
		}
		void reverse(size_t i)
		{
			if (i < _capacity)
				return;
			_capacity = i;
			char* tmp = new char[_capacity + 1];
			memcpy(tmp, _str, _size + 1);
			swap(tmp, _str);
			delete[] tmp;
		}
		string& operator=(const bit::string& s)
		{
			_size = s.size();
			_capacity = s._capacity;
			_str = new char[_capacity + 1];
			memcpy(_str, s._str, _size + 1);
			return *this;
		}
		string& push_back(char ch)
		{
			if (_size == _capacity)
			{
				reverse(_capacity * 2);
				_capacity *= 2;
			}
			_str[_size] = ch;
			_size += 1;
			_str[_size] = '\0';
			return *this;
		}
		string& push_back(size_t n, char ch)
		{
			if (_size + n >= _capacity)
			{
				reverse(_size + n + 1);
				_capacity = _size + n;
			}
			for (size_t i = 0; i < n; i++)
			{
				_str[_size + i] = ch;
			}
			_size += n;
			_str[_size] = '\0';
			return *this;
		}
		string& operator+=(char c)
		{
			if (_size == _capacity)
			{
				reverse(_capacity * 2);
			}
			return (*this).push_back(c);
		}
		void append(const char* str)
		{
			size_t len = strlen(str);
			if (_size + len >= _capacity)
			{
				reverse(_size + len + 1);
				_capacity = _size + len;
			}
			memcpy(_str + _size, str, len+1);
			_size += len;
		}
		string& operator+=(const char* str)
		{
			append(str);
			return *this;
		}
		void clear()
		{
			_str[0] = '\0';
			_size = 0;
		}
		size_t capacity()const
		{
			return _capacity;
		}
		bool empty()const
		{
			if (_size == 0)
			{
				return true;
			}
			else
			{
				return false;
			}
		}
		void resize(size_t n, char c = '\0')
		{
			if (n < _size)
			{
				_str[n] = '\0';
				_size = n;
			}
			else
			{
				if (n > _capacity)
				{
					reverse(n);
				}
				push_back(n-_size, c);
				_size = n;
			}
		}
		char& operator[](size_t index)
		{
			assert(index <= _size && index != npos);
			return _str[index];
		}
		const char& operator[](size_t index)const
		{
			assert(index <= _size && index != npos);
			return _str[index];
		}
		bool operator<(const string& s)
		{
			int ret = memcmp(_str, s._str, _size < s._size ? _size : s._size);
			return ret == 0 ? _size < s._size : ret < 0;
		}
		bool operator<=(const string& s)
		{
			return *this < s || (memcmp(_str, s._str, _size)) == 0;
		}
		bool operator==(const string& s)
		{
			return _size == s._size && (memcmp(_str, s._str, _size) == 0);
		}
		bool operator>(const string& s)
		{
			return !(*this <= s);
		}
		bool operator>=(const string& s)
		{
			return *this > s || *this == s;
		}
		bool operator!=(const string& s)
		{
			return !(*this == s);
		}
		// 返回c在string中第一次出现的位置
		size_t find(char c, size_t pos = 0) const
		{
			for (size_t i = 0; i < _size; i++)
			{
				if (_str[i] == c)
				{
					return i;
				}
			}
			return npos;
		}
		// 返回子串s在string中第一次出现的位置

		size_t find(const char* s, size_t pos = 0) const
		{
			assert(pos < _size);
			size_t len = strlen(s);
			for (size_t i = pos; i < _size; i++)
			{
				if(memcmp(_str+i,s, len) == 0)
				{
					return i;
				}
			}
			return npos;
		}
		// 在pos位置上插入字符c/字符串str，并返回该字符的位置

		string& insert(size_t pos, char c)
		{
			assert(pos <= _size);
			if (_size == _capacity)
			{
				reverse(_capacity * 2);
			}
			for (size_t i = _size; i > pos; i--)
			{
				_str[i + 1] = _str[i];
			}
			_str[pos] = c;
			return *this;
			_size++;

		}

	/*	string& insert(size_t pos, const char* str)
		{
			assert(pos <= _size);
			size_t len = strlen(str);
			if (_size + len >= _capacity)
			{
				reverse(_size + len);
			}
			for (size_t i = _size; i > pos; i--)
			{
				_str[i + len] = _str[i];
			}
			for (size_t i = 0; i < len; i++)
			{
				_str[pos + i] = str[i];
			}
			_size += len;
			return *this;
		}*/
		void insert(size_t pos, const char* str)
		{
			assert(pos <= _size);

			size_t len = strlen(str);
			if (_size + len > _capacity)
			{
				// 至少扩容到_size + len
				reverse(._size + len);
			}

			// 添加注释最好
			size_t end = _size;
			while (end >= pos && end != npos)
			{
				_str[end + len] = _str[end];
				--end;
			}

			for (size_t i = 0; i < len; i++)
			{
				_str[pos + i] = str[i];
			}

			_size += len;
		}

		// 删除pos位置上的元素，并返回该元素的下一个位置

		string& erase(size_t pos, size_t len)
		{
			assert(pos <= _size);

			if (len == npos || pos + len >= _size)
			{
				//_str[pos] = '\0';
				_size = pos;

				_str[_size] = '\0';
			}
			else
			{
				size_t end = pos + len;
				while (end <= _size)
				{
					_str[pos++] = _str[end++];
				}
				_size -= len;
			}
			return *this;
		}
	private:
		char* _str;
		size_t _size;
		size_t _capacity;
	public:
		const static size_t npos;
	};
	const size_t string::npos = -1;
	
}