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
|
/* OnePAD - PCSX2 dev
* Copyright (C) 2017-2017
*
* This program 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 2 of the License, or
* (at your option) any later version.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
*/
#pragma once
#include <mutex>
#include <queue>
template <typename T>
class MtQueue
{
std::queue<T> m_queue;
std::mutex m_mtx;
public:
MtQueue()
{
}
~MtQueue()
{
}
void push(const T &e)
{
std::lock_guard<std::mutex> guard(m_mtx);
m_queue.push(e);
}
size_t size()
{
std::lock_guard<std::mutex> guard(m_mtx);
return m_queue.size();
}
template <typename F>
void consume_all(F f)
{
std::lock_guard<std::mutex> guard(m_mtx);
while (!m_queue.empty()) {
f(m_queue.front());
m_queue.pop();
}
}
void reset()
{
std::lock_guard<std::mutex> guard(m_mtx);
while (!m_queue.empty())
m_queue.pop();
}
};
|
