Queue.cppm 3.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132
  1. module;
  2. export module Core.Queue;
  3. export import Core.New;
  4. import Core.AlignedData;
  5. import Core.ToString;
  6. import Core.Meta;
  7. import Core.Utility;
  8. import Core.Assert;
  9. export namespace Core {
  10. template<typename T, size_t N>
  11. class Queue final {
  12. AlignedType<T> data[N];
  13. size_t writeIndex = 0;
  14. size_t readIndex = 0;
  15. size_t values = 0;
  16. public:
  17. Queue() = default;
  18. Queue(const Queue& other) {
  19. copy(other);
  20. }
  21. Queue(Queue&& other) noexcept {
  22. move(Core::move(other));
  23. other.clear();
  24. }
  25. ~Queue() {
  26. clear();
  27. }
  28. Queue& operator=(const Queue& other) {
  29. if(&other != this) {
  30. clear();
  31. copy(other);
  32. }
  33. return *this;
  34. }
  35. Queue& operator=(Queue&& other) noexcept {
  36. if(&other != this) {
  37. clear();
  38. move(Core::move(other));
  39. other.clear();
  40. }
  41. return *this;
  42. }
  43. template<typename... Args>
  44. T* put(Args&&... args) {
  45. if(getLength() >= N) {
  46. return nullptr;
  47. }
  48. T* t = new(data + writeIndex) T(Core::forward<Args>(args)...);
  49. writeIndex = (writeIndex + 1) % N;
  50. values++;
  51. return t;
  52. }
  53. template<typename... Args>
  54. Queue& add(Args&&... args) {
  55. put(Core::forward<Args>(args)...);
  56. return *this;
  57. }
  58. T& operator[](size_t index) {
  59. return reinterpret_cast<T*>(data)[(index + readIndex) % N];
  60. }
  61. const T& operator[](size_t index) const {
  62. return reinterpret_cast<const T*>(data)[(index + readIndex) % N];
  63. }
  64. size_t getLength() const {
  65. return values;
  66. }
  67. bool canRemove() const {
  68. return getLength() > 0;
  69. }
  70. void clear() {
  71. for(size_t i = 0; i < getLength(); i++) {
  72. (*this)[i].~T();
  73. }
  74. writeIndex = 0;
  75. readIndex = 0;
  76. values = 0;
  77. }
  78. void remove() {
  79. assert(canRemove());
  80. values--;
  81. (*this)[0].~T();
  82. readIndex = (readIndex + 1) % N;
  83. }
  84. size_t toString(char* s, size_t n) const {
  85. size_t total = 0;
  86. addString("[", s, n, total);
  87. size_t end = getLength();
  88. if(end > 0) {
  89. end--;
  90. for(size_t i = 0; i < end; i++) {
  91. addString((*this)[i], s, n, total);
  92. addString(", ", s, n, total);
  93. }
  94. addString((*this)[end], s, n, total);
  95. }
  96. addString("]", s, n, total);
  97. return total;
  98. }
  99. private:
  100. void copy(const Queue& other) {
  101. for(size_t i = 0; i < other.getLength(); i++) {
  102. add(other[i]);
  103. }
  104. }
  105. void move(Queue&& other) {
  106. for(size_t i = 0; i < other.getLength(); i++) {
  107. add(Core::move(other[i]));
  108. }
  109. }
  110. };
  111. }