83 lines
1.9 KiB
C++
83 lines
1.9 KiB
C++
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4; fill-column: 100 -*- */
|
||
|
/*
|
||
|
* 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/.
|
||
|
*/
|
||
|
|
||
|
#ifndef INCLUDED_MESSAGEQUEUE_HPP
|
||
|
#define INCLUDED_MESSAGEQUEUE_HPP
|
||
|
|
||
|
#include "config.h"
|
||
|
|
||
|
#include <condition_variable>
|
||
|
#include <mutex>
|
||
|
#include <deque>
|
||
|
|
||
|
/** Thread-safe message queue (FIFO).
|
||
|
*/
|
||
|
class MessageQueue
|
||
|
{
|
||
|
public:
|
||
|
MessageQueue() {}
|
||
|
virtual ~MessageQueue();
|
||
|
|
||
|
MessageQueue(const MessageQueue&) = delete;
|
||
|
MessageQueue& operator=(const MessageQueue&) = delete;
|
||
|
|
||
|
/// Thread safe insert the message.
|
||
|
void put(const std::string& value);
|
||
|
|
||
|
/// Thread safe obtaining of the message.
|
||
|
std::string get();
|
||
|
|
||
|
/// Thread safe removal of all the pending messages.
|
||
|
void clear();
|
||
|
|
||
|
private:
|
||
|
std::mutex _mutex;
|
||
|
std::condition_variable _cv;
|
||
|
|
||
|
protected:
|
||
|
virtual void put_impl(const std::string& value);
|
||
|
|
||
|
virtual bool wait_impl() const;
|
||
|
|
||
|
virtual std::string get_impl();
|
||
|
|
||
|
virtual void clear_impl();
|
||
|
|
||
|
std::deque<std::string> _queue;
|
||
|
};
|
||
|
|
||
|
/** MessageQueue specialized for handling of tiles.
|
||
|
|
||
|
Used for basic handling of incoming requests, only can remove tiles when it
|
||
|
gets a "canceltiles" command.
|
||
|
*/
|
||
|
class BasicTileQueue : public MessageQueue
|
||
|
{
|
||
|
protected:
|
||
|
virtual void put_impl(const std::string& value);
|
||
|
};
|
||
|
|
||
|
/** MessageQueue specialized for priority handling of tiles.
|
||
|
|
||
|
This class builds on BasicTileQueuee, and additonaly provides de-duplication
|
||
|
of tile requests.
|
||
|
|
||
|
TODO: we'll need to add reordering of the tiles at some stage here too - so
|
||
|
that the ones closest to the cursor position are returned first.
|
||
|
*/
|
||
|
class TileQueue : public BasicTileQueue
|
||
|
{
|
||
|
protected:
|
||
|
virtual void put_impl(const std::string& value);
|
||
|
};
|
||
|
|
||
|
#endif
|
||
|
|
||
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|