Sequential keys go badly with findLatest

2 files changed, 7 insertions, 1 deletions

diff --git a/common/storage.h b/common/storage.h
index ac03947..663d192 100644
--- a/common/storage.h
+++ b/common/storage.h
@@ -86,6 +86,12 @@ public:
                     const std::function<bool(const QByteArray &key, const QByteArray &value)> &resultHandler,
                     const std::function<void(const Storage::Error &error)> &errorHandler = std::function<void(const Storage::Error &error)>(), bool findSubstringKeys = false) const;
 
+        /**
+         * Finds the last value in a series matched by prefix.
+         *
+         * This is used to match by uid prefix and find the highest revision.
+         * Note that this relies on a key scheme like $uid$revision.
+         */
         void findLatest(const QByteArray &uid,
                         const std::function<void(const QByteArray &key, const QByteArray &value)> &resultHandler,
                         const std::function<void(const Storage::Error &error)> &errorHandler = std::function<void(const Storage::Error &error)>()) const;
diff --git a/tests/databasepopulationandfacadequerybenchmark.cpp b/tests/databasepopulationandfacadequerybenchmark.cpp
index 63daebc..7df38ba 100644
--- a/tests/databasepopulationandfacadequerybenchmark.cpp
+++ b/tests/databasepopulationandfacadequerybenchmark.cpp
@@ -58,7 +58,7 @@ class DatabasePopulationAndFacadeQueryBenchmark : public QObject
                 flatbuffers::FlatBufferBuilder fbb;
                 domainTypeAdaptorFactory->createBuffer(*domainObject, fbb);
                 const auto buffer = QByteArray::fromRawData(reinterpret_cast<const char*>(fbb.GetBufferPointer()), fbb.GetSize());
-                const auto key = QString::number(i).toLatin1();
+                const auto key = QUuid::createUuid().toString().toLatin1();
                 db.write(key, buffer);
                 bufferSizeTotal += buffer.size();
                 keysSizeTotal += key.size();