Newer
Older
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
#ifndef ASYNC_CONTAINERS_HPP
#define ASYNC_CONTAINERS_HPP
#include <deque>
#include <mutex>
// AsyncQueue will remove items as they are consumed
template <typename T, T sentinel> struct AsyncQueue {
std::mutex m;
std::deque<T> container;
bool done = false;
void produce(T m) {
m.lock();
container.push_back(m);
m.unlock();
}
// do we need to use std::optional?
T consume() {
T ret;
// Wait
while (container.empty() && !done) {
};
if (container.empty()) {
// done
return sentinel;
}
m.lock();
ret = container.front();
container.pop_front();
m.unlock();
return ret;
}
void finish() { done = true; }
void reset() { done = false; }
};
// AsyncBuffer will persist items
template <typename T, T sentinel> struct AsyncBuffer {
std::mutex m;
std::deque container;
bool done = false;
void produce(T m) {
m.lock();
container.push_back(m);
m.unlock();
}
//[] operator (?)
T get(size_t i) {
T ret;
// Wait
while (container.size() <= i && !done) {
};
if (container.size() <= i) {
// done
return sentinel;
}
// Is locking necessary here? hmm
m.lock();
ret = container[i];
m.unlock();
return ret;
}
void finish() { done = true; }
void reset() {
container.clear();
done = false;
}
};
#endif