steven/TinySTL
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

完成find、rfind

Browse Source
This commit is contained in:
邹晓航
2014-10-10 17:20:17 +08:00
parent 900120977e
commit 66794c1e7b
1 changed files with 71 additions and 28 deletions
Download Patch File Download Diff File Expand all files Collapse all files

87
TinySTL/String.h
View File

@@ -199,6 +199,10 @@ namespace TinySTL{
dataAllocator::destroy(start_, finish_); dataAllocator::destroy(start_, finish_);
dataAllocator::deallocate(start_, endOfStorage_ - start_); dataAllocator::deallocate(start_, endOfStorage_ - start_);
} }
size_t rfind_aux(const_iterator cit, size_t pos, size_t lengthOfS, size_t cond)const;
size_t find_aux(const_iterator cit, size_t pos, size_t lengthOfS, size_t cond)const;
public:
friend std::ostream& operator <<(std::ostream& os, const string&str);
};// end of string };// end of string
const size_t string::npos; const size_t string::npos;
@@ -445,39 +449,78 @@ namespace TinySTL{
string& string::replace(size_t pos, size_t len, size_t n, char c){ string& string::replace(size_t pos, size_t len, size_t n, char c){
return replace(begin() + pos, begin() + pos + len, n, c); return replace(begin() + pos, begin() + pos + len, n, c);
} }
/*size_t string::find(const char* s, size_t pos, size_t n) const{ 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); size_t lenghtOfS = strlen(s);
if (n < lenghtOfS) if (n < lenghtOfS)
return npos; return npos;
int i, j; return find_aux(s, pos, lenghtOfS, pos + n);
size_t res = 0;
for (i = pos; i != pos + n; ++i){
for (j = 0; j != lenghtOfS; ++j){
if (*(begin() + i + j) != s[j])
break;
} }
if (j == lenghtOfS)
return i;
}
return npos;
}*/
size_t string::find(const string& str, size_t pos) const{ size_t string::find(const string& str, size_t pos) const{
size_t lenghtOfS = str.size(); size_t lengthOfS = str.size();
if (size() - pos < lenghtOfS) if (size() - pos < lengthOfS)
return npos; return npos;
int i, j; return find_aux(str.cbegin(), pos, lengthOfS, size());
size_t res = 0; }
for (i = pos; i != size(); ++i){ size_t string::find(const char* s, size_t pos) const{
for (j = 0; j != lenghtOfS; ++j){ return find(s, pos, size() - pos);
if (*(begin() + i + j) != str[j]) }
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{
for (auto crit = crbegin() + pos; crit != crend(); ++crit){
if (*crit == c)
return crit - crbegin();
}
return npos;
}
size_t string::rfind_aux(const_iterator cit, size_t pos, size_t lengthOfS, size_t cond)const{
size_t i, j;
for (i = pos - lengthOfS; i >= cond; --i){
for (j = 0; j != lengthOfS; ++j){
if (*(begin() + i + j) != cit[j])
break; break;
} }
if (j == lenghtOfS) if (j == lengthOfS)
return i; return i;
} }
return npos; return npos;
} }
/*size_t string::find(const char* s, size_t pos) const; size_t string::rfind(const string& str, size_t pos) const{
size_t string::find(char c, size_t pos) const;*/ auto lengthOfS = str.size();
if (pos - 0 < lengthOfS)
return npos;
return rfind_aux(str.begin(), pos, lengthOfS, 0);
}
size_t string::rfind(const char* s, size_t pos) const{
return rfind(s, pos, pos);
}
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, lengthOfS, pos - n);
}
std::ostream& operator <<(std::ostream& os, const string&str){
for (const auto ch : str)
os << ch;
return os;
}
} }
#endif #endif