-
Notifications
You must be signed in to change notification settings - Fork 0
/
Queue.hpp
68 lines (50 loc) · 1.54 KB
/
Queue.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
#pragma once
#include <queue>
#include <thread>
#include <mutex>
#include <condition_variable>
#include <boost/optional.hpp>
namespace beton {
/// A simple thread-safe queue.
template <typename T>
class Queue {
std::queue<T> queue;
std::mutex mutex;
std::condition_variable condition;
public:
Queue() = default;
Queue(const Queue&) = delete; // disable copying
Queue& operator=(const Queue&) = delete; // disable assignment
T pop() {
std::unique_lock<std::mutex> lock(mutex);
while (queue.empty()) {
condition.wait(lock);
}
auto value = queue.front();
queue.pop();
return value;
}
boost::optional<T> tryPop(std::chrono::milliseconds waitFor) {
std::unique_lock<std::mutex> lock(mutex);
while (queue.empty()) {
if (condition.wait_for(lock, waitFor) == std::cv_status::timeout) {
return boost::none;
}
}
auto value = queue.front();
queue.pop();
return value;
}
void push(const T& item) {
std::unique_lock<std::mutex> lock(mutex);
queue.push(item);
lock.unlock();
condition.notify_one();
}
bool isEmpty() {
std::unique_lock<std::mutex> lock(mutex);
return queue.empty();
}
};
template<typename T> using QueueRef = std::shared_ptr<Queue<T>>;
}