List.cppm 6.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234
  1. export module Core.List;
  2. export import Core.Utility;
  3. export import Core.New;
  4. import Core.AlignedData;
  5. import Core.Math;
  6. import Core.Meta;
  7. import Core.ToString;
  8. import Core.Assert;
  9. export namespace Core {
  10. template<Moveable T>
  11. class List final {
  12. size_t length;
  13. size_t capacity;
  14. T* data;
  15. public:
  16. List() noexcept : length(0), capacity(0), data(nullptr) {
  17. }
  18. List(const List& other) noexcept :
  19. length(0), capacity(other.capacity),
  20. data(allocate(other.capacity)) {
  21. for(const T& t : other) {
  22. unsafeAdd(t);
  23. }
  24. }
  25. List(List&& other) noexcept : List() {
  26. swap(other);
  27. }
  28. ~List() noexcept {
  29. clear();
  30. deleteWithSourceN<AlignedType<T>>(
  31. reinterpret_cast<AlignedType<T>*>(data));
  32. }
  33. List& operator=(List other) noexcept {
  34. swap(other);
  35. return *this;
  36. }
  37. T* begin() noexcept {
  38. return data;
  39. }
  40. T* end() noexcept {
  41. return data + length;
  42. }
  43. const T* begin() const noexcept {
  44. return data;
  45. }
  46. const T* end() const noexcept {
  47. return data + length;
  48. }
  49. void reserve(size_t n) noexcept {
  50. if(n > capacity) {
  51. setSize(n);
  52. }
  53. }
  54. void shrink() noexcept {
  55. if(length != capacity) {
  56. setSize(length);
  57. }
  58. }
  59. void resize(size_t n, const T& t) noexcept {
  60. if(length < n) {
  61. reserve(n);
  62. for(size_t i = n - length; i != 0; i--) {
  63. unsafeAdd(t);
  64. }
  65. } else if(length > n) {
  66. for(size_t i = n; i < length; i++) {
  67. data[i].~T();
  68. }
  69. length = n;
  70. }
  71. }
  72. void resize(size_t n) noexcept {
  73. if(length < n) {
  74. reserve(n);
  75. for(size_t i = n - length; i != 0; i--) {
  76. unsafeAdd(T());
  77. }
  78. } else if(length > n) {
  79. for(size_t i = n; i < length; i++) {
  80. data[i].~T();
  81. }
  82. length = n;
  83. }
  84. }
  85. template<typename... Args>
  86. T& put(Args&&... args) noexcept {
  87. ensureCapacity();
  88. return *unsafeAdd(Core::forward<Args>(args)...);
  89. }
  90. template<typename... Args>
  91. List& add(Args&&... args) noexcept {
  92. put(Core::forward<Args>(args)...);
  93. return *this;
  94. }
  95. template<typename... Args>
  96. T& putAt(size_t t, Args&&... args) noexcept {
  97. if(t >= length) {
  98. return put(Core::forward<Args>(args)...);
  99. }
  100. // put must not reallocate, to keep the moved element alive
  101. ensureCapacity();
  102. put(Core::move(data[length - 1]));
  103. for(size_t i = length - 2; i > t; i--) {
  104. data[i] = Core::move(data[i - 1]);
  105. }
  106. data[t] = Core::move(T(Core::forward<Args>(args)...));
  107. return data[t];
  108. }
  109. template<typename... Args>
  110. List& addAt(size_t index, Args&&... args) noexcept {
  111. putAt(index, Core::forward<Args>(args)...);
  112. return *this;
  113. }
  114. T& operator[](size_t index) noexcept {
  115. assert(index < length);
  116. return data[index];
  117. }
  118. const T& operator[](size_t index) const noexcept {
  119. assert(index < length);
  120. return data[index];
  121. }
  122. T& getLast() noexcept {
  123. assert(length > 0);
  124. return data[length - 1];
  125. }
  126. const T& getLast() const noexcept {
  127. assert(length > 0);
  128. return data[length - 1];
  129. }
  130. size_t getLength() const noexcept {
  131. return length;
  132. }
  133. size_t getCapacity() const noexcept {
  134. return capacity;
  135. }
  136. void clear() noexcept {
  137. for(T& t : *this) {
  138. t.~T();
  139. }
  140. length = 0;
  141. }
  142. void removeBySwap(size_t index) noexcept {
  143. assert(index < length);
  144. length--;
  145. if(index != length) {
  146. data[index] = Core::move(data[length]);
  147. }
  148. data[length].~T();
  149. }
  150. void remove(size_t index) noexcept {
  151. assert(index < length);
  152. length--;
  153. T* currentT = begin() + index;
  154. T* endT = end();
  155. while(currentT != endT) {
  156. T* nextT = currentT + 1;
  157. *currentT = Core::move(*nextT);
  158. currentT = nextT;
  159. }
  160. endT->~T();
  161. }
  162. void removeLast() noexcept {
  163. removeBySwap(length - 1);
  164. }
  165. void swap(List& other) noexcept {
  166. Core::swap(length, other.length);
  167. Core::swap(capacity, other.capacity);
  168. Core::swap(data, other.data);
  169. }
  170. private:
  171. static T* allocate(size_t n) noexcept {
  172. if(n <= 0) {
  173. return nullptr;
  174. }
  175. return reinterpret_cast<T*>(newWithSourceN<AlignedType<T>>(n));
  176. }
  177. void ensureCapacity() noexcept {
  178. if(length >= capacity) {
  179. reserve(capacity + Core::max(4lu, capacity / 4));
  180. }
  181. }
  182. // does not check for capacity
  183. template<typename... Args>
  184. T* unsafeAdd(Args&&... args) noexcept {
  185. static_assert(
  186. noexcept(new(data + length++) T(Core::forward<Args>(args)...)));
  187. return new(data + length++) T(Core::forward<Args>(args)...);
  188. }
  189. void setSize(size_t n) noexcept {
  190. List copy;
  191. copy.data = allocate(n);
  192. copy.capacity = n;
  193. for(size_t i = 0; i < length; i++) {
  194. copy.unsafeAdd(Core::move(data[i]));
  195. }
  196. swap(copy);
  197. }
  198. };
  199. }