projects
/
oota-llvm.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
| inline |
side by side
(parent:
73c6031
)
DeltaAlgorithm: Tweak split to split by first/second half instead of even/odd, since...
author
Daniel Dunbar
<daniel@zuster.org>
Tue, 8 Jun 2010 16:21:26 +0000
(16:21 +0000)
committer
Daniel Dunbar
<daniel@zuster.org>
Tue, 8 Jun 2010 16:21:26 +0000
(16:21 +0000)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@105613
91177308
-0d34-0410-b5e6-
96231b3b80d8
lib/Support/DeltaAlgorithm.cpp
patch
|
blob
|
history
diff --git
a/lib/Support/DeltaAlgorithm.cpp
b/lib/Support/DeltaAlgorithm.cpp
index d176548189191e5f93ea4ded9e82b76c89f3cebb..9e52874de832689a8b5c71d554edb1d2f3977a3f 100644
(file)
--- a/
lib/Support/DeltaAlgorithm.cpp
+++ b/
lib/Support/DeltaAlgorithm.cpp
@@
-30,10
+30,10
@@
void DeltaAlgorithm::Split(const changeset_ty &S, changesetlist_ty &Res) {
// FIXME: This is really slow.
changeset_ty LHS, RHS;
- unsigned idx = 0;
+ unsigned idx = 0
, N = S.size() / 2
;
for (changeset_ty::const_iterator it = S.begin(),
ie = S.end(); it != ie; ++it, ++idx)
- ((idx
& 1
) ? LHS : RHS).insert(*it);
+ ((idx
< N
) ? LHS : RHS).insert(*it);
if (!LHS.empty())
Res.push_back(LHS);
if (!RHS.empty())