1 files changed, 98 insertions, 0 deletions
diff --git a/sd/source/ui/slidesorter/cache/SlsQueueProcessor.hxx b/sd/source/ui/slidesorter/cache/SlsQueueProcessor.hxx
new file mode 100644
index 0000000000..70ea8d5b3e
--- /dev/null
+++ b/sd/source/ui/slidesorter/cache/SlsQueueProcessor.hxx
@@ -0,0 +1,98 @@
+/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
+/*
+ * This file is part of the LibreOffice project.
+ *
+ * This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at http://mozilla.org/MPL/2.0/.
+ *
+ * This file incorporates work covered by the following license notice:
+ *
+ *   Licensed to the Apache Software Foundation (ASF) under one or more
+ *   contributor license agreements. See the NOTICE file distributed
+ *   with this work for additional information regarding copyright
+ *   ownership. The ASF licenses this file to you under the Apache
+ *   License, Version 2.0 (the "License"); you may not use this file
+ *   except in compliance with the License. You may obtain a copy of
+ *   the License at http://www.apache.org/licenses/LICENSE-2.0 .
+ */
+
+#pragma once
+
+#include <cache/SlsCacheContext.hxx>
+#include "SlsRequestPriorityClass.hxx"
+#include "SlsBitmapFactory.hxx"
+
+#include <vcl/timer.hxx>
+#include <mutex>
+
+namespace sd::slidesorter::cache {
+
+class BitmapCache;
+class RequestQueue;
+
+/** This queue processor is timer based, i.e. when an entry is added to the
+    queue and the processor is started with Start() in the base class a
+    timer is started that eventually calls ProcessRequest().  This is
+    repeated until the queue is empty or Stop() is called.
+*/
+class QueueProcessor final
+{
+public:
+    QueueProcessor (
+        RequestQueue& rQueue,
+        std::shared_ptr<BitmapCache> pCache,
+        const Size& rPreviewSize,
+        const bool bDoSuperSampling,
+        SharedCacheContext pCacheContext);
+    ~QueueProcessor();
+
+    /** Start the processor.  This implementation is timer based and waits
+        a defined amount of time that depends on the given argument before
+        the next entry in the queue is processed.
+        @param nPriorityClass
+            A priority class of 0 tells the processor that a high priority
+            request is waiting in the queue.  The time to wait is thus
+            shorter then that for a low priority request (denoted by a value
+            of 1.)  When the timer is already running it is not modified.
+    */
+    void Start (int nPriorityClass);
+    void Stop();
+    void Pause();
+    void Resume();
+
+    void SetPreviewSize (
+        const Size& rSize,
+        const bool bDoSuperSampling);
+
+    /** Use this method when the page cache is (maybe) using a different
+        BitmapCache.  This is usually necessary after calling
+        PageCacheManager::ChangeSize().
+    */
+    void SetBitmapCache (const std::shared_ptr<BitmapCache>& rpCache);
+
+private:
+    /** This mutex is used to guard the queue processor.  Be careful not to
+        mix its use with that of the solar mutex.
+    */
+    std::mutex maMutex;
+
+    Timer  maTimer;
+    DECL_LINK(ProcessRequestHdl, Timer *, void);
+    Size maPreviewSize;
+    bool mbDoSuperSampling;
+    SharedCacheContext mpCacheContext;
+    RequestQueue& mrQueue;
+    std::shared_ptr<BitmapCache> mpCache;
+    BitmapFactory maBitmapFactory;
+    bool mbIsPaused;
+
+    void ProcessRequests();
+    void ProcessOneRequest (
+        CacheKey aKey,
+        const RequestPriorityClass ePriorityClass);
+};
+
+} // end of namespace ::sd::slidesorter::cache
+
+/* vim:set shiftwidth=4 softtabstop=4 expandtab: */