queue.hpp 2.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104
  1. /**
  2. * Copyright (c) 2019 Paul-Louis Ageneau
  3. *
  4. * This library is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU Lesser General Public
  6. * License as published by the Free Software Foundation; either
  7. * version 2.1 of the License, or (at your option) any later version.
  8. *
  9. * This library is distributed in the hope that it will be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  12. * Lesser General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU Lesser General Public
  15. * License along with this library; if not, write to the Free Software
  16. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  17. */
  18. #ifndef RTC_QUEUE_H
  19. #define RTC_QUEUE_H
  20. #include "include.hpp"
  21. #include <atomic>
  22. #include <chrono>
  23. #include <condition_variable>
  24. #include <mutex>
  25. #include <optional>
  26. #include <queue>
  27. namespace rtc {
  28. template <typename T> class Queue {
  29. public:
  30. Queue();
  31. ~Queue();
  32. void stop();
  33. bool empty() const;
  34. void push(const T &element);
  35. std::optional<T> pop();
  36. void wait();
  37. void wait(const std::chrono::milliseconds &duration);
  38. private:
  39. std::queue<T> mQueue;
  40. std::condition_variable mCondition;
  41. std::atomic<bool> mStopping;
  42. mutable std::mutex mMutex;
  43. };
  44. template <typename T> Queue<T>::Queue() : mStopping(false) {}
  45. template <typename T> Queue<T>::~Queue() { stop(); }
  46. template <typename T> void Queue<T>::stop() {
  47. std::lock_guard<std::mutex> lock(mMutex);
  48. mStopping = true;
  49. mCondition.notify_all();
  50. }
  51. template <typename T> bool Queue<T>::empty() const {
  52. std::lock_guard<std::mutex> lock(mMutex);
  53. return mQueue.empty();
  54. }
  55. template <typename T> void Queue<T>::push(const T &element) {
  56. std::lock_guard<std::mutex> lock(mMutex);
  57. if (mStopping)
  58. return;
  59. mQueue.push(element);
  60. mCondition.notify_one();
  61. }
  62. template <typename T> std::optional<T> Queue<T>::pop() {
  63. std::unique_lock<std::mutex> lock(mMutex);
  64. while (mQueue.empty()) {
  65. if (mStopping)
  66. return nullopt;
  67. mCondition.wait(lock);
  68. }
  69. std::optional<T> element = mQueue.front();
  70. mQueue.pop();
  71. return element;
  72. }
  73. template <typename T> void Queue<T>::wait() {
  74. std::unique_lock<std::mutex> lock(mMutex);
  75. if (mQueue.empty() && !mStopping)
  76. mCondition.wait(lock);
  77. }
  78. template <typename T> void Queue<T>::wait(const std::chrono::milliseconds &duration) {
  79. std::unique_lock<std::mutex> lock(mMutex);
  80. if (mQueue.empty() && !mStopping)
  81. mCondition.wait_for(lock, duration);
  82. }
  83. } // namespace rtc
  84. #endif