RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2024-11-24 12:19:53 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Revert r171829 "Split changeset_ty using iterators instead of loops" as it breaks the VS2008 build

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@172411 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Timur Iskhodzhanov 2013-01-14 14:13:06 +00:00
parent 29344a6349
commit 800ec3da7a
1 changed files with 6 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
lib/Support/DeltaAlgorithm.cpp
View File

@ -27,15 +27,13 @@ bool DeltaAlgorithm::GetTestResult(const changeset_ty &Changes) {
void DeltaAlgorithm::Split(const changeset_ty &S, changesetlist_ty &Res) {
// FIXME: Allow clients to provide heuristics for improved splitting.
// Get the iterator to the middle.
unsigned N = S.size() / 2;
changeset_ty::iterator middle(S.begin());
std::advance(middle, N);
// Create each vector using the middle as the split.
changeset_ty LHS(S.begin(), middle);
changeset_ty RHS(middle, S.end());
// FIXME: This is really slow.
changeset_ty LHS, RHS;
unsigned idx = 0, N = S.size() / 2;
for (changeset_ty::const_iterator it = S.begin(),
ie = S.end(); it != ie; ++it, ++idx)
((idx < N) ? LHS : RHS).insert(*it);
if (!LHS.empty())
Res.push_back(LHS);
if (!RHS.empty())