76 lines
1.7 KiB
C++
76 lines
1.7 KiB
C++
#pragma once
|
|
|
|
#include <queue>
|
|
#include <robin_hood.h>
|
|
#include <mutex>
|
|
#include <condition_variable>
|
|
|
|
namespace data {
|
|
/// Thread safe queue discarding duplicate values
|
|
template <class T>
|
|
class safe_unique_queue {
|
|
private:
|
|
std::queue<T> queue;
|
|
robin_hood::unordered_flat_set<T> set;
|
|
std::mutex mutex;
|
|
std::condition_variable cv;
|
|
|
|
public:
|
|
bool push(const T& in) {
|
|
std::unique_lock<std::mutex> lock(mutex);
|
|
if(set.insert(in).second) {
|
|
queue.push(in);
|
|
cv.notify_one();
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
bool pop(T& out) {
|
|
std::unique_lock<std::mutex> lock(mutex);
|
|
if (queue.empty())
|
|
return false;
|
|
|
|
out = queue.front();
|
|
set.erase(out);
|
|
queue.pop();
|
|
return true;
|
|
}
|
|
|
|
bool take(T& out) {
|
|
std::unique_lock<std::mutex> lock(mutex);
|
|
if (queue.empty())
|
|
return false;
|
|
|
|
out = queue.front();
|
|
queue.pop();
|
|
return true;
|
|
}
|
|
|
|
void release(const T& taken) {
|
|
std::unique_lock<std::mutex> lock(mutex);
|
|
set.erase(taken);
|
|
}
|
|
|
|
bool empty() {
|
|
std::unique_lock<std::mutex> lock(mutex);
|
|
return queue.empty();
|
|
}
|
|
|
|
size_t size() {
|
|
std::unique_lock<std::mutex> lock(mutex);
|
|
return set.size();
|
|
}
|
|
|
|
void notify() {
|
|
cv.notify_all();
|
|
}
|
|
|
|
void wait() {
|
|
std::unique_lock<std::mutex> lock(mutex);
|
|
if(queue.empty())
|
|
cv.wait(lock);
|
|
}
|
|
};
|
|
}
|