string的简单模拟实现

#pragma once
#include<iostream>
#include<string.h>
#include<assert.h>
using namespace std;
namespace QR
{
	class string
	{
	public:
		//迭代器
		//string的迭代器就是一个原生指针
		typedef char* iterator;
		//const迭代器
		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;
		}
		void swap(string& s)
		{
			std::swap(_str, s._str);
			std::swap(_size, s._size);
			std::swap(_capacity, s._capacity);
		}
		/*string()
		:_str(new char[1])
		,_size(0)
		,_capacity(0)
		{
			_str[0] = '\0';
		}*/
		string(const char* str = "")
			:_size(strlen(str))
			,_capacity(_size)
		{
			_str = new char[_capacity + 1];
			strcpy(_str, str);
		}
		//进行深拷贝s2(s1);
		//传统写法
		/*string(const string& s)
			:_size(s._size)
			,_capacity(s._capacity)
		{
			_str = new char[_capacity + 1];
			strcpy(_str, s._str);
		}*/
		//新方法--投机取巧
		string(const string& s)
			:_str(nullptr)
			,_size(0)
			,_capacity(0)
		{
			string tmp(s._str);
			//this->swap(tmp);
			swap(tmp);
		}
		//赋值，要考虑自己拷贝给自己的问题，并且是要先开空间，因为释放空间是不会失败的。
		//传统写法
		/*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& operator=(string s)
		{
			swap(s);
			return *this;
		}
		/*string& operator=(string s)
		{
			swap(_str, s._str);
			return *this;
		}*/

		~string()
		{
			delete[]_str;
			_str = nullptr;
			_size = _capacity = 0;
		}
		const char* c_str()const
		{
			return _str;
		}
		size_t size()const
		{
			return _size;
		}
		//这里提供两个版本[]一个可以读一个可以写，分开实现使用最匹配的
		char& operator[](size_t pos)
		{
			assert(pos < _size);
			return _str[pos];
		}
		const char& operator[](size_t pos) const
		{
			assert(pos < _size);
			return _str[pos];
		}

		//对我们的容量进行改变
		void reserve(size_t n)
		{
			if (n > _capacity)
			{
				char* tmp = new char[n + 1];//这里加1是因为n是可存储的有效字符数，加1存储一个\0
				strcpy(tmp, _str);
				delete[]_str;
				_str = tmp;
				_capacity = n;
			}
		}
		/*void resize(size_t n, char ch = '\0')
		{
			if (n > _size)
			{
				if (n > _capacity)
				{
					reserve(n);
				}
				for (int i = _size; i < n; i++)
				{
					_str[i] = ch;
				}
			}
			_size = n;
			_str[_size] = '\0';
		}*/

		void resize(size_t n, char ch = '\0')
		{
			if (n <= _size)
			{
				_size = n;
				_str[_size] = '\0';
			}
			else
			{
				if (n > _capacity)
				{
					reserve(n);
				}
				memset(_str + _size, ch, n - _size);
				_size = n;
				_str[_size] = '\0';
			}
		}

		void push_back(char ch)
		{
			/*if (_size == _capacity)
			{
				reserve(_capacity == 0 ? 4 : _capacity * 2);
			}
			_str[_size] = ch;
			++_size;
			_str[_size] = '\0';*/
			insert(_size, ch);
		}
		void append(const char* str)
		{
			//因为不知道插入的字符串的长度大小，因此要先计算插入的字符串的大小
			//size_t len = strlen(str);
			//if (_size + len > _capacity)//此时需要增容
			//{
			//	reserve(_size + len);
			//}
			//strcpy(_size + _str, str);
			//_size += len;
			insert(_size, str);
		}
		string& operator+=(char ch)
		{
			push_back(ch);
			return *this;
		}
		string& operator+=(const char* str)
		{
			append(str);
			return *this;
		}

		size_t find(char ch)
		{
			for (int i = 0; i < _size; i++)
			{
				if (ch == _str[i])
				{
					return i;
				}
			}
			return npos;
		}

		size_t find(const char* str, size_t pos = 0)
		{
			const char* ptr = strstr(_str+pos, str);
			if (ptr == nullptr)
			{
				return npos;
			}
			else
			{
				return ptr - _str;
			}
		}
		
