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
|
/*
RailControl - Model Railway Control Software
Copyright (c) 2017-2025 by Teddy / Dominik Mahrer - www.railcontrol.org
RailControl is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 3, or (at your option) any
later version.
RailControl is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with RailControl; see the file LICENCE. If not see
<http://www.gnu.org/licenses/>.
*/
#pragma once
#include <condition_variable>
#include <list>
#include <mutex>
namespace Utils
{
template<class T>
class ThreadSafeQueue
{
public:
inline ThreadSafeQueue()
: list(),
mutex(),
run(true)
{
}
inline ~ThreadSafeQueue()
{
Terminate();
}
inline void EnqueueBack(T t)
{
std::unique_lock<std::mutex> lock(mutex);
list.push_back(t);
cv.notify_all();
}
inline void EnqueueFront(T t)
{
std::unique_lock<std::mutex> lock(mutex);
list.push_front(t);
cv.notify_all();
}
T Dequeue()
{
std::unique_lock<std::mutex> lock(mutex);
while (list.empty())
{
if (run == false)
{
return T();
}
cv.wait_for(lock, std::chrono::seconds(1));
}
T val = list.front();
list.pop_front();
return val;
}
inline bool IsEmpty()
{
std::unique_lock<std::mutex> lock(mutex);
return list.empty();
}
inline void Terminate()
{
run = false;
cv.notify_all();
}
private:
std::list<T> list;
mutable std::mutex mutex;
std::condition_variable cv;
volatile bool run;
};
}
|
