-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathTaskQueue.cpp
More file actions
77 lines (66 loc) · 1.55 KB
/
TaskQueue.cpp
File metadata and controls
77 lines (66 loc) · 1.55 KB
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
#include "TaskQueue.hpp"
#include "Task.hpp"
//
#ifdef __APPLE__
std::shared_mutex TaskQueue::qMutex = std::shared_mutex();
std::queue<Task> TaskQueue::qTask = std::queue<Task>();
#endif
TaskQueue::TaskQueue() {
}
TaskQueue::~TaskQueue() {
}
void TaskQueue::Push(const Task &t) {
if (true) {
std::unique_lock<std::shared_mutex> lock(qMutex);
qTask.push(t);
}
}
void TaskQueue::Push2(const std::vector<Task> &v) {
if (true) {
std::unique_lock<std::shared_mutex> lock(qMutex);
for (auto iter = v.begin(); iter != v.end(); iter++) {
qTask.push(*iter);
}
}
}
bool TaskQueue::Get(Task &t) {
bool isSucc = false;
//
if (true) {
std::unique_lock<std::shared_mutex> lock(qMutex);
if (qTask.size() > 0) {
t = qTask.front();
qTask.pop();
isSucc = true;
}
}
//
return isSucc;
}
bool TaskQueue::Empty() {
bool isEmpty = false;
//
if (true) {
std::shared_lock<std::shared_mutex> lock(qMutex);
isEmpty = qTask.empty();
}
//
return isEmpty;
}
void TaskQueue::Clean() {
if (true) {
std::unique_lock<std::shared_mutex> lock(qMutex);
std::queue<Task> empty;
swap(empty, qTask);
}
}
size_t TaskQueue::TaskNum() {
std::size_t numTask = 0;
//
if (true) {
std::shared_lock<std::shared_mutex> lock(qMutex);
numTask = qTask.size();
}
//
return numTask;
}