Repository navigation
Expand file tree
/
Copy pathQueue.cpp
More file actions
71 lines (58 loc) · 1.48 KB
/
Copy pathQueue.cpp
File metadata and controls
71 lines (58 loc) · 1.48 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
#include "../includes/Queue.h"
#include <iostream>
#pragma unmanaged
void EventQueue::clear() {
std::lock_guard<std::mutex> lock(mutex);
queue.clear();
}
std::size_t EventQueue::count() {
std::lock_guard<std::mutex> lock(mutex);
return queue.size();
}
std::unique_ptr<Event> EventQueue::dequeue() {
std::lock_guard<std::mutex> lock(mutex);
if (queue.empty()) {
return nullptr;
}
auto &front = queue.front();
auto retVal = std::move(front);
queue.pop_front();
return retVal;
}
std::unique_ptr<std::vector<std::unique_ptr<Event>>> EventQueue::dequeueAll() {
std::lock_guard<std::mutex> lock(mutex);
if (queue.empty()) {
return nullptr;
}
const auto queueSize = queue.size();
std::unique_ptr<std::vector<std::unique_ptr<Event>>> events(new std::vector<std::unique_ptr<Event>>);
for (size_t i = 0; i < queueSize; ++i) {
auto &front = queue.front();
events->emplace_back(std::move(front));
queue.pop_front();
}
return events;
}
void EventQueue::enqueue(
const EventType type,
const std::string &fromDirectory,
const std::string &fromFile,
const std::string &toDirectory,
const std::string &toFile
) {
if (mPaused) {
return;
}
std::lock_guard<std::mutex> lock(mutex);
queue.emplace_back(std::unique_ptr<Event>(new Event(type, fromDirectory, fromFile, toDirectory, toFile)));
}
void EventQueue::pause() {
mPaused = true;
clear();
}
void EventQueue::resume() {
mPaused = false;
}
EventQueue::EventQueue():
mPaused(false)
{}