-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy paththread_safe_queue.h
110 lines (86 loc) · 3.05 KB
/
thread_safe_queue.h
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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
#pragma once
#include <algorithm>
#include <concepts>
#include <deque>
#include <mutex>
#include <optional>
namespace dp {
/**
* @brief Simple concept for the Lockable and Basic Lockable types as defined by the C++
* standard.
* @details See https://en.cppreference.com/w/cpp/named_req/Lockable and
* https://en.cppreference.com/w/cpp/named_req/BasicLockable for details.
*/
template <typename Lock>
concept is_lockable = requires(Lock && lock) {
lock.lock();
lock.unlock();
{ lock.try_lock() } -> std::convertible_to<bool>;
};
template <typename T, typename Lock = std::mutex>
requires is_lockable<Lock>
class thread_safe_queue {
public:
using value_type = T;
using size_type = typename std::deque<T>::size_type;
thread_safe_queue() = default;
void push_back(T&& value) {
std::scoped_lock lock(mutex_);
data_.push_back(std::forward<T>(value));
}
void push_front(T&& value) {
std::scoped_lock lock(mutex_);
data_.push_front(std::forward<T>(value));
}
[[nodiscard]] bool empty() const {
std::scoped_lock lock(mutex_);
return data_.empty();
}
size_type clear() {
std::scoped_lock lock(mutex_);
auto size = data_.size();
data_.clear();
return size;
}
[[nodiscard]] std::optional<T> pop_front() {
std::scoped_lock lock(mutex_);
if (data_.empty()) return std::nullopt;
std::optional<T> front = std::move(data_.front());
data_.pop_front();
return front;
}
[[nodiscard]] std::optional<T> pop_back() {
std::scoped_lock lock(mutex_);
if (data_.empty()) return std::nullopt;
std::optional<T> back = std::move(data_.back());
data_.pop_back();
return back;
}
[[nodiscard]] std::optional<T> steal() {
std::scoped_lock lock(mutex_);
if (data_.empty()) return std::nullopt;
std::optional<T> back = std::move(data_.back());
data_.pop_back();
return back;
}
void rotate_to_front(const T& item) {
std::scoped_lock lock(mutex_);
auto iter = std::find(data_.begin(), data_.end(), item);
if (iter != data_.end()) {
std::ignore = data_.erase(iter);
}
data_.push_front(item);
}
[[nodiscard]] std::optional<T> copy_front_and_rotate_to_back() {
std::scoped_lock lock(mutex_);
if (data_.empty()) return std::nullopt;
std::optional<T> front = data_.front();
data_.pop_front();
data_.push_back(*front);
return front;
}
private:
std::deque<T> data_{};
mutable Lock mutex_{};
};
} // namespace dp