Optimized the incremental update case.

This brings the incremental closer to a regular query (about 1.5 times
as bad instead of 3.5 times).
For a comparison look at MailQueryBenchmark::testIncremental()

The optimization is built on the assumption that we i.e. get an update
with 100 revisions, and thus the optimization applies to the case where
we have multiple revisions within that batch that are part of the same
reduction. In such a case we can avoid redoing the reduction lookup over
and over.

1 files changed, 3 insertions, 1 deletions

diff --git a/common/datastorequery.h b/common/datastorequery.h
index de4ae26..cc501e6 100644
--- a/common/datastorequery.h
+++ b/common/datastorequery.h
@@ -107,11 +107,13 @@ public:
         return mDatastore->indexLookup(property, value);
     }
 
-    virtual void skip() { mSource->skip(); };
+    virtual void skip() { mSource->skip(); }
 
     //Returns true for as long as a result is available
     virtual bool next(const std::function<void(const ResultSet::Result &)> &callback) = 0;
 
+    virtual void updateComplete() { }
+
     FilterBase::Ptr mSource;
     DataStoreQuery *mDatastore;
     bool mIncremental = false;