Add findAllInRange function in the storage layer

Summary:
In preparation of the support for ranged queries.

Notes:

Since they are pretty similar, it could be nice to refactor `scan` and `findAllInRange` to use common 3rd function

Test Plan: This is tested in storagetest.cpp

Reviewers: cmollekopf

Tags: #sink

Differential Revision: https://phabricator.kde.org/D13066

1 files changed, 9 insertions, 0 deletions

diff --git a/common/storage.h b/common/storage.h
index bb8c1fa..a8c486c 100644
--- a/common/storage.h
+++ b/common/storage.h
@@ -109,6 +109,15 @@ public:
             const std::function<void(const DataStore::Error &error)> &errorHandler = std::function<void(const DataStore::Error &error)>()) const;
 
         /**
+         * Finds all the keys and values whose keys are in a given range
+         * (inclusive).
+         */
+        int findAllInRange(const QByteArray &lowerBound, const QByteArray &upperBound,
+            const std::function<void(const QByteArray &key, const QByteArray &value)> &resultHandler,
+            const std::function<void(const DataStore::Error &error)> &errorHandler =
+                std::function<void(const DataStore::Error &error)>()) const;
+
+        /**
          * Returns true if the database contains the substring key.
          */
         bool contains(const QByteArray &uid);