RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-23 19:23:23 +01:00
Code Issues Projects Releases Wiki Activity

Move the implementation of StringRef::split out of StringExtras.cpp

Browse Source 
and into StringRef.cpp, which is where the other StringRef stuff is.

llvm-svn: 151054
This commit is contained in:
Duncan Sands 2012-02-21 12:00:25 +00:00
parent 0fac05f8e2
commit cb8147cfe5
2 changed files with 21 additions and 21 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
lib/Support/StringExtras.cpp
View File

@ -57,24 +57,3 @@ void llvm::SplitString(StringRef Source,
S = getToken(S.second, Delimiters);
}
}
void llvm::StringRef::split(SmallVectorImpl<StringRef> &A,
StringRef Separators, int MaxSplit,
bool KeepEmpty) const {
StringRef rest = *this;
// rest.data() is used to distinguish cases like "a," that splits into
// "a" + "" and "a" that splits into "a" + 0.
for (int splits = 0;
rest.data() != NULL && (MaxSplit < 0 || splits < MaxSplit);
++splits) {
std::pair<llvm::StringRef, llvm::StringRef> p = rest.split(Separators);
if (p.first.size() != 0 || KeepEmpty)
A.push_back(p.first);
rest = p.second;
}
// If we have a tail left, add it.
if (rest.data() != NULL && (rest.size() != 0 || KeepEmpty))
A.push_back(rest);
}

21
lib/Support/StringRef.cpp
View File

@ -229,6 +229,27 @@ StringRef::size_type StringRef::find_last_of(StringRef Chars,
return npos;
}
void StringRef::split(SmallVectorImpl<StringRef> &A,
StringRef Separators, int MaxSplit,
bool KeepEmpty) const {
StringRef rest = *this;
// rest.data() is used to distinguish cases like "a," that splits into
// "a" + "" and "a" that splits into "a" + 0.
for (int splits = 0;
rest.data() != NULL && (MaxSplit < 0 || splits < MaxSplit);
++splits) {
std::pair<StringRef, StringRef> p = rest.split(Separators);
if (p.first.size() != 0 || KeepEmpty)
A.push_back(p.first);
rest = p.second;
}
// If we have a tail left, add it.
if (rest.data() != NULL && (rest.size() != 0 || KeepEmpty))
A.push_back(rest);
}
//===----------------------------------------------------------------------===//
// Helpful Algorithms
//===----------------------------------------------------------------------===//