diff options
| -rw-r--r-- | lib/Support/DeltaAlgorithm.cpp | 14 |
1 files changed, 8 insertions, 6 deletions
diff --git a/lib/Support/DeltaAlgorithm.cpp b/lib/Support/DeltaAlgorithm.cpp index 9e52874..a1e3311 100644 --- a/lib/Support/DeltaAlgorithm.cpp +++ b/lib/Support/DeltaAlgorithm.cpp @@ -27,13 +27,15 @@ 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()) |