Queue.cppm 3.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132
  1. export module Core.Queue;
  2. export import Core.New;
  3. export import Core.ToString;
  4. import Core.AlignedData;
  5. import Core.Meta;
  6. import Core.Utility;
  7. import Core.Assert;
  8. export namespace Core {
  9. template<Moveable T, size_t N>
  10. class Queue final {
  11. AlignedType<T> data[N];
  12. size_t writeIndex = 0;
  13. size_t readIndex = 0;
  14. size_t values = 0;
  15. public:
  16. Queue() noexcept = default;
  17. Queue(const Queue& other) noexcept {
  18. copy(other);
  19. }
  20. Queue(Queue&& other) noexcept {
  21. move(Core::move(other));
  22. other.clear();
  23. }
  24. ~Queue() noexcept {
  25. clear();
  26. }
  27. Queue& operator=(const Queue& other) noexcept {
  28. if(&other != this) {
  29. clear();
  30. copy(other);
  31. }
  32. return *this;
  33. }
  34. Queue& operator=(Queue&& other) noexcept {
  35. if(&other != this) {
  36. clear();
  37. move(Core::move(other));
  38. other.clear();
  39. }
  40. return *this;
  41. }
  42. template<typename... Args>
  43. T* put(Args&&... args) noexcept {
  44. if(getLength() >= N) {
  45. return nullptr;
  46. }
  47. static_assert(noexcept(new(data + writeIndex)
  48. T(Core::forward<Args>(args)...)));
  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) noexcept {
  56. put(Core::forward<Args>(args)...);
  57. return *this;
  58. }
  59. T& operator[](size_t index) noexcept {
  60. return reinterpret_cast<T*>(data)[(index + readIndex) % N];
  61. }
  62. const T& operator[](size_t index) const noexcept {
  63. return reinterpret_cast<const T*>(data)[(index + readIndex) % N];
  64. }
  65. size_t getLength() const noexcept {
  66. return values;
  67. }
  68. bool canRemove() const noexcept {
  69. return getLength() > 0;
  70. }
  71. void clear() noexcept {
  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() noexcept {
  80. assert(canRemove());
  81. values--;
  82. (*this)[0].~T();
  83. readIndex = (readIndex + 1) % N;
  84. }
  85. size_t toString(StringBase& b) const noexcept {
  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) noexcept {
  102. for(size_t i = 0; i < other.getLength(); i++) {
  103. add(other[i]);
  104. }
  105. }
  106. void move(Queue&& other) noexcept {
  107. for(size_t i = 0; i < other.getLength(); i++) {
  108. add(Core::move(other[i]));
  109. }
  110. }
  111. };
  112. }