C++---string模拟实现

模拟实现string类的大部分常用接口

1. 迭代器的 begin 和 end 方法

2. 构造函数，拷贝构造，析构，赋值操作符重载

3. push_back , append , size , capacity 等接口实现

4. resize , reserve 实现及判断符号（>,<,= ...）重载

5. find insert erase 实现

6. 流插入，流提取操作符 重载

namespace zj
{
    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;
        }
    public:
        string(const char* str = "")
        {
            _size = strlen(str);
            _capacity = _size;
            _str = new char[_capacity + 1];

            strcpy(_str, str);
        }
        string(const string& s)
            :_str(nullptr)
            , _size(0)
            , _capacity(0)
        {
            string tmp(s._str);
            swap(tmp); //this->swap(tmp);
        }

        string& operator=(string s)
		{
			swap(s);
			return *this;
		}

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

        void push_back(char ch)
        {
            insert(_size, ch);
        }

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

        void append(const char* str)
        {
            insert(_size, str);
        }

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

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

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

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

        size_t size()const
        {
            return _size;
        }

        size_t capacity()const
        {
            return _capacity;
        }

        bool empty()const
        {
            return _size == 0;
        }

        void resize(size_t n, char ch = '\0')
        {
            if (n > _size)
            {
                // 插入数据
                reserve(n);
                for (size_t i = _size; i < n; ++i)
                {
                    _str[i] = ch;
                }
                _str[n] = '\0';
                _size = n;
            }
            else
            {
                // 删除数据
                _str[n] = '\0';
                _size = n;
            }
        }

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

                _str = tmp;
                _capacity = n;
            }
        }

        char& operator[](size_t pos)
        {
            assert(pos < _size);
            return _str[pos];
        }

        const char& operator[](size_t pos) const
        {
            assert(pos < _size);
            return _str[pos];
        }

        bool operator>(const string& s) const
        {
            return strcmp(_str, s._str) > 0;
        }

        bool operator==(const string& s) const
        {
            return strcmp(_str, s._str) == 0;
        }

        bool operator>=(const string& s) const
        {
            return *this > s || *this == s;
        }

        bool operator<=(const string& s) const
        {
            return !(*this > s);
        }

        bool operator<(const string& s) const
        {
            return !(*this >= s);
        }

        bool operator!=(const string& s) const
        {
            return !(*this == s);
        }

        // 返回c在string中第一次出现的位置
        size_t find(char ch, size_t pos = 0) const
        {
            assert(pos < _size);

            for (size_t i = pos; i < _size; ++i)
            {
                if (ch == _str[i])
                {
                    return i;
                }
            }

            return npos;
        }

        // 返回子串s在string中第一次出现的位置
        size_t find(const char* sub, size_t pos = 0) const
        {
            assert(sub);
            assert(pos < _size);
            const char* ptr = strstr(_str + pos, sub);
            if (ptr == nullptr)
            {
                return npos;
            }
            else
            {
                return ptr - _str;
            }
        }
        // 在pos位置上插入字符c/字符串str，并返回该字符的位置
        string& 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;

            return *this;
        }

        string& insert(size_t 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);
            _size += len;
            return *this;
        }
        // 删除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
            {
                strcpy(_str + pos, _str + pos + len);
                _size -= len;
            }
        }

    private:
        char* _str;
        size_t _capacity;
        size_t _size;

    public:
        const static size_t npos = -1;
    };

    ostream& operator<<(ostream& out, const string& s)
    {
        for (size_t i = 0; i < s.size(); ++i)
        {
            out << s[i];
        }

        return out;
    }

    istream& operator>>(istream& in, string& s)
    {
        s.clear();

        char ch;
        ch = in.get();

        const size_t N = 32;
        char buff[N];
        size_t i = 0;
        while (ch != ' ' && ch != '\n')
        {
            buff[i++] = ch;
            if (i == N - 1)
            {
                buff[i] = '\0';
                s += buff;
                i = 0;
            }
            ch = in.get();
        }
        buff[i] = '\0';
        s += buff;
        return in;
    }
};