		string& insert(int pos, char ch)
		{
			assert(pos <= _size);
			if (_size == _capacity)
			{
				reserve(_capacity == 0 ? 4 : _capacity * 2);
			}
			
			/*size_t end = _size;
			while (end >= pos)
			{
				_str[end + 1] = _str[end];
				end--;
			}*/
			//上面这个写法会产生越界访问，形成死循环
			/*int end = _size;
			while (end >= (int)pos)
			{
				_str[end + 1] = _str[end];
				end--;
			}*/
			//上面这个写法就可以避免越界了，但是写法极其不好

			size_t end = _size+1;
			while (end > pos)
			{
				_str[end] = _str[end - 1];
				end--;
			}
			_str[pos] = ch;
			++_size;
			return *this;
		}
		string& insert(int pos, const char* str)
		{
			assert(pos <= _size);
			size_t len = strlen(str);
			if (_size + len > _capacity)
			{
				reserve(_size + len);
			}
			size_t end = _size + len;
			while (end >= pos + len)
			{
				_str[end] = _str[end - len];
				end--;
			}
			/*strncpy(_str + pos, str, len);*/
			for (int i = 0; i < len; i++)
			{
				_str[pos] = *str;
				pos++;
				str++;
			}
			return *this;
		}

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

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

		/*bool operator<(const string& str) const
		{
			return strcmp(_str, str._str) < 0;
		}*/
		
	private:
		char* _str;
		size_t _size;//有效字符的个数
		size_t _capacity;//有效字符的空间数，不算\0

		static const size_t npos;
	};

	const size_t string::npos = -1;

	//"abcd" "abcd" false
	//"abcd" "abcde" true
	//"abcde" "abcd" false
	bool operator<(const string& s1, const string& s2)
	{
		size_t i1 = 0, i2 = 0;
		while (i1 < s1.size() && i2 < s2.size())
		{
			if (s1[i1] < s2[i2])
			{
				return true;
			}
			else if (s1[i1] > s2[i2])
			{
				return false;
			}
			else
			{
				i1++;
				i2++;
			}
		}
		if (i2 < s2.size())
		{
			return true;
		}
		return false;
		//return strcmp(s1.c_str(), s2.c_str()) < 0;
	}
	bool operator==(const string& s1, const string& s2)
	{
		return strcmp(s1.c_str(), s2.c_str()) == 0;
	}
	bool operator<=(const string& s1, const string& s2)
	{
		return s1 < s2 || s1 == s2;
	}
	bool operator>(const string& s1, const string& s2)
	{
		return !(s1 <= s2);
	}
	bool operator>=(const string& s1, const string& s2)
	{
		return !(s1 < s2);
	}
	bool operator!=(const string& s1, const string& s2)
	{
		return !(s1 == s2);
	}

	ostream& operator<<(ostream& out, const string& s)
	{
		/*for (auto ch : s)
		{
			out << ch;
		}*/
		for (size_t i = 0; i < s.size(); i++)
		{
			out << s[i];
		}
		//上面这两种方式就是将_str的字符一一打印出来\0不一定是字符串结尾

		//out << s.c_str();
		//这种遇到\0就会停止了，但是要是一个字符串里面本身就含有\0的话那么就不会显示后面的字符了
		return out;
	}
	istream& operator>>(istream& in, string& s)//这里不能写const的原因是这里的s里面的_str是要修改的
	{
		s.clear();
		char ch = in.get();
		while ((ch != ' ') || (ch != '\n'))
		{
			s += ch;
			ch = in.get();
		}
		return in;
	}
	
	void test_string1()
	{
		string s1("hello world\n");
		string s2("sort\n");
		for (size_t i = 0; i < s1.size(); i++)
		{
			std::cout << s1[i] << " ";
		}
		std::cout << std::endl;

	}
	void test_string3()
	{
		string s1("hello world");
		s1.push_back('@');
		s1.push_back('#');
		s1.append("abcdefghigkasdfghjkl");
		cout << s1.c_str() << endl;


		string s2;
		s2 += 'x';
		s2 += "xyz";
		cout << s2.c_str() << endl;
	}
	void test_string4()
	{
		string s1("hello world\n");
		/*s1.insert(0, 'x');
		cout << s1.c_str() << endl;*/
		s1.insert(2, "abcd");
		cout << s1.c_str() << endl;
	}
	void test_string5()
	{
		string s1("abcd");
		string s2("abcd");
		cout << (s1 < s2) << endl;

		string s3("abcd");
		string s4("abcde");
		cout << (s3 < s4) << endl;

		string s5("abcde");
		string s6("abcd");
		cout << (s5 < s6) << endl;
	}

}