string类各函数接口总览
namespace String
{
class string
{
public:
typedef char* iterator;
typedef const char* const_iterator;
string(const char* str = "");
string(const string& s);
string& operator=(const string& s);
~string();
iterator begin();
iterator end();
const_iterator begin()const;
const_iterator end()const;
size_t size() const
size_t capacity()const
void reserve(size_t n);
void resize(size_t n, char ch = '\0');
bool empty()const;
void push_back(char ch);
void append(const char* str);
string& operator+=(char ch);
string& operator+=(const char* str);
string& insert(size_t pos, char ch);
string& insert(size_t pos, const char* str);
string& erase(size_t pos, size_t len);
void clear();
string substr(size_t pos = 0, size_t len = npos);
void swap(string& s);
const char* c_str()const;
char& operator[](size_t i);
const char& operator[](size_t i)const;
size_t find(char ch, size_t pos = 0)const;
size_t find(const char* str, size_t pos = 0)const;
size_t rfind(char ch, size_t pos = npos)const;
size_t rfind(const char* str, size_t pos = 0)const;
bool operator>(const string& s)const;
bool operator>=(const string& s)const;
bool operator<(const string& s)const;
bool operator<=(const string& s)const;
bool operator==(const string& s)const;
bool operator!=(const string& s)const;
private:
char* _str;
size_t _size;
size_t _capacity;
static const size_t npos;
};
const size_t string::npos = -1;
istream& operator>>(istream& in, string& s);
ostream& operator<<(ostream& out, const string& s);
istream& getline(istream& in, string& s);
}
默认成员函数
构造函数
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 = s._capacity;
_str = new char[s._capacity + 1];
strcpy(_str, s._str);
}
赋值运算符重载函数
string& operator = (const string& 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()
{
delete[]_str;
_str = nullptr;
_capacity = _size = 0;
}
迭代器相关函数
begin和end
iterator begin()
{
return _str;
}
iterator end()
{
return _str + _size;
}
const_iterator begin()const
{
return _str;
}
const_iterator end()const
{
return _str + _size;
}
容量和大小相关函数
size和capacity
size_t size() const
{
return _size;
}
size_t capacity()const
{
return _capacity;
}
reserve和resize
void reserve(size_t n)
{
if (n > _capacity)
{
char* tmp = new char[n + 1];
strcpy(tmp, _str);
delete _str;
_str = tmp;
_capacity = n;
}
}
void rsize(size_t n,char ch = '\0')
{
if (n < _size)
{
_str[n] = '\0';
}
else
{
reserve(n);
for (size_t i = _size; i < n; i++)
{
_str[i] = ch;
}
_str[n] = '\0';
_size = n;
}
}
empty
bool empty()const
{
return _str[0] == ' ';
}
修改字符串相关函数
push_back
void push_back(char ch)
{
if (_size == _capacity)
{
reserve(_capacity == 0 ? 4 : _capacity * 2);
}
_str[_size] = ch;
_size++;
_str[_size] = '\0';
}
append
void append(const char* str)
{
size_t len = strlen(str);
if (len + _size > _capacity)
{
reserve(len + _size);
}
strcpy(_str + _size, str);
_size += len;
}
operator+=
string& operator += (char ch)
{
push_back(ch);
return *this;
}
string& operator += (const char* str)
{
append(str);
return *this;
}
insert
void 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++;
}
void 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 - 1)
{
_str[end] = _str[end - len];
end--;
}
strncpy(_str + pos, str, len);
_size += len;
}
erase
void erase(size_t pos, size_t len)
{
assert(pos < _size);
if (len == npos || len >= _size - pos)
{
_str[pos] = '\0';
_size = pos;
}
else
{
strcpy(_str + pos, _str + pos + len);
_size = len;
}
}
clear
void clear()
{
_size = 0;
_str[_size] = '\0';
}
swap
void swap(string& s)
{
std::swap(_str, s._str);
std::swap(_size, s._size);
std::swap(_capacity, s._capacity);
}
substr
string substr(size_t pos = 0, size_t len = npos)
{
string sub;
if (len >= _size - pos)
{
for (size_t i = pos; i < _size; i++)
{
sub += _str[i];
}
}
else
{
for (size_t i = pos; i < pos + len; i++)
{
sub += _str[i];
}
}
return sub;
}
c_str
const char* c_str()const
{
return _str;
}
访问字符串相关函数
operator[ ]
char& operator[](size_t i)
{
assert(i < _size);
return _str[i];
}
const char& operator[](size_t i)const
{
assert(i < _size);
return _str[i];
}
find和rfind
size_t find(char ch, size_t pos = 0)const
{
assert(pos < _size);
for (size_t i = pos; i < _size; i++)
{
if (_str[i] == ch)
{
return i;
}
}
return npos;
}
size_t find(const char* str, size_t pos = 0)const
{
assert(pos < _size);
const auto * p = strstr(_str + pos, str);
if (p)
{
return p - _str;
}
else
{
return npos;
}
}
size_t rfind(char ch, size_t pos = npos)const
{
string tmp(*this);
std::reverse(tmp.begin(), tmp.end());
if (pos >= _size);
{
pos = _size - 1;
}
pos = _size - 1 - pos;
size_t ret = tmp.find(ch, pos);
if (ret != npos)
{
return _size - 1 - ret;
}
else
{
return npos;
}
}
size_t rfind(const char* str, size_t pos = 0)const
{
string tmp(*this);
std::reverse(tmp.begin(), tmp.end());
size_t len = strlen(str);
char* arr = new char[len + 1];
strcpy(arr, str);
size_t left = 0, right = len - 1;
while (left < right)
{
std::swap(arr[left], arr[right]);
left++;
right--;
}
if (pos >= _size)
{
pos = _size - 1;
}
pos = _size - 1 - pos;
size_t ret = tmp.find(arr, pos);
delete[] arr;
if (ret != npos)
return _size - ret - len;
else
return npos;
}
关系运算符重载函数
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 strcmp(_str, s._str) == 0;
}
bool operator != (const string& s)const
{
return !(*this == s);
}
>>和<<运算符的重载以及getline函数
>>运算符的重载
std::istream& operator>>(std::istream& in, string& s)
{
s.clear();
char ch = in.get();
while (ch != ' ' && ch != '\n')
{
s += ch;
ch = in.get();
}
return in;
}
<<运算符的重载
std::ostream& operator<<(std::ostream& out, string& s)
{
for (auto e : s)
{
out << e;
}
return out;
}
getline
std::istream& getline(std::istream& in, string& s)
{
s.clear();
char ch = in.get();
while (ch != '\n')
{
s += ch;
ch = in.get();
}
return in;
}
总览:
#pragma once
#include<assert.h>
#include<iostream>
namespace String
{
class string
{
public:
typedef char* iterator;
typedef const char* const_iterator;
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 = s._capacity;
_str = new char[s._capacity + 1];
strcpy(_str, s._str);
}
string& operator = (const string& 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()
{
delete[]_str;
_str = nullptr;
_capacity = _size = 0;
}
iterator begin()
{
return _str;
}
iterator end()
{
return _str + _size;
}
const_iterator begin()const
{
return _str;
}
const_iterator end()const
{
return _str + _size;
}
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];
strcpy(tmp, _str);
delete _str;
_str = tmp;
_capacity = n;
}
}
void rsize(size_t n,char ch = '\0')
{
if (n < _size)
{
_str[n] = '\0';
}
else
{
reserve(n);
for (size_t i = _size; i < n; i++)
{
_str[i] = ch;
}
_str[n] = '\0';
_size = n;
}
}
bool empty()const
{
return _str[0] == ' ';
}
void push_back(char ch)
{
if (_size == _capacity)
{
reserve(_capacity == 0 ? 4 : _capacity * 2);
}
_str[_size] = ch;
_size++;
_str[_size] = '\0';
}
void append(const char* str)
{
size_t len = strlen(str);
if (len + _size > _capacity)
{
reserve(len + _size);
}
strcpy(_str + _size, str);
_size += len;
}
string& operator += (char ch)
{
push_back(ch);
return *this;
}
string& operator += (const char* str)
{
append(str);
return *this;
}
void 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++;
}
void 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 - 1)
{
_str[end] = _str[end - len];
end--;
}
strncpy(_str + pos, str, len);
_size += len;
}
void erase(size_t pos, size_t len)
{
assert(pos < _size);
if (len == npos || len >= _size - pos)
{
_str[pos] = '\0';
_size = pos;
}
else
{
strcpy(_str + pos, _str + pos + len);
_size = len;
}
}
void clear()
{
_size = 0;
_str[_size] = '\0';
}
string substr(size_t pos = 0, size_t len = npos)
{
string sub;
if (len >= _size - pos)
{
for (size_t i = pos; i < _size; i++)
{
sub += _str[i];
}
}
else
{
for (size_t i = pos; i < pos + len; i++)
{
sub += _str[i];
}
}
return sub;
}
void swap(string& s)
{
std::swap(_str, s._str);
std::swap(_size, s._size);
std::swap(_capacity, s._capacity);
}
const char* c_str()const
{
return _str;
}
char& operator[](size_t i)
{
assert(i < _size);
return _str[i];
}
const char& operator[](size_t i)const
{
assert(i < _size);
return _str[i];
}
size_t find(char ch, size_t pos = 0)const
{
assert(pos < _size);
for (size_t i = pos; i < _size; i++)
{
if (_str[i] == ch)
{
return i;
}
}
return npos;
}
size_t find(const char* str, size_t pos = 0)const
{
assert(pos < _size);
const auto * p = strstr(_str + pos, str);
if (p)
{
return p - _str;
}
else
{
return npos;
}
}
size_t rfind(char ch, size_t pos = npos)const
{
string tmp(*this);
std::reverse(tmp.begin(), tmp.end());
if (pos >= _size);
{
pos = _size - 1;
}
pos = _size - 1 - pos;
size_t ret = tmp.find(ch, pos);
if (ret != npos)
{
return _size - 1 - ret;
}
else
{
return npos;
}
}
size_t rfind(const char* str, size_t pos = 0)const
{
string tmp(*this);
std::reverse(tmp.begin(), tmp.end());
size_t len = strlen(str);
char* arr = new char[len + 1];
strcpy(arr, str);
size_t left = 0, right = len - 1;
while (left < right)
{
std::swap(arr[left], arr[right]);
left++;
right--;
}
if (pos >= _size)
{
pos = _size - 1;
}
pos = _size - 1 - pos;
size_t ret = tmp.find(arr, pos);
delete[] arr;
if (ret != npos)
return _size - ret - len;
else
return npos;
}
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 strcmp(_str, s._str) == 0;
}
bool operator != (const string& s)const
{
return !(*this == s);
}
static const size_t npos;
private:
char* _str;
size_t _size;
size_t _capacity;
};
const size_t string::npos = -1;
std::istream& operator>>(std::istream& in, string& s)
{
s.clear();
char ch = in.get();
while (ch != ' ' && ch != '\n')
{
s += ch;
ch = in.get();
}
return in;
}
std::ostream& operator<<(std::ostream& out, string& s)
{
for (auto e : s)
{
out << e;
}
return out;
}
std::istream& getline(std::istream& in, string& s)
{
s.clear();
char ch = in.get();
while (ch != '\n')
{
s += ch;
ch = in.get();
}
return in;
}
}
测试
#define _CRT_SECURE_NO_WARNINGS 1
#include"string.h"
using namespace String;
void test1()
{
string s1("a");
s1.append("bcdefg");
s1.rsize(13);
}
void test_string7()
{
string url1("https://legacy.cplusplus.com/reference/string/string/substr/");
string url2("http://www.baidu.com/s?ie=utf-8&f=8&rsv_bp=1&rsv_idx=1&tn=65081411_1_oem_dg&wd=%E5%90%8E%E7%BC%80%20%E8%8B%B1%E6%96%87&fenlei=256&rsv_pq=0xc17a6c03003ede72&rsv_t=7f6eqaxivkivsW9Zwc41K2mIRleeNXjmiMjOgoAC0UgwLzPyVm%2FtSOeppDv%2F&rqlang=en&rsv_dl=ib&rsv_enter=1&rsv_sug3=4&rsv_sug1=3&rsv_sug7=100&rsv_sug2=0&rsv_btype=i&inputT=1588&rsv_sug4=6786");
string protocol, domain, uri;
size_t i1 = url1.find(':');
if (i1 != -1)
{
protocol = url1.substr(0, i1 - 0);
std::cout << protocol.c_str() << std::endl;
}
size_t i2 = url1.find('/', i1 + 3);
if (i2 != string::npos)
{
domain = url1.substr(i1 + 3, i2 - (i1 + 3));
std::cout << domain.c_str() << std::endl;
uri = url1.substr(i2 + 1);
std::cout << uri.c_str() << std::endl;
}
size_t i3 = url1.find("baidu");
std::cout << i3 << std::endl;
}
int main()
{
test_string7();
return 0;
}