From eae4452e08c97becdd05a480fe5a47dbb2838c95 Mon Sep 17 00:00:00 2001
From: kallaballa <amir@viel-zu.org>
Date: Fri, 2 Dec 2022 01:46:42 +0100
Subject: [PATCH] removed obsolete file

---
 src/common/tsafe_queue.hpp | 50 --------------------------------------
 1 file changed, 50 deletions(-)
 delete mode 100644 src/common/tsafe_queue.hpp

diff --git a/src/common/tsafe_queue.hpp b/src/common/tsafe_queue.hpp
deleted file mode 100644
index 4f2525cb0..000000000
--- a/src/common/tsafe_queue.hpp
+++ /dev/null
@@ -1,50 +0,0 @@
-//started with https://stackoverflow.com/questions/15278343/c11-thread-safe-queue
-#ifndef SAFE_QUEUE
-#define SAFE_QUEUE
-
-#include <queue>
-#include <mutex>
-#include <condition_variable>
-
-// A threadsafe-queue.
-template<class T>
-class SafeQueue {
-public:
-    SafeQueue(size_t maxSize) :
-            q(), m(), cempty(), cfull(), maxSize(maxSize) {
-    }
-
-    ~SafeQueue() {
-    }
-
-    // Add an element to the queue.
-    void enqueue(T t) {
-        std::unique_lock<std::mutex> lock(m);
-        while (q.size() >= maxSize) {
-            cfull.wait(lock);
-        }
-        q.push(t);
-        cempty.notify_one();
-    }
-
-    // Get the "front"-element.
-    // If the queue is empty, wait till a element is avaiable.
-    T dequeue() {
-        cfull.notify_one();
-        std::unique_lock<std::mutex> lock(m);
-        while (q.empty()) {
-            // release lock as long as the wait and reaquire it afterwards.
-            cempty.wait(lock);
-        }
-        T val = q.front();
-        q.pop();
-        return val;
-    }
-private:
-    std::queue<T> q;
-    mutable std::mutex m;
-    std::condition_variable cempty;
-    std::condition_variable cfull;
-    int maxSize;
-};
-#endif