Queue.cppm 3.1 KB

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