string的模拟实现

1.string.h代码

#pragma once
#include<assert.h>
namespace myh
{
	class string
	{
		friend ostream& operator<<(ostream& _cout, const myh::string& s);
		friend istream& operator>>(istream& _cin, myh::string& s);
	public:
		typedef char* iterator;
		typedef const char* const_iterator;
		// iterator

		iterator begin()
		{
			return _str;
		}

		iterator end()
		{
			return _str + _size;
		}

		const_iterator begin() const
		{
			return _str;
		}

		const_iterator end() const
		{
			return _str + _size;
		}
	public:
		string(const char* str = "")
			:_size(strlen(str))

		{
			_capacity = _size;
			_str = new char[_capacity + 1];
			strcpy(_str, str);
		}
		string(const string& s)
			:_size(s.size())
		{
			_capacity = _size;
			_str = new char[_capacity + 1];
			strcpy(_str, s._str);
		}
		/*string(const string& s)//现代写法1
			:_size(0)
			,_capacity(0)
			,_str(nullptr)//为了防止析构时候delete随机值
		{
			string tmp(s._str);
			swap(tmp);
		}*/

		string& operator=(const string& s)
		{
			_size = s._size;
			_capacity = s._capacity;
			delete[] _str;
			_str = new char[_capacity + 1];
			strcpy(_str, s._str);
			return  *this;
		}
		//s1 = s2
		/*string& operator=(const string& s)现代写法1,结束的时候临时变量销毁,里面储存的原本s1中的数据也销毁了,
		{                                    //也相当于做了和传统写法里一样的事情
			if (this != &s)
			{
				string tmp(s._str);
				swap(tmp);
			}
			return *this;
		}*/
		/*	string& operator=(string tmp)
			{
				swap(tmp);//这里不判断的原因是,都已经拷贝构造过开了空间了,判断不判断其实一样
				return *this;
			}*/
		~string()
		{
			_size = _capacity = 0;
			delete[]_str;
			_str = nullptr;
		}


		// modify

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

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

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

		string& operator+=(const char* str)
		{
			append(str);
			return *this;
		}

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

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

		string substr(size_t pos, size_t len = npos)
		{
			string s;
			size_t end = pos + len;
			if (len == npos || pos + len >= _size)
			{
				len = _size - pos;
				end = _size;
			}

			s.reserve(len);
			for (size_t i = pos; i < end; i++)
			{
				s += _str[i];
			}

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

		// capacity

		size_t size()const
		{
			return _size;
		}

		size_t capacity()const
		{
			return _capacity;
		}

		bool empty()const
		{
			if (_size == 0)return true;
			else return false;
		}

		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';
			}
		}

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

			}
		}

		// access

		char& operator[](size_t index)
		{
			assert(index < _size && index >= 0);
			return _str[index];
		}

		const char& operator[](size_t index)const
		{
			assert(index < _size && index >= 0);
			return _str[index];
		}



		//relational operators

		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);
		}



		// 返回c在string中第一次出现的位置

		size_t find(char c, size_t pos = 0) const
		{
			for (int 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
		{
			const char* p = strstr(_str + pos, s);
			if (p)
			{
				return p - _str;
			}
			else
			{
				return npos;
			}
		}

		// 在pos位置上插入字符c/字符串str,并返回该字符的位置

		void insert(size_t pos, char ch)
		{
			assert(pos <= _size);
			if (_size == _capacity)
			{
				reserve(_capacity == 0 ? 4 : _capacity * 2);
			}

			// 17:17
			size_t end = _size + 1;
			while (end > pos)
			{
				_str[end] = _str[end - 1];
				--end;
			}

			_str[pos] = ch;
			_size++;
		}

		void 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;
		}



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

		void erase(size_t pos, size_t len = npos)
		{
			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 _capacity;

		size_t _size;


		const static size_t npos;
	};

	const size_t string::npos = -1;
	ostream& operator<<(ostream& _cout, const myh::string& s)
	{
		for (size_t i = 0; i < s.size(); i++)
		{
			_cout << s[i];
		}
		return cout;
	}
	istream& operator>>(istream& in, myh::string& s)
	{
		s.clear();
		s.reserve(128);
		char ch;
		ch = in.get();
		while (ch != ' ' && ch != '\n')
		{
			s += ch;
			ch = in.get();
		}
		return in;
	}
	void test1()
	{
		string d1;//1
		string d2("hello myh");//1
		string d3(d2);//1
		d1 = d2;//1
		d1.push_back('a');//1
		d3.append("xyz");
		d2 += 'b';
		d2 += "cdefghijklmn";
		d1.clear();
		cout << d2.c_str() << endl;
		cout << d2.size() << endl;
		cout << d2.capacity() << endl;
		cout << d1.empty() << endl;
		cout << d2.empty() << endl;
	}
	void test2()
	{
		string d1("hello myh");
		const string d2(d1);
		d1.reserve(129);
		cout << d1[0] << endl;
		d1[0]++;
		cout << d1[0] << endl;
		cout << d2[1] << endl;
		cout << d1 << endl;
		cout << d2 << endl;
		int a, b, c, d, e, f;
		a = d1 > d2;
		b = d1 >= d2;
		c = d1 == d2;
		d = d1 < d2;
		d1[0]--;
		d1[1]--;
		e = d1 <= d2;
		f = d1 != d2;
		cout << a << b << c << d << e << f << endl;
	}
	void test3()
	{
		string s1("hello");
		string::iterator it = s1.begin();
		while (it != s1.end())
		{
			(*it)++;
			cout << *it << " ";
			++it;
		}
		cout << endl;

		for (auto ch : s1)
		{
			ch++;
			cout << ch << " ";
		}
		cout << endl;

		cout << s1.c_str() << endl;

		for (auto& ch : s1)
		{
			ch++;
			cout << ch << " ";
		}
		cout << endl;

		cout << s1.c_str() << endl;
	}
	void test4()
	{
		string d1("hello myh");
		cout << d1.find('m') << endl;
		cout << d1.find("lo") << endl;
		cout << d1.find('x') << endl;
		//d1.insert(1, '%');
		d1.insert(0, 'a');
		d1.insert(0, "i am");
		cout << d1 << endl;
	}
	void test5()
	{
		string d1("hello");
		string d2("world");
		//swap(d1, d2);
		//cout << d1 << endl;
		//cout << d2 << endl;
		//d1.resize(2);
		//cout << d1 << endl;;
		d1.resize(5);
		d1.resize(20, 'a');
		cout << d1 << endl;
		d1.erase(0, 3);
		cout << d1 << endl;

		d1.erase(5, 100);
		cout << d1 << endl;

		d1.erase(2);
		cout << d1 << endl;
	}
};

2.test.cpp

#define _CRT_SECURE_NO_WARNINGS 1
#include<iostream>
#include<vector>
#include<list>
#include<string>
using namespace std;

#include"string.h"
int main()
{
	//myh::test1();
	//myh::test2();
	//myh::test3();
	//myh::test4();
	myh::test5();
	return 0;
}

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值