add
This commit is contained in:
邹晓航
660
TinySTL/String.cpp
Normal file
660
TinySTL/String.cpp
Normal file
@@ -0,0 +1,660 @@
|
|||||||
|
#include "String.h"
|
||||||
|
|
||||||
|
#include <iostream>
|
||||||
|
|
||||||
|
namespace TinySTL{
|
||||||
|
const size_t string::npos;
|
||||||
|
|
||||||
|
string::string(size_t n, char c){
|
||||||
|
allocateAndFillN(n, c);
|
||||||
|
}
|
||||||
|
template<class InputIterator>
|
||||||
|
string::string(InputIterator first, InputIterator last){
|
||||||
|
//<2F><><EFBFBD><EFBFBD>ָ<EFBFBD><D6B8><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ּ<EFBFBD><D6BC><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ĺ<EFBFBD><C4BA><EFBFBD>
|
||||||
|
string_aux(first, last, typename std::is_integral<InputIterator>::type());
|
||||||
|
}
|
||||||
|
string::string(const char* s){
|
||||||
|
allocateAndCopy(s, s + strlen(s));
|
||||||
|
}
|
||||||
|
string::string(const char* s, size_t n){
|
||||||
|
allocateAndCopy(s, s + n);
|
||||||
|
}
|
||||||
|
string::string(const string& str){
|
||||||
|
allocateAndCopy(str.start_, str.finish_);
|
||||||
|
}
|
||||||
|
string::string(string&& str){
|
||||||
|
moveData(str);
|
||||||
|
}
|
||||||
|
string::string(const string& str, size_t pos, size_t len){
|
||||||
|
len = changeVarWhenEuqalNPOS(len, str.size(), pos);
|
||||||
|
allocateAndCopy(str.start_ + pos, str.start_ + pos + len);
|
||||||
|
}
|
||||||
|
string& string::operator= (const string& str){
|
||||||
|
if (this != &str){
|
||||||
|
destroyAndDeallocate();
|
||||||
|
allocateAndCopy(str.start_, str.finish_);
|
||||||
|
}
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
string& string::operator= (string&& str){
|
||||||
|
if (this != &str){
|
||||||
|
moveData(str);
|
||||||
|
}
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
string& string::operator= (const char* s){
|
||||||
|
destroyAndDeallocate();
|
||||||
|
allocateAndCopy(s, s + strlen(s));
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
string& string::operator= (char c){
|
||||||
|
destroyAndDeallocate();
|
||||||
|
allocateAndFillN(1, c);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
void string::resize(size_t n){
|
||||||
|
resize(n, value_type());
|
||||||
|
}
|
||||||
|
void string::resize(size_t n, char c){
|
||||||
|
if (n < size()){
|
||||||
|
dataAllocator::destroy(start_ + n, finish_);
|
||||||
|
finish_ = start_ + n;
|
||||||
|
}
|
||||||
|
else if (n > size() && n <= capacity()){
|
||||||
|
auto lengthOfInsert = n - size();
|
||||||
|
finish_ = TinySTL::uninitialized_fill_n(finish_, lengthOfInsert, c);
|
||||||
|
}
|
||||||
|
else if (n > capacity()){
|
||||||
|
auto lengthOfInsert = n - size();
|
||||||
|
iterator newStart = dataAllocator::allocate(getNewCapacity(lengthOfInsert));
|
||||||
|
iterator newFinish = TinySTL::uninitialized_copy(begin(), end(), newStart);
|
||||||
|
newFinish = TinySTL::uninitialized_fill_n(newFinish, lengthOfInsert, c);
|
||||||
|
|
||||||
|
destroyAndDeallocate();
|
||||||
|
start_ = newStart;
|
||||||
|
finish_ = newFinish;
|
||||||
|
endOfStorage_ = start_ + n;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
void string::reserve(size_t n){
|
||||||
|
if (n <= capacity())
|
||||||
|
return;
|
||||||
|
iterator newStart = dataAllocator::allocate(n);
|
||||||
|
iterator newFinish = TinySTL::uninitialized_copy(begin(), end(), newStart);
|
||||||
|
destroyAndDeallocate();
|
||||||
|
start_ = newStart;
|
||||||
|
finish_ = newFinish;
|
||||||
|
endOfStorage_ = start_ + n;
|
||||||
|
}
|
||||||
|
template <class InputIterator>
|
||||||
|
string::iterator string::insert_aux_copy(iterator p, InputIterator first, InputIterator last){
|
||||||
|
size_t lengthOfInsert = last - first;
|
||||||
|
auto newCapacity = getNewCapacity(lengthOfInsert);
|
||||||
|
iterator newStart = dataAllocator::allocate(newCapacity);
|
||||||
|
iterator newFinish = TinySTL::uninitialized_copy(start_, p, newStart);
|
||||||
|
newFinish = TinySTL::uninitialized_copy(first, last, newFinish);
|
||||||
|
auto res = newFinish;
|
||||||
|
newFinish = TinySTL::uninitialized_copy(p, finish_, newFinish);
|
||||||
|
|
||||||
|
destroyAndDeallocate();
|
||||||
|
start_ = newStart;
|
||||||
|
finish_ = newFinish;
|
||||||
|
endOfStorage_ = start_ + newCapacity;
|
||||||
|
return res;
|
||||||
|
}
|
||||||
|
template <class InputIterator>
|
||||||
|
string::iterator string::insert(iterator p, InputIterator first, InputIterator last){
|
||||||
|
auto lengthOfLeft = capacity() - size();
|
||||||
|
size_t lengthOfInsert = last - first;
|
||||||
|
if (lengthOfInsert <= lengthOfLeft){
|
||||||
|
for (iterator it = finish_ - 1; it >= p; --it){
|
||||||
|
*(it + lengthOfInsert) = *(it);
|
||||||
|
}
|
||||||
|
TinySTL::uninitialized_copy(first, last, p);
|
||||||
|
finish_ += lengthOfInsert;
|
||||||
|
return (p + lengthOfInsert);
|
||||||
|
}
|
||||||
|
else{
|
||||||
|
return insert_aux_copy(p, first, last);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
string& string::insert(size_t pos, const string& str){
|
||||||
|
insert(start_ + pos, str.begin(), str.end());
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
string& string::insert(size_t pos, const string& str, size_t subpos, size_t sublen){
|
||||||
|
sublen = changeVarWhenEuqalNPOS(sublen, str.size(), subpos);
|
||||||
|
insert(begin() + pos, str.begin() + subpos, str.begin() + subpos + sublen);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
string& string::insert(size_t pos, const char* s){
|
||||||
|
insert(begin() + pos, s, s + strlen(s));
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
string& string::insert(size_t pos, const char* s, size_t n){
|
||||||
|
insert(begin() + pos, s, s + n);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
string::iterator string::insert_aux_filln(iterator p, size_t n, value_type c){
|
||||||
|
auto newCapacity = getNewCapacity(n);
|
||||||
|
iterator newStart = dataAllocator::allocate(newCapacity);
|
||||||
|
iterator newFinish = TinySTL::uninitialized_copy(start_, p, newStart);
|
||||||
|
newFinish = TinySTL::uninitialized_fill_n(newFinish, n, c);
|
||||||
|
auto res = newFinish;
|
||||||
|
newFinish = TinySTL::uninitialized_copy(p, finish_, newFinish);
|
||||||
|
|
||||||
|
destroyAndDeallocate();
|
||||||
|
start_ = newStart;
|
||||||
|
finish_ = newFinish;
|
||||||
|
endOfStorage_ = start_ + newCapacity;
|
||||||
|
return res;
|
||||||
|
}
|
||||||
|
string& string::insert(size_t pos, size_t n, char c){
|
||||||
|
insert(begin() + pos, n, c);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
string::iterator string::insert(iterator p, size_t n, char c){
|
||||||
|
auto lengthOfLeft = capacity() - size();
|
||||||
|
if (n <= lengthOfLeft){
|
||||||
|
for (iterator it = finish_ - 1; it >= p; --it){
|
||||||
|
*(it + n) = *(it);
|
||||||
|
}
|
||||||
|
TinySTL::uninitialized_fill_n(p, n, c);
|
||||||
|
finish_ += n;
|
||||||
|
return (p + n);
|
||||||
|
}
|
||||||
|
else{
|
||||||
|
return insert_aux_filln(p, n, c);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
string::iterator string::insert(iterator p, char c){
|
||||||
|
return insert(p, 1, c);
|
||||||
|
}
|
||||||
|
string& string::operator+= (const string& str){
|
||||||
|
insert(size(), str);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
string& string::operator+= (const char* s){
|
||||||
|
insert(size(), s);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
string& string::operator+= (char c){
|
||||||
|
insert(end(), c);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
string& string::append(const string& str){
|
||||||
|
(*this) += str;
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
string& string::append(const string& str, size_t subpos, size_t sublen){
|
||||||
|
sublen = changeVarWhenEuqalNPOS(sublen, str.size(), subpos);
|
||||||
|
insert(size(), str, subpos, sublen);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
string& string::append(const char* s){
|
||||||
|
(*this) += s;
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
string& string::append(const char* s, size_t n){
|
||||||
|
insert(size(), s, n);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
string& string::append(size_t n, char c){
|
||||||
|
insert(end(), n, c);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
template <class InputIterator>
|
||||||
|
string& string::append(InputIterator first, InputIterator last){
|
||||||
|
insert(end(), first, last);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
string::iterator string::erase(iterator first, iterator last){
|
||||||
|
size_t lengthOfMove = finish_ - last;
|
||||||
|
for (auto i = 0; i != lengthOfMove; ++i){
|
||||||
|
*(first + i) = *(last + i);
|
||||||
|
}
|
||||||
|
dataAllocator::destroy(first + lengthOfMove, finish_);
|
||||||
|
finish_ = first + lengthOfMove;
|
||||||
|
return first;
|
||||||
|
|
||||||
|
}
|
||||||
|
string& string::erase(size_t pos, size_t len){
|
||||||
|
len = changeVarWhenEuqalNPOS(len, size(), pos);
|
||||||
|
erase(begin() + pos, begin() + pos + len);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
string::iterator string::erase(iterator p){
|
||||||
|
//return erase(p, end());
|
||||||
|
//bug fix
|
||||||
|
//2014.12.24
|
||||||
|
return erase(p, p + 1);
|
||||||
|
}
|
||||||
|
template <class InputIterator>
|
||||||
|
string& string::replace(iterator i1, iterator i2,
|
||||||
|
InputIterator first, InputIterator last){
|
||||||
|
auto ptr = erase(i1, i2);
|
||||||
|
insert(ptr, first, last);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
string& string::replace(size_t pos, size_t len, const string& str){
|
||||||
|
return replace(begin() + pos, begin() + pos + len, str.begin(), str.end());
|
||||||
|
}
|
||||||
|
string& string::replace(iterator i1, iterator i2, const string& str){
|
||||||
|
return replace(i1, i2, str.begin(), str.end());
|
||||||
|
}
|
||||||
|
string& string::replace(size_t pos, size_t len, const string& str, size_t subpos, size_t sublen){
|
||||||
|
sublen = changeVarWhenEuqalNPOS(sublen, str.size(), subpos);
|
||||||
|
return replace(begin() + pos, begin() + pos + len, str.begin() + subpos, str.begin() + subpos + sublen);
|
||||||
|
}
|
||||||
|
string& string::replace(size_t pos, size_t len, const char* s){
|
||||||
|
return replace(begin() + pos, begin() + pos + len, s, s + strlen(s));
|
||||||
|
}
|
||||||
|
string& string::replace(iterator i1, iterator i2, const char* s){
|
||||||
|
return replace(i1, i2, s, s + strlen(s));
|
||||||
|
}
|
||||||
|
string& string::replace(iterator i1, iterator i2, size_t n, char c){
|
||||||
|
auto ptr = erase(i1, i2);
|
||||||
|
insert(ptr, n, c);
|
||||||
|
return *this;
|
||||||
|
}
|
||||||
|
string& string::replace(size_t pos, size_t len, const char* s, size_t n){
|
||||||
|
return replace(begin() + pos, begin() + pos + len, s, s + n);
|
||||||
|
}
|
||||||
|
string& string::replace(iterator i1, iterator i2, const char* s, size_t n){
|
||||||
|
return replace(i1, i2, s, s + n);
|
||||||
|
}
|
||||||
|
string& string::replace(size_t pos, size_t len, size_t n, char c){
|
||||||
|
return replace(begin() + pos, begin() + pos + len, n, c);
|
||||||
|
}
|
||||||
|
size_t string::find_aux(const_iterator cit, size_t pos, size_t lengthOfS, size_t cond)const{
|
||||||
|
size_t i, j;
|
||||||
|
for (i = pos; i != cond; ++i){
|
||||||
|
for (j = 0; j != lengthOfS; ++j){
|
||||||
|
if (*(begin() + i + j) != cit[j])
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
if (j == lengthOfS)
|
||||||
|
return i;
|
||||||
|
}
|
||||||
|
return npos;
|
||||||
|
}
|
||||||
|
size_t string::find(const char* s, size_t pos, size_t n) const{
|
||||||
|
size_t lenghtOfS = strlen(s);
|
||||||
|
//if (n < lenghtOfS)
|
||||||
|
// return npos;
|
||||||
|
//return find_aux(s, pos, lenghtOfS, pos + n);
|
||||||
|
//bug fix
|
||||||
|
//2014.12.24
|
||||||
|
return find_aux(s, pos, n, size());
|
||||||
|
}
|
||||||
|
size_t string::find(const string& str, size_t pos) const{
|
||||||
|
size_t lengthOfS = str.size();
|
||||||
|
if (size() - pos < lengthOfS)
|
||||||
|
return npos;
|
||||||
|
return find_aux(str.cbegin(), pos, lengthOfS, size());
|
||||||
|
}
|
||||||
|
size_t string::find(const char* s, size_t pos) const{
|
||||||
|
//return find(s, pos, size() - pos);
|
||||||
|
//bug fix
|
||||||
|
//2014.12.24
|
||||||
|
return find(s, pos, strlen(s));
|
||||||
|
}
|
||||||
|
size_t string::find(char c, size_t pos) const{
|
||||||
|
for (auto cit = cbegin() + pos; cit != cend(); ++cit){
|
||||||
|
if (*cit == c)
|
||||||
|
return cit - cbegin();
|
||||||
|
}
|
||||||
|
return npos;
|
||||||
|
}
|
||||||
|
size_t string::rfind(char c, size_t pos) const{
|
||||||
|
pos = changeVarWhenEuqalNPOS(pos, size(), 1);
|
||||||
|
for (auto cit = cbegin() + pos; cit >= cbegin(); --cit){
|
||||||
|
if (*cit == c)
|
||||||
|
return cit - cbegin();
|
||||||
|
}
|
||||||
|
return npos;
|
||||||
|
}
|
||||||
|
size_t string::rfind_aux(const_iterator cit, size_t pos, size_t lengthOfS, int cond)const{
|
||||||
|
int i, j;
|
||||||
|
//bug fix
|
||||||
|
//2014.12.25
|
||||||
|
//for (i = pos - lengthOfS; i >= cond; --i){
|
||||||
|
for (i = pos + lengthOfS; i >= cond; --i){
|
||||||
|
for (j = 0; j != lengthOfS; ++j){
|
||||||
|
if (*(begin() + i + j) != cit[j])
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
if (j == lengthOfS)
|
||||||
|
return i;
|
||||||
|
}
|
||||||
|
return npos;
|
||||||
|
}
|
||||||
|
size_t string::rfind(const string& str, size_t pos) const{
|
||||||
|
auto lengthOfS = str.size();
|
||||||
|
//if (pos - 0 < lengthOfS)
|
||||||
|
// return npos;
|
||||||
|
pos = changeVarWhenEuqalNPOS(pos, size(), 1);
|
||||||
|
return rfind_aux(str.begin(), pos, lengthOfS, 0);
|
||||||
|
}
|
||||||
|
size_t string::rfind(const char* s, size_t pos) const{
|
||||||
|
pos = changeVarWhenEuqalNPOS(pos, size(), 1);
|
||||||
|
return rfind(s, pos, strlen(s));
|
||||||
|
}
|
||||||
|
size_t string::rfind(const char* s, size_t pos, size_t n) const{
|
||||||
|
auto lengthOfS = strlen(s);
|
||||||
|
//if (n < lengthOfS)
|
||||||
|
// return npos;
|
||||||
|
return rfind_aux(s, pos, n, 0);
|
||||||
|
}
|
||||||
|
int string::compare(const string& str) const{
|
||||||
|
return compare(0, size(), str, 0, str.size());
|
||||||
|
}
|
||||||
|
int string::compare(size_t pos, size_t len, const string& str) const{
|
||||||
|
return compare(pos, len, str, 0, str.size());
|
||||||
|
}
|
||||||
|
int string::compare_aux(size_t pos, size_t len, const_iterator cit, size_t subpos, size_t sublen)const{
|
||||||
|
size_t i, j;
|
||||||
|
for (i = 0, j = 0; i != len && j != sublen; ++i, ++j){
|
||||||
|
if ((*this)[pos + i] < cit[subpos + j])
|
||||||
|
return -1;
|
||||||
|
else if ((*this)[pos + i] > cit[subpos + j])
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
if (i == len && j == sublen)
|
||||||
|
return 0;
|
||||||
|
else if (i == len)
|
||||||
|
return -1;
|
||||||
|
else
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
int string::compare(size_t pos, size_t len, const string& str, size_t subpos, size_t sublen) const{
|
||||||
|
return compare_aux(pos, len, str.begin(), subpos, sublen);
|
||||||
|
}
|
||||||
|
int string::compare(const char* s) const{
|
||||||
|
return compare(0, size(), s, strlen(s));
|
||||||
|
}
|
||||||
|
int string::compare(size_t pos, size_t len, const char* s) const{
|
||||||
|
return compare(pos, len, s, strlen(s));
|
||||||
|
}
|
||||||
|
int string::compare(size_t pos, size_t len, const char* s, size_t n) const{
|
||||||
|
return compare_aux(pos, len, s, 0, n);
|
||||||
|
}
|
||||||
|
size_t string::find_first_of(const string& str, size_t pos) const{
|
||||||
|
//return find_first_of(str.begin(), pos, size() - pos);
|
||||||
|
return find_first_of(str.begin(), pos, str.size());
|
||||||
|
}
|
||||||
|
size_t string::find_first_of(const char* s, size_t pos) const{
|
||||||
|
//return find_first_of(s, pos, size() - pos);
|
||||||
|
return find_first_of(s, pos, strlen(s));
|
||||||
|
}
|
||||||
|
size_t string::find_first_of(const char* s, size_t pos, size_t n) const{
|
||||||
|
//for (size_t i = pos; i != pos + n; ++i){
|
||||||
|
// if (isContained((*this)[i], s, s + strlen(s)))
|
||||||
|
// return i;
|
||||||
|
//}
|
||||||
|
//bug fix
|
||||||
|
//2014.12.25
|
||||||
|
for (size_t i = pos; i != size(); ++i){
|
||||||
|
if (isContained((*this)[i], s, s + n))
|
||||||
|
return i;
|
||||||
|
}
|
||||||
|
return npos;
|
||||||
|
}
|
||||||
|
size_t string::find_first_of(char c, size_t pos) const{
|
||||||
|
return find(c, pos);
|
||||||
|
}
|
||||||
|
size_t string::find_first_not_of(const string& str, size_t pos) const{
|
||||||
|
//return find_first_not_of(str.begin(), pos, size() - pos);
|
||||||
|
return find_first_not_of(str.begin(), pos, str.size());
|
||||||
|
}
|
||||||
|
size_t string::find_first_not_of(const char* s, size_t pos) const{
|
||||||
|
//return find_first_not_of(s, pos, size() - pos);
|
||||||
|
return find_first_not_of(s, pos, strlen(s));
|
||||||
|
}
|
||||||
|
size_t string::find_first_not_of(const char* s, size_t pos, size_t n) const{
|
||||||
|
/*for (size_t i = pos; i != pos + n; ++i){
|
||||||
|
if (!isContained((*this)[i], s, s + strlen(s)))
|
||||||
|
return i;
|
||||||
|
}*/
|
||||||
|
for (size_t i = pos; i != size(); ++i){
|
||||||
|
if (!isContained((*this)[i], s, s + n))
|
||||||
|
return i;
|
||||||
|
}
|
||||||
|
return npos;
|
||||||
|
}
|
||||||
|
size_t string::find_first_not_of(char c, size_t pos) const{
|
||||||
|
for (size_t i = pos; i != size(); ++i){
|
||||||
|
if ((*this)[i] != c)
|
||||||
|
return i;
|
||||||
|
}
|
||||||
|
return npos;
|
||||||
|
}
|
||||||
|
size_t string::find_last_of(const string& str, size_t pos) const{
|
||||||
|
pos = changeVarWhenEuqalNPOS(pos, size(), 1);
|
||||||
|
//return find_last_of(str.begin(), pos, pos + 1);
|
||||||
|
return find_last_of(str.begin(), pos, str.size());
|
||||||
|
}
|
||||||
|
size_t string::find_last_of(const char* s, size_t pos) const{
|
||||||
|
pos = changeVarWhenEuqalNPOS(pos, size(), 1);
|
||||||
|
//return find_last_of(s, pos, pos + 1);
|
||||||
|
return find_last_of(s, pos, strlen(s));
|
||||||
|
}
|
||||||
|
size_t string::find_last_of(const char* s, size_t pos, size_t n) const{
|
||||||
|
/*for (size_t i = pos, j = 0; i >= 0 && j != n; --i, ++j){
|
||||||
|
if (isContained((*this)[i], s, s + strlen(s)))
|
||||||
|
return i;
|
||||||
|
}*/
|
||||||
|
//bug fix
|
||||||
|
//2014.12.25
|
||||||
|
for (size_t i = pos; i > 0; --i){
|
||||||
|
if (isContained((*this)[i], s, s + n))
|
||||||
|
return i;
|
||||||
|
}
|
||||||
|
return npos;
|
||||||
|
}
|
||||||
|
size_t string::find_last_of(char c, size_t pos) const{
|
||||||
|
return rfind(c, pos);
|
||||||
|
}
|
||||||
|
size_t string::find_last_not_of(const string& str, size_t pos) const{
|
||||||
|
pos = changeVarWhenEuqalNPOS(pos, size(), 1);
|
||||||
|
//return find_last_not_of(str.begin(), pos, size());
|
||||||
|
return find_last_not_of(str.begin(), pos, str.size());
|
||||||
|
}
|
||||||
|
size_t string::find_last_not_of(const char* s, size_t pos) const{
|
||||||
|
pos = changeVarWhenEuqalNPOS(pos, size(), 1);
|
||||||
|
//return find_last_not_of(s, pos, pos + 1);
|
||||||
|
return find_last_not_of(s, pos, strlen(s));
|
||||||
|
}
|
||||||
|
size_t string::find_last_not_of(const char* s, size_t pos, size_t n) const{
|
||||||
|
/*for (size_t i = pos, j = 0; i >= 0 && j != n; --i, ++j){
|
||||||
|
if (!isContained((*this)[i], s, s + strlen(s)))
|
||||||
|
return i;
|
||||||
|
}*/
|
||||||
|
//bug fix
|
||||||
|
//2014.12.24
|
||||||
|
for (size_t i = pos; i >= 0; --i){
|
||||||
|
if (!isContained((*this)[i], s, s + n))
|
||||||
|
return i;
|
||||||
|
}
|
||||||
|
return npos;
|
||||||
|
}
|
||||||
|
size_t string::find_last_not_of(char c, size_t pos) const{
|
||||||
|
pos = changeVarWhenEuqalNPOS(pos, size(), 1);
|
||||||
|
for (int i = pos; i >= 0; --i){
|
||||||
|
if ((*this)[i] != c)
|
||||||
|
return i;
|
||||||
|
}
|
||||||
|
return npos;
|
||||||
|
}
|
||||||
|
std::ostream& operator <<(std::ostream& os, const string&str){
|
||||||
|
for (const auto ch : str){
|
||||||
|
os << ch;
|
||||||
|
}
|
||||||
|
return os;
|
||||||
|
}
|
||||||
|
std::istream& operator >> (std::istream& is, string& str){
|
||||||
|
char ch;
|
||||||
|
string::size_type oldSize = str.size(), index = 0;
|
||||||
|
bool hasPrevBlank = false;
|
||||||
|
while (is.get(ch)){//<2F><><EFBFBD><EFBFBD>ǰ<EFBFBD><C7B0><EFBFBD>հ<EFBFBD>
|
||||||
|
if (isblank(ch) || ch == '\n')
|
||||||
|
hasPrevBlank = true;
|
||||||
|
else
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
is.putback(ch);
|
||||||
|
str.clear();
|
||||||
|
while (is.get(ch)){
|
||||||
|
if (ch != EOF && !isblank(ch) && ch != '\n'){
|
||||||
|
str.push_back(ch);
|
||||||
|
}
|
||||||
|
else
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
return is;
|
||||||
|
}
|
||||||
|
std::istream& getline(std::istream& is, string& str, char delim){
|
||||||
|
char ch;
|
||||||
|
str.clear();
|
||||||
|
while (is.get(ch)){
|
||||||
|
if (ch == delim)
|
||||||
|
break;
|
||||||
|
else
|
||||||
|
str.push_back(ch);
|
||||||
|
}
|
||||||
|
return is;
|
||||||
|
}
|
||||||
|
std::istream& getline(std::istream& is, string& str){
|
||||||
|
return getline(is, str, '\n');
|
||||||
|
}
|
||||||
|
string operator+ (const string& lhs, const string& rhs){
|
||||||
|
string res(lhs);
|
||||||
|
return res += rhs;
|
||||||
|
}
|
||||||
|
string operator+ (const string& lhs, const char* rhs){
|
||||||
|
string res(lhs);
|
||||||
|
return res += rhs;
|
||||||
|
}
|
||||||
|
string operator+ (const char* lhs, const string& rhs){
|
||||||
|
string res(lhs);
|
||||||
|
return res += rhs;
|
||||||
|
}
|
||||||
|
string operator+ (const string& lhs, char rhs){
|
||||||
|
string res(lhs);
|
||||||
|
return res += rhs;
|
||||||
|
}
|
||||||
|
string operator+ (char lhs, const string& rhs){
|
||||||
|
string res(1, lhs);
|
||||||
|
return res += rhs;
|
||||||
|
}
|
||||||
|
bool operator== (const string& lhs, const string& rhs){
|
||||||
|
if (lhs.size() == rhs.size()){
|
||||||
|
for (auto cit1 = lhs.cbegin(), cit2 = rhs.cbegin();
|
||||||
|
cit1 != lhs.cend() && cit2 != rhs.cend();
|
||||||
|
++cit1, ++cit2){
|
||||||
|
if (*cit1 != *cit2)
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
bool operator== (const char* lhs, const string& rhs){
|
||||||
|
return rhs == lhs;
|
||||||
|
}
|
||||||
|
bool operator== (const string& lhs, const char* rhs){
|
||||||
|
size_t len = strlen(rhs);
|
||||||
|
if (lhs.size() == len){
|
||||||
|
const char *p = rhs;
|
||||||
|
for (string::const_iterator cit = lhs.cbegin();
|
||||||
|
cit != lhs.cend() && p != rhs + len;
|
||||||
|
++cit, ++p){
|
||||||
|
if (*cit != *p)
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
bool operator!= (const string& lhs, const string& rhs){
|
||||||
|
return !(lhs == rhs);
|
||||||
|
}
|
||||||
|
bool operator!= (const char* lhs, const string& rhs){
|
||||||
|
return !(lhs == rhs);
|
||||||
|
}
|
||||||
|
bool operator!= (const string& lhs, const char* rhs){
|
||||||
|
return !(lhs == rhs);
|
||||||
|
}
|
||||||
|
bool operator< (const string& lhs, const string& rhs){
|
||||||
|
return !(lhs >= rhs);
|
||||||
|
}
|
||||||
|
bool operator< (const char* lhs, const string& rhs){
|
||||||
|
return !(lhs >= rhs);
|
||||||
|
}
|
||||||
|
bool operator< (const string& lhs, const char* rhs){
|
||||||
|
return !(lhs >= rhs);
|
||||||
|
}
|
||||||
|
|
||||||
|
namespace{
|
||||||
|
template<class Iterator1, class Iterator2>
|
||||||
|
bool lessEqual_aux(Iterator1 first1, Iterator1 last1, Iterator2 first2, Iterator2 last2){
|
||||||
|
for (; first1 != last1 && first2 != last2; ++first1, ++first2){
|
||||||
|
if (*first1 < *first2)
|
||||||
|
return true;
|
||||||
|
else if (*first1 > *first2)
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
if ((first1 == last1 && first2 == last2)// ==
|
||||||
|
|| (first1 == last1))// <
|
||||||
|
return true;
|
||||||
|
else
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
bool operator<= (const string& lhs, const string& rhs){
|
||||||
|
return lessEqual_aux(lhs.cbegin(), lhs.cend(), rhs.cbegin(), rhs.cend());
|
||||||
|
}
|
||||||
|
bool operator<= (const char* lhs, const string& rhs){
|
||||||
|
return lessEqual_aux(lhs, lhs + strlen(lhs), rhs.cbegin(), rhs.cend());
|
||||||
|
}
|
||||||
|
bool operator<= (const string& lhs, const char* rhs){
|
||||||
|
return lessEqual_aux(lhs.cbegin(), lhs.cend(), rhs, rhs + strlen(rhs));
|
||||||
|
}
|
||||||
|
bool operator> (const string& lhs, const string& rhs){
|
||||||
|
return !(lhs <= rhs);
|
||||||
|
}
|
||||||
|
bool operator> (const char* lhs, const string& rhs){
|
||||||
|
return !(lhs <= rhs);
|
||||||
|
}
|
||||||
|
bool operator> (const string& lhs, const char* rhs){
|
||||||
|
return !(lhs <= rhs);
|
||||||
|
}
|
||||||
|
namespace{
|
||||||
|
template<class Iterator1, class Iterator2>
|
||||||
|
bool greaterEqual_aux(Iterator1 first1, Iterator1 last1, Iterator2 first2, Iterator2 last2){
|
||||||
|
for (; first1 != last1 && first2 != last2; ++first1, ++first2){
|
||||||
|
if (*first1 > *first2)
|
||||||
|
return true;
|
||||||
|
else if (*first1 < *first2)
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
if ((first1 == last1 && first2 == last2)// ==
|
||||||
|
|| (first2 == last2))// >
|
||||||
|
return true;
|
||||||
|
else
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
bool operator>= (const string& lhs, const string& rhs){
|
||||||
|
return greaterEqual_aux(lhs.cbegin(), lhs.cend(), rhs.cbegin(), rhs.cend());
|
||||||
|
}
|
||||||
|
bool operator>= (const char* lhs, const string& rhs){
|
||||||
|
return greaterEqual_aux(lhs, lhs + strlen(lhs), rhs.cbegin(), rhs.cend());
|
||||||
|
}
|
||||||
|
bool operator>= (const string& lhs, const char* rhs){
|
||||||
|
return greaterEqual_aux(lhs.cbegin(), lhs.cend(), rhs, rhs + strlen(rhs));
|
||||||
|
}
|
||||||
|
void swap(string& x, string& y){
|
||||||
|
x.swap(y);
|
||||||
|
}
|
||||||
|
}
|
||||||
651
TinySTL/String.h
651
TinySTL/String.h
@@ -253,656 +253,5 @@ namespace TinySTL{
|
|||||||
friend std::istream& getline(std::istream& is, string& str, char delim);
|
friend std::istream& getline(std::istream& is, string& str, char delim);
|
||||||
friend std::istream& getline(std::istream& is, string& str);
|
friend std::istream& getline(std::istream& is, string& str);
|
||||||
};// end of string
|
};// end of string
|
||||||
|
|
||||||
const size_t string::npos;
|
|
||||||
|
|
||||||
string::string(size_t n, char c){
|
|
||||||
allocateAndFillN(n, c);
|
|
||||||
}
|
|
||||||
template<class InputIterator>
|
|
||||||
string::string(InputIterator first, InputIterator last){
|
|
||||||
//<2F><><EFBFBD><EFBFBD>ָ<EFBFBD><D6B8><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ּ<EFBFBD><D6BC><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ĺ<EFBFBD><C4BA><EFBFBD>
|
|
||||||
string_aux(first, last, typename std::is_integral<InputIterator>::type());
|
|
||||||
}
|
|
||||||
string::string(const char* s){
|
|
||||||
allocateAndCopy(s, s + strlen(s));
|
|
||||||
}
|
|
||||||
string::string(const char* s, size_t n){
|
|
||||||
allocateAndCopy(s, s + n);
|
|
||||||
}
|
|
||||||
string::string(const string& str){
|
|
||||||
allocateAndCopy(str.start_, str.finish_);
|
|
||||||
}
|
|
||||||
string::string(string&& str){
|
|
||||||
moveData(str);
|
|
||||||
}
|
|
||||||
string::string(const string& str, size_t pos, size_t len){
|
|
||||||
len = changeVarWhenEuqalNPOS(len, str.size(), pos);
|
|
||||||
allocateAndCopy(str.start_ + pos, str.start_ + pos + len);
|
|
||||||
}
|
|
||||||
string& string::operator= (const string& str){
|
|
||||||
if (this != &str){
|
|
||||||
destroyAndDeallocate();
|
|
||||||
allocateAndCopy(str.start_, str.finish_);
|
|
||||||
}
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
string& string::operator= (string&& str){
|
|
||||||
if (this != &str){
|
|
||||||
moveData(str);
|
|
||||||
}
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
string& string::operator= (const char* s){
|
|
||||||
destroyAndDeallocate();
|
|
||||||
allocateAndCopy(s, s + strlen(s));
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
string& string::operator= (char c){
|
|
||||||
destroyAndDeallocate();
|
|
||||||
allocateAndFillN(1, c);
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
void string::resize(size_t n){
|
|
||||||
resize(n, value_type());
|
|
||||||
}
|
|
||||||
void string::resize(size_t n, char c){
|
|
||||||
if (n < size()){
|
|
||||||
dataAllocator::destroy(start_ + n, finish_);
|
|
||||||
finish_ = start_ + n;
|
|
||||||
}else if (n > size() && n <= capacity()){
|
|
||||||
auto lengthOfInsert = n - size();
|
|
||||||
finish_ = TinySTL::uninitialized_fill_n(finish_, lengthOfInsert, c);
|
|
||||||
}
|
|
||||||
else if (n > capacity()){
|
|
||||||
auto lengthOfInsert = n - size();
|
|
||||||
iterator newStart = dataAllocator::allocate(getNewCapacity(lengthOfInsert));
|
|
||||||
iterator newFinish = TinySTL::uninitialized_copy(begin(), end(), newStart);
|
|
||||||
newFinish = TinySTL::uninitialized_fill_n(newFinish, lengthOfInsert, c);
|
|
||||||
|
|
||||||
destroyAndDeallocate();
|
|
||||||
start_ = newStart;
|
|
||||||
finish_ = newFinish;
|
|
||||||
endOfStorage_ = start_ + n;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
void string::reserve(size_t n){
|
|
||||||
if (n <= capacity())
|
|
||||||
return;
|
|
||||||
iterator newStart = dataAllocator::allocate(n);
|
|
||||||
iterator newFinish = TinySTL::uninitialized_copy(begin(), end(), newStart);
|
|
||||||
destroyAndDeallocate();
|
|
||||||
start_ = newStart;
|
|
||||||
finish_ = newFinish;
|
|
||||||
endOfStorage_ = start_ + n;
|
|
||||||
}
|
|
||||||
template <class InputIterator>
|
|
||||||
string::iterator string::insert_aux_copy(iterator p, InputIterator first, InputIterator last){
|
|
||||||
size_t lengthOfInsert = last - first;
|
|
||||||
auto newCapacity = getNewCapacity(lengthOfInsert);
|
|
||||||
iterator newStart = dataAllocator::allocate(newCapacity);
|
|
||||||
iterator newFinish = TinySTL::uninitialized_copy(start_, p, newStart);
|
|
||||||
newFinish = TinySTL::uninitialized_copy(first, last, newFinish);
|
|
||||||
auto res = newFinish;
|
|
||||||
newFinish = TinySTL::uninitialized_copy(p, finish_, newFinish);
|
|
||||||
|
|
||||||
destroyAndDeallocate();
|
|
||||||
start_ = newStart;
|
|
||||||
finish_ = newFinish;
|
|
||||||
endOfStorage_ = start_ + newCapacity;
|
|
||||||
return res;
|
|
||||||
}
|
|
||||||
template <class InputIterator>
|
|
||||||
string::iterator string::insert(iterator p, InputIterator first, InputIterator last){
|
|
||||||
auto lengthOfLeft = capacity() - size();
|
|
||||||
size_t lengthOfInsert = last - first;
|
|
||||||
if (lengthOfInsert <= lengthOfLeft){
|
|
||||||
for (iterator it = finish_ - 1; it >= p; --it){
|
|
||||||
*(it + lengthOfInsert) = *(it);
|
|
||||||
}
|
|
||||||
TinySTL::uninitialized_copy(first, last, p);
|
|
||||||
finish_ += lengthOfInsert;
|
|
||||||
return (p + lengthOfInsert);
|
|
||||||
}else{
|
|
||||||
return insert_aux_copy(p, first, last);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
string& string::insert(size_t pos, const string& str){
|
|
||||||
insert(start_ + pos, str.begin(), str.end());
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
string& string::insert(size_t pos, const string& str, size_t subpos, size_t sublen){
|
|
||||||
sublen = changeVarWhenEuqalNPOS(sublen, str.size(), subpos);
|
|
||||||
insert(begin() + pos, str.begin() + subpos, str.begin() + subpos + sublen);
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
string& string::insert(size_t pos, const char* s){
|
|
||||||
insert(begin() + pos, s, s + strlen(s));
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
string& string::insert(size_t pos, const char* s, size_t n){
|
|
||||||
insert(begin() + pos, s, s + n);
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
string::iterator string::insert_aux_filln(iterator p, size_t n, value_type c){
|
|
||||||
auto newCapacity = getNewCapacity(n);
|
|
||||||
iterator newStart = dataAllocator::allocate(newCapacity);
|
|
||||||
iterator newFinish = TinySTL::uninitialized_copy(start_, p, newStart);
|
|
||||||
newFinish = TinySTL::uninitialized_fill_n(newFinish, n, c);
|
|
||||||
auto res = newFinish;
|
|
||||||
newFinish = TinySTL::uninitialized_copy(p, finish_, newFinish);
|
|
||||||
|
|
||||||
destroyAndDeallocate();
|
|
||||||
start_ = newStart;
|
|
||||||
finish_ = newFinish;
|
|
||||||
endOfStorage_ = start_ + newCapacity;
|
|
||||||
return res;
|
|
||||||
}
|
|
||||||
string& string::insert(size_t pos, size_t n, char c){
|
|
||||||
insert(begin() + pos, n, c);
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
string::iterator string::insert(iterator p, size_t n, char c){
|
|
||||||
auto lengthOfLeft = capacity() - size();
|
|
||||||
if (n <= lengthOfLeft){
|
|
||||||
for (iterator it = finish_ - 1; it >= p; --it){
|
|
||||||
*(it + n) = *(it);
|
|
||||||
}
|
|
||||||
TinySTL::uninitialized_fill_n(p, n, c);
|
|
||||||
finish_ += n;
|
|
||||||
return (p + n);
|
|
||||||
}else{
|
|
||||||
return insert_aux_filln(p, n, c);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
string::iterator string::insert(iterator p, char c){
|
|
||||||
return insert(p, 1, c);
|
|
||||||
}
|
|
||||||
string& string::operator+= (const string& str){
|
|
||||||
insert(size(), str);
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
string& string::operator+= (const char* s){
|
|
||||||
insert(size(), s);
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
string& string::operator+= (char c){
|
|
||||||
insert(end(), c);
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
string& string::append(const string& str){
|
|
||||||
(*this) += str;
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
string& string::append(const string& str, size_t subpos, size_t sublen){
|
|
||||||
sublen = changeVarWhenEuqalNPOS(sublen, str.size(), subpos);
|
|
||||||
insert(size(), str, subpos, sublen);
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
string& string::append(const char* s){
|
|
||||||
(*this) += s;
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
string& string::append(const char* s, size_t n){
|
|
||||||
insert(size(), s, n);
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
string& string::append(size_t n, char c){
|
|
||||||
insert(end(), n, c);
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
template <class InputIterator>
|
|
||||||
string& string::append(InputIterator first, InputIterator last){
|
|
||||||
insert(end(), first, last);
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
string::iterator string::erase(iterator first, iterator last){
|
|
||||||
size_t lengthOfMove = finish_ - last;
|
|
||||||
for (auto i = 0; i != lengthOfMove; ++i){
|
|
||||||
*(first + i) = *(last + i);
|
|
||||||
}
|
|
||||||
dataAllocator::destroy(first + lengthOfMove, finish_);
|
|
||||||
finish_ = first + lengthOfMove;
|
|
||||||
return first;
|
|
||||||
|
|
||||||
}
|
|
||||||
string& string::erase(size_t pos, size_t len){
|
|
||||||
len = changeVarWhenEuqalNPOS(len, size(), pos);
|
|
||||||
erase(begin() + pos, begin() + pos + len);
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
string::iterator string::erase(iterator p){
|
|
||||||
//return erase(p, end());
|
|
||||||
//bug fix
|
|
||||||
//2014.12.24
|
|
||||||
return erase(p, p + 1);
|
|
||||||
}
|
|
||||||
template <class InputIterator>
|
|
||||||
string& string::replace(iterator i1, iterator i2,
|
|
||||||
InputIterator first, InputIterator last){
|
|
||||||
auto ptr = erase(i1, i2);
|
|
||||||
insert(ptr, first, last);
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
string& string::replace(size_t pos, size_t len, const string& str){
|
|
||||||
return replace(begin() + pos, begin() + pos + len, str.begin(), str.end());
|
|
||||||
}
|
|
||||||
string& string::replace(iterator i1, iterator i2, const string& str){
|
|
||||||
return replace(i1, i2, str.begin(), str.end());
|
|
||||||
}
|
|
||||||
string& string::replace(size_t pos, size_t len, const string& str, size_t subpos, size_t sublen){
|
|
||||||
sublen = changeVarWhenEuqalNPOS(sublen, str.size(), subpos);
|
|
||||||
return replace(begin() + pos, begin() + pos + len, str.begin() + subpos, str.begin() + subpos + sublen);
|
|
||||||
}
|
|
||||||
string& string::replace(size_t pos, size_t len, const char* s){
|
|
||||||
return replace(begin() + pos, begin() + pos + len, s, s + strlen(s));
|
|
||||||
}
|
|
||||||
string& string::replace(iterator i1, iterator i2, const char* s){
|
|
||||||
return replace(i1, i2, s, s + strlen(s));
|
|
||||||
}
|
|
||||||
string& string::replace(iterator i1, iterator i2, size_t n, char c){
|
|
||||||
auto ptr = erase(i1, i2);
|
|
||||||
insert(ptr, n, c);
|
|
||||||
return *this;
|
|
||||||
}
|
|
||||||
string& string::replace(size_t pos, size_t len, const char* s, size_t n){
|
|
||||||
return replace(begin() + pos, begin() + pos + len, s, s + n);
|
|
||||||
}
|
|
||||||
string& string::replace(iterator i1, iterator i2, const char* s, size_t n){
|
|
||||||
return replace(i1, i2, s, s + n);
|
|
||||||
}
|
|
||||||
string& string::replace(size_t pos, size_t len, size_t n, char c){
|
|
||||||
return replace(begin() + pos, begin() + pos + len, n, c);
|
|
||||||
}
|
|
||||||
size_t string::find_aux(const_iterator cit, size_t pos, size_t lengthOfS, size_t cond)const{
|
|
||||||
size_t i, j;
|
|
||||||
for (i = pos; i != cond; ++i){
|
|
||||||
for (j = 0; j != lengthOfS; ++j){
|
|
||||||
if (*(begin() + i + j) != cit[j])
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
if (j == lengthOfS)
|
|
||||||
return i;
|
|
||||||
}
|
|
||||||
return npos;
|
|
||||||
}
|
|
||||||
size_t string::find(const char* s, size_t pos, size_t n) const{
|
|
||||||
size_t lenghtOfS = strlen(s);
|
|
||||||
//if (n < lenghtOfS)
|
|
||||||
// return npos;
|
|
||||||
//return find_aux(s, pos, lenghtOfS, pos + n);
|
|
||||||
//bug fix
|
|
||||||
//2014.12.24
|
|
||||||
return find_aux(s, pos, n, size());
|
|
||||||
}
|
|
||||||
size_t string::find(const string& str, size_t pos) const{
|
|
||||||
size_t lengthOfS = str.size();
|
|
||||||
if (size() - pos < lengthOfS)
|
|
||||||
return npos;
|
|
||||||
return find_aux(str.cbegin(), pos, lengthOfS, size());
|
|
||||||
}
|
|
||||||
size_t string::find(const char* s, size_t pos) const{
|
|
||||||
//return find(s, pos, size() - pos);
|
|
||||||
//bug fix
|
|
||||||
//2014.12.24
|
|
||||||
return find(s, pos, strlen(s));
|
|
||||||
}
|
|
||||||
size_t string::find(char c, size_t pos) const{
|
|
||||||
for (auto cit = cbegin() + pos; cit != cend(); ++cit){
|
|
||||||
if (*cit == c)
|
|
||||||
return cit - cbegin();
|
|
||||||
}
|
|
||||||
return npos;
|
|
||||||
}
|
|
||||||
size_t string::rfind(char c, size_t pos) const{
|
|
||||||
pos = changeVarWhenEuqalNPOS(pos, size(), 1);
|
|
||||||
for (auto cit = cbegin() + pos; cit >= cbegin(); --cit){
|
|
||||||
if (*cit == c)
|
|
||||||
return cit - cbegin();
|
|
||||||
}
|
|
||||||
return npos;
|
|
||||||
}
|
|
||||||
size_t string::rfind_aux(const_iterator cit, size_t pos, size_t lengthOfS, int cond)const{
|
|
||||||
int i, j;
|
|
||||||
//bug fix
|
|
||||||
//2014.12.25
|
|
||||||
//for (i = pos - lengthOfS; i >= cond; --i){
|
|
||||||
for (i = pos + lengthOfS; i >= cond; --i){
|
|
||||||
for (j = 0; j != lengthOfS; ++j){
|
|
||||||
if (*(begin() + i + j) != cit[j])
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
if (j == lengthOfS)
|
|
||||||
return i;
|
|
||||||
}
|
|
||||||
return npos;
|
|
||||||
}
|
|
||||||
size_t string::rfind(const string& str, size_t pos) const{
|
|
||||||
auto lengthOfS = str.size();
|
|
||||||
//if (pos - 0 < lengthOfS)
|
|
||||||
// return npos;
|
|
||||||
pos = changeVarWhenEuqalNPOS(pos, size(), 1);
|
|
||||||
return rfind_aux(str.begin(), pos, lengthOfS, 0);
|
|
||||||
}
|
|
||||||
size_t string::rfind(const char* s, size_t pos) const{
|
|
||||||
pos = changeVarWhenEuqalNPOS(pos, size(), 1);
|
|
||||||
return rfind(s, pos, strlen(s));
|
|
||||||
}
|
|
||||||
size_t string::rfind(const char* s, size_t pos, size_t n) const{
|
|
||||||
auto lengthOfS = strlen(s);
|
|
||||||
//if (n < lengthOfS)
|
|
||||||
// return npos;
|
|
||||||
return rfind_aux(s, pos, n, 0);
|
|
||||||
}
|
|
||||||
int string::compare(const string& str) const{
|
|
||||||
return compare(0, size(), str, 0, str.size());
|
|
||||||
}
|
|
||||||
int string::compare(size_t pos, size_t len, const string& str) const{
|
|
||||||
return compare(pos, len, str, 0, str.size());
|
|
||||||
}
|
|
||||||
int string::compare_aux(size_t pos, size_t len, const_iterator cit, size_t subpos, size_t sublen)const{
|
|
||||||
size_t i, j;
|
|
||||||
for (i = 0, j = 0; i != len && j != sublen; ++i, ++j){
|
|
||||||
if ((*this)[pos + i] < cit[subpos + j])
|
|
||||||
return -1;
|
|
||||||
else if ((*this)[pos + i] > cit[subpos + j])
|
|
||||||
return 1;
|
|
||||||
}
|
|
||||||
if (i == len && j == sublen)
|
|
||||||
return 0;
|
|
||||||
else if (i == len)
|
|
||||||
return -1;
|
|
||||||
else
|
|
||||||
return 1;
|
|
||||||
}
|
|
||||||
int string::compare(size_t pos, size_t len, const string& str, size_t subpos, size_t sublen) const{
|
|
||||||
return compare_aux(pos, len, str.begin(), subpos, sublen);
|
|
||||||
}
|
|
||||||
int string::compare(const char* s) const{
|
|
||||||
return compare(0, size(), s, strlen(s));
|
|
||||||
}
|
|
||||||
int string::compare(size_t pos, size_t len, const char* s) const{
|
|
||||||
return compare(pos, len, s, strlen(s));
|
|
||||||
}
|
|
||||||
int string::compare(size_t pos, size_t len, const char* s, size_t n) const{
|
|
||||||
return compare_aux(pos, len, s, 0, n);
|
|
||||||
}
|
|
||||||
size_t string::find_first_of(const string& str, size_t pos) const{
|
|
||||||
//return find_first_of(str.begin(), pos, size() - pos);
|
|
||||||
return find_first_of(str.begin(), pos, str.size());
|
|
||||||
}
|
|
||||||
size_t string::find_first_of(const char* s, size_t pos) const{
|
|
||||||
//return find_first_of(s, pos, size() - pos);
|
|
||||||
return find_first_of(s, pos, strlen(s));
|
|
||||||
}
|
|
||||||
size_t string::find_first_of(const char* s, size_t pos, size_t n) const{
|
|
||||||
//for (size_t i = pos; i != pos + n; ++i){
|
|
||||||
// if (isContained((*this)[i], s, s + strlen(s)))
|
|
||||||
// return i;
|
|
||||||
//}
|
|
||||||
//bug fix
|
|
||||||
//2014.12.25
|
|
||||||
for (size_t i = pos; i != size(); ++i){
|
|
||||||
if (isContained((*this)[i], s, s + n))
|
|
||||||
return i;
|
|
||||||
}
|
|
||||||
return npos;
|
|
||||||
}
|
|
||||||
size_t string::find_first_of(char c, size_t pos) const{
|
|
||||||
return find(c, pos);
|
|
||||||
}
|
|
||||||
size_t string::find_first_not_of(const string& str, size_t pos) const{
|
|
||||||
//return find_first_not_of(str.begin(), pos, size() - pos);
|
|
||||||
return find_first_not_of(str.begin(), pos, str.size());
|
|
||||||
}
|
|
||||||
size_t string::find_first_not_of(const char* s, size_t pos) const{
|
|
||||||
//return find_first_not_of(s, pos, size() - pos);
|
|
||||||
return find_first_not_of(s, pos, strlen(s));
|
|
||||||
}
|
|
||||||
size_t string::find_first_not_of(const char* s, size_t pos, size_t n) const{
|
|
||||||
/*for (size_t i = pos; i != pos + n; ++i){
|
|
||||||
if (!isContained((*this)[i], s, s + strlen(s)))
|
|
||||||
return i;
|
|
||||||
}*/
|
|
||||||
for (size_t i = pos; i != size(); ++i){
|
|
||||||
if (!isContained((*this)[i], s, s + n))
|
|
||||||
return i;
|
|
||||||
}
|
|
||||||
return npos;
|
|
||||||
}
|
|
||||||
size_t string::find_first_not_of(char c, size_t pos) const{
|
|
||||||
for (size_t i = pos; i != size(); ++i){
|
|
||||||
if ((*this)[i] != c)
|
|
||||||
return i;
|
|
||||||
}
|
|
||||||
return npos;
|
|
||||||
}
|
|
||||||
size_t string::find_last_of(const string& str, size_t pos) const{
|
|
||||||
pos = changeVarWhenEuqalNPOS(pos, size(), 1);
|
|
||||||
//return find_last_of(str.begin(), pos, pos + 1);
|
|
||||||
return find_last_of(str.begin(), pos, str.size());
|
|
||||||
}
|
|
||||||
size_t string::find_last_of(const char* s, size_t pos) const{
|
|
||||||
pos = changeVarWhenEuqalNPOS(pos, size(), 1);
|
|
||||||
//return find_last_of(s, pos, pos + 1);
|
|
||||||
return find_last_of(s, pos, strlen(s));
|
|
||||||
}
|
|
||||||
size_t string::find_last_of(const char* s, size_t pos, size_t n) const{
|
|
||||||
/*for (size_t i = pos, j = 0; i >= 0 && j != n; --i, ++j){
|
|
||||||
if (isContained((*this)[i], s, s + strlen(s)))
|
|
||||||
return i;
|
|
||||||
}*/
|
|
||||||
//bug fix
|
|
||||||
//2014.12.25
|
|
||||||
for (size_t i = pos; i > 0; --i){
|
|
||||||
if (isContained((*this)[i], s, s + n))
|
|
||||||
return i;
|
|
||||||
}
|
|
||||||
return npos;
|
|
||||||
}
|
|
||||||
size_t string::find_last_of(char c, size_t pos) const{
|
|
||||||
return rfind(c, pos);
|
|
||||||
}
|
|
||||||
size_t string::find_last_not_of(const string& str, size_t pos) const{
|
|
||||||
pos = changeVarWhenEuqalNPOS(pos, size(), 1);
|
|
||||||
//return find_last_not_of(str.begin(), pos, size());
|
|
||||||
return find_last_not_of(str.begin(), pos, str.size());
|
|
||||||
}
|
|
||||||
size_t string::find_last_not_of(const char* s, size_t pos) const{
|
|
||||||
pos = changeVarWhenEuqalNPOS(pos, size(), 1);
|
|
||||||
//return find_last_not_of(s, pos, pos + 1);
|
|
||||||
return find_last_not_of(s, pos, strlen(s));
|
|
||||||
}
|
|
||||||
size_t string::find_last_not_of(const char* s, size_t pos, size_t n) const{
|
|
||||||
/*for (size_t i = pos, j = 0; i >= 0 && j != n; --i, ++j){
|
|
||||||
if (!isContained((*this)[i], s, s + strlen(s)))
|
|
||||||
return i;
|
|
||||||
}*/
|
|
||||||
//bug fix
|
|
||||||
//2014.12.24
|
|
||||||
for (size_t i = pos; i >= 0; --i){
|
|
||||||
if (!isContained((*this)[i], s, s + n))
|
|
||||||
return i;
|
|
||||||
}
|
|
||||||
return npos;
|
|
||||||
}
|
|
||||||
size_t string::find_last_not_of(char c, size_t pos) const{
|
|
||||||
pos = changeVarWhenEuqalNPOS(pos, size(), 1);
|
|
||||||
for (int i = pos; i >= 0; --i){
|
|
||||||
if ((*this)[i] != c)
|
|
||||||
return i;
|
|
||||||
}
|
|
||||||
return npos;
|
|
||||||
}
|
|
||||||
std::ostream& operator <<(std::ostream& os, const string&str){
|
|
||||||
for (const auto ch : str){
|
|
||||||
os << ch;
|
|
||||||
}
|
|
||||||
return os;
|
|
||||||
}
|
|
||||||
std::istream& operator >> (std::istream& is, string& str){
|
|
||||||
char ch;
|
|
||||||
string::size_type oldSize = str.size(), index = 0;
|
|
||||||
bool hasPrevBlank = false;
|
|
||||||
while (is.get(ch)){//<2F><><EFBFBD><EFBFBD>ǰ<EFBFBD><C7B0><EFBFBD>հ<EFBFBD>
|
|
||||||
if (isblank(ch) || ch == '\n')
|
|
||||||
hasPrevBlank = true;
|
|
||||||
else
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
is.putback(ch);
|
|
||||||
str.clear();
|
|
||||||
while (is.get(ch)){
|
|
||||||
if (ch != EOF && !isblank(ch) && ch != '\n'){
|
|
||||||
str.push_back(ch);
|
|
||||||
}else
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
return is;
|
|
||||||
}
|
|
||||||
std::istream& getline(std::istream& is, string& str, char delim){
|
|
||||||
char ch;
|
|
||||||
str.clear();
|
|
||||||
while (is.get(ch)){
|
|
||||||
if (ch == delim)
|
|
||||||
break;
|
|
||||||
else
|
|
||||||
str.push_back(ch);
|
|
||||||
}
|
|
||||||
return is;
|
|
||||||
}
|
|
||||||
std::istream& getline(std::istream& is, string& str){
|
|
||||||
return getline(is, str, '\n');
|
|
||||||
}
|
|
||||||
string operator+ (const string& lhs, const string& rhs){
|
|
||||||
string res(lhs);
|
|
||||||
return res += rhs;
|
|
||||||
}
|
|
||||||
string operator+ (const string& lhs, const char* rhs){
|
|
||||||
string res(lhs);
|
|
||||||
return res += rhs;
|
|
||||||
}
|
|
||||||
string operator+ (const char* lhs, const string& rhs){
|
|
||||||
string res(lhs);
|
|
||||||
return res += rhs;
|
|
||||||
}
|
|
||||||
string operator+ (const string& lhs, char rhs){
|
|
||||||
string res(lhs);
|
|
||||||
return res += rhs;
|
|
||||||
}
|
|
||||||
string operator+ (char lhs, const string& rhs){
|
|
||||||
string res(1, lhs);
|
|
||||||
return res += rhs;
|
|
||||||
}
|
|
||||||
bool operator== (const string& lhs, const string& rhs){
|
|
||||||
if (lhs.size() == rhs.size()){
|
|
||||||
for (auto cit1 = lhs.cbegin(), cit2 = rhs.cbegin();
|
|
||||||
cit1 != lhs.cend() && cit2 != rhs.cend();
|
|
||||||
++cit1, ++cit2){
|
|
||||||
if (*cit1 != *cit2)
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
bool operator== (const char* lhs, const string& rhs){
|
|
||||||
return rhs == lhs;
|
|
||||||
}
|
|
||||||
bool operator== (const string& lhs, const char* rhs){
|
|
||||||
size_t len = strlen(rhs);
|
|
||||||
if (lhs.size() == len){
|
|
||||||
const char *p = rhs;
|
|
||||||
for (string::const_iterator cit = lhs.cbegin();
|
|
||||||
cit != lhs.cend() && p != rhs + len;
|
|
||||||
++cit, ++p){
|
|
||||||
if (*cit != *p)
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
bool operator!= (const string& lhs, const string& rhs){
|
|
||||||
return !(lhs == rhs);
|
|
||||||
}
|
|
||||||
bool operator!= (const char* lhs, const string& rhs){
|
|
||||||
return !(lhs == rhs);
|
|
||||||
}
|
|
||||||
bool operator!= (const string& lhs, const char* rhs){
|
|
||||||
return !(lhs == rhs);
|
|
||||||
}
|
|
||||||
bool operator< (const string& lhs, const string& rhs){
|
|
||||||
return !(lhs >= rhs);
|
|
||||||
}
|
|
||||||
bool operator< (const char* lhs, const string& rhs){
|
|
||||||
return !(lhs >= rhs);
|
|
||||||
}
|
|
||||||
bool operator< (const string& lhs, const char* rhs){
|
|
||||||
return !(lhs >= rhs);
|
|
||||||
}
|
|
||||||
|
|
||||||
namespace{
|
|
||||||
template<class Iterator1, class Iterator2>
|
|
||||||
bool lessEqual_aux(Iterator1 first1, Iterator1 last1, Iterator2 first2, Iterator2 last2){
|
|
||||||
for (; first1 != last1 && first2 != last2; ++first1, ++first2){
|
|
||||||
if (*first1 < *first2)
|
|
||||||
return true;
|
|
||||||
else if (*first1 > *first2)
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
if ((first1 == last1 && first2 == last2)// ==
|
|
||||||
|| (first1 == last1))// <
|
|
||||||
return true;
|
|
||||||
else
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
bool operator<= (const string& lhs, const string& rhs){
|
|
||||||
return lessEqual_aux(lhs.cbegin(), lhs.cend(), rhs.cbegin(), rhs.cend());
|
|
||||||
}
|
|
||||||
bool operator<= (const char* lhs, const string& rhs){
|
|
||||||
return lessEqual_aux(lhs, lhs + strlen(lhs), rhs.cbegin(), rhs.cend());
|
|
||||||
}
|
|
||||||
bool operator<= (const string& lhs, const char* rhs){
|
|
||||||
return lessEqual_aux(lhs.cbegin(), lhs.cend(), rhs, rhs + strlen(rhs));
|
|
||||||
}
|
|
||||||
bool operator> (const string& lhs, const string& rhs){
|
|
||||||
return !(lhs <= rhs);
|
|
||||||
}
|
|
||||||
bool operator> (const char* lhs, const string& rhs){
|
|
||||||
return !(lhs <= rhs);
|
|
||||||
}
|
|
||||||
bool operator> (const string& lhs, const char* rhs){
|
|
||||||
return !(lhs <= rhs);
|
|
||||||
}
|
|
||||||
namespace{
|
|
||||||
template<class Iterator1, class Iterator2>
|
|
||||||
bool greaterEqual_aux(Iterator1 first1, Iterator1 last1, Iterator2 first2, Iterator2 last2){
|
|
||||||
for (; first1 != last1 && first2 != last2; ++first1, ++first2){
|
|
||||||
if (*first1 > *first2)
|
|
||||||
return true;
|
|
||||||
else if (*first1 < *first2)
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
if ((first1 == last1 && first2 == last2)// ==
|
|
||||||
|| (first2 == last2))// >
|
|
||||||
return true;
|
|
||||||
else
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
bool operator>= (const string& lhs, const string& rhs){
|
|
||||||
return greaterEqual_aux(lhs.cbegin(), lhs.cend(), rhs.cbegin(), rhs.cend());
|
|
||||||
}
|
|
||||||
bool operator>= (const char* lhs, const string& rhs){
|
|
||||||
return greaterEqual_aux(lhs, lhs + strlen(lhs), rhs.cbegin(), rhs.cend());
|
|
||||||
}
|
|
||||||
bool operator>= (const string& lhs, const char* rhs){
|
|
||||||
return greaterEqual_aux(lhs.cbegin(), lhs.cend(), rhs, rhs + strlen(rhs));
|
|
||||||
}
|
|
||||||
void swap(string& x, string& y){
|
|
||||||
x.swap(y);
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
#endif
|
#endif
|
||||||
@@ -82,6 +82,7 @@
|
|||||||
<ClCompile Include="Alloc.cpp" />
|
<ClCompile Include="Alloc.cpp" />
|
||||||
<ClCompile Include="main.cpp" />
|
<ClCompile Include="main.cpp" />
|
||||||
<ClCompile Include="Profiler\Profiler.cpp" />
|
<ClCompile Include="Profiler\Profiler.cpp" />
|
||||||
|
<ClCompile Include="String.cpp" />
|
||||||
<ClCompile Include="Test\AlgorithmTest.cpp" />
|
<ClCompile Include="Test\AlgorithmTest.cpp" />
|
||||||
<ClCompile Include="Test\BitmapTest.cpp" />
|
<ClCompile Include="Test\BitmapTest.cpp" />
|
||||||
<ClCompile Include="Test\CircularBufferTest.cpp" />
|
<ClCompile Include="Test\CircularBufferTest.cpp" />
|
||||||
|
|||||||
@@ -63,6 +63,9 @@
|
|||||||
<ClCompile Include="Alloc.cpp">
|
<ClCompile Include="Alloc.cpp">
|
||||||
<Filter>头文件</Filter>
|
<Filter>头文件</Filter>
|
||||||
</ClCompile>
|
</ClCompile>
|
||||||
|
<ClCompile Include="String.cpp">
|
||||||
|
<Filter>头文件</Filter>
|
||||||
|
</ClCompile>
|
||||||
</ItemGroup>
|
</ItemGroup>
|
||||||
<ItemGroup>
|
<ItemGroup>
|
||||||
<ClInclude Include="TypeTraits.h">
|
<ClInclude Include="TypeTraits.h">
|
||||||
|
|||||||
Reference in New Issue
Block a user