vector.hpp 8.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369
  1. #pragma once
  2. #include <assert.h>
  3. #include <types/allocator.hpp>
  4. #include <types/cplusplus.hpp>
  5. #include <types/types.h>
  6. namespace types {
  7. template <typename T, template <typename _value_type> class Allocator = kernel_allocator>
  8. class vector {
  9. public:
  10. template <typename Pointer>
  11. class iterator;
  12. using value_type = T;
  13. using pointer_type = value_type*;
  14. using reference_type = value_type&;
  15. using iterator_type = iterator<value_type*>;
  16. using const_iterator_type = iterator<const value_type*>;
  17. using size_type = size_t;
  18. using difference_type = ssize_t;
  19. using index_type = size_type;
  20. using allocator_type = Allocator<value_type>;
  21. public:
  22. template <typename Pointer>
  23. class iterator {
  24. public:
  25. using Value = typename types::traits::remove_pointer<Pointer>::type;
  26. using Reference = typename types::traits::add_reference<Value>::type;
  27. public:
  28. constexpr iterator(const iterator& iter) noexcept
  29. : p(iter.p)
  30. {
  31. }
  32. constexpr iterator(iterator&& iter) noexcept
  33. : p(iter.p)
  34. {
  35. iter.p = nullptr;
  36. }
  37. constexpr iterator& operator=(const iterator& iter)
  38. {
  39. p = iter.p;
  40. return *this;
  41. }
  42. explicit constexpr iterator(Pointer p) noexcept
  43. : p(p)
  44. {
  45. }
  46. constexpr bool operator==(const iterator& iter) const noexcept
  47. {
  48. return this->p == iter.p;
  49. }
  50. constexpr bool operator!=(const iterator& iter) const noexcept
  51. {
  52. return !(*this == iter);
  53. }
  54. constexpr iterator& operator++(void) noexcept
  55. {
  56. ++p;
  57. return *this;
  58. }
  59. constexpr iterator operator++(int) noexcept
  60. {
  61. iterator iter(*this);
  62. ++p;
  63. return iter;
  64. }
  65. constexpr iterator& operator--(void) noexcept
  66. {
  67. --p;
  68. return *this;
  69. }
  70. constexpr iterator operator--(int) noexcept
  71. {
  72. iterator iter(*this);
  73. --p;
  74. return iter;
  75. }
  76. constexpr iterator operator+(size_type n) noexcept
  77. {
  78. iterator iter(p + n);
  79. return iter;
  80. }
  81. constexpr iterator operator-(size_type n) noexcept
  82. {
  83. iterator iter(p - n);
  84. return iter;
  85. }
  86. constexpr Reference operator*(void) const noexcept
  87. {
  88. return *p;
  89. }
  90. constexpr Pointer operator&(void) const noexcept
  91. {
  92. return p;
  93. }
  94. constexpr Pointer operator->(void) const noexcept
  95. {
  96. return p;
  97. }
  98. protected:
  99. Pointer p;
  100. };
  101. public:
  102. explicit constexpr vector(size_type capacity = 1) noexcept
  103. : m_arr(nullptr)
  104. , m_size(0)
  105. {
  106. resize(capacity);
  107. }
  108. constexpr vector(const vector& arr) noexcept
  109. : vector(arr.capacity())
  110. {
  111. for (const auto& item : arr)
  112. push_back(item);
  113. }
  114. constexpr vector(vector&& arr) noexcept
  115. {
  116. m_arr = arr.m_arr;
  117. m_capacity = arr.m_capacity;
  118. m_size = arr.m_size;
  119. arr.m_arr = nullptr;
  120. arr.m_capacity = 0;
  121. arr.m_size = 0;
  122. }
  123. constexpr vector& operator=(vector&& arr)
  124. {
  125. resize(0);
  126. m_arr = arr.m_arr;
  127. m_capacity = arr.m_capacity;
  128. m_size = arr.m_size;
  129. arr.m_arr = nullptr;
  130. arr.m_capacity = 0;
  131. arr.m_size = 0;
  132. return *this;
  133. }
  134. constexpr vector& operator=(const vector& arr)
  135. {
  136. return operator=(vector(arr));
  137. }
  138. constexpr ~vector() noexcept
  139. {
  140. resize(0);
  141. }
  142. constexpr void resize(size_type n)
  143. {
  144. value_type* new_ptr = allocator_traits<allocator_type>::allocate(n);
  145. m_capacity = n;
  146. size_t orig_size = m_size;
  147. if (m_size > m_capacity)
  148. m_size = m_capacity;
  149. for (size_t i = 0; i < m_size; ++i)
  150. allocator_traits<allocator_type>::construct(new_ptr + i, _at(i));
  151. for (size_t i = 0; i < orig_size; ++i)
  152. allocator_traits<allocator_type>::deconstruct(m_arr + i);
  153. if (m_arr)
  154. allocator_traits<allocator_type>::deallocate(m_arr);
  155. m_arr = new_ptr;
  156. }
  157. // TODO: find
  158. // erase the node which iter points to
  159. // void erase(const iterator_type& iter) noexcept
  160. // {
  161. // allocator_traits<allocator_type>::deconstruct(iter.p);
  162. // --m_size;
  163. // }
  164. // insert the value v in front of the given iterator
  165. // void insert(const iterator_type& iter, const value_type& v) noexcept
  166. // {
  167. // node_base_type* new_node = allocator_traits<allocator_type>::allocate(v);
  168. // iter._node()->prev->connect(new_node);
  169. // new_node->connect(iter._node());
  170. // ++_size();
  171. // }
  172. // insert the value v in front of the given iterator
  173. // void insert(const iterator_type& iter, value_type&& v) noexcept
  174. // {
  175. // node_base_type* new_node = allocator_traits<allocator_type>::allocate(v);
  176. // iter._node().prev->connect(new_node);
  177. // new_node->connect(iter._node());
  178. // ++_size();
  179. // }
  180. constexpr value_type* data(void) noexcept
  181. {
  182. return m_arr;
  183. }
  184. constexpr const value_type* data(void) const noexcept
  185. {
  186. return m_arr;
  187. }
  188. constexpr value_type& at(index_type i) noexcept
  189. {
  190. assert(i + 1 <= this->size());
  191. return _at(i);
  192. }
  193. constexpr const value_type& at(index_type i) const noexcept
  194. {
  195. assert(i + 1 <= this->size());
  196. return _at(i);
  197. }
  198. constexpr value_type& operator[](index_type i) noexcept
  199. {
  200. return at(i);
  201. }
  202. constexpr const value_type& operator[](index_type i) const noexcept
  203. {
  204. return at(i);
  205. }
  206. constexpr void push_back(const value_type& v) noexcept
  207. {
  208. if (m_size == m_capacity)
  209. resize(m_capacity * 2);
  210. allocator_traits<allocator_type>::construct(m_arr + m_size, v);
  211. ++m_size;
  212. }
  213. constexpr void push_back(value_type&& v) noexcept
  214. {
  215. if (m_size == m_capacity)
  216. resize(m_capacity * 2);
  217. allocator_traits<allocator_type>::construct(m_arr + m_size, move(v));
  218. ++m_size;
  219. }
  220. template <typename... Args>
  221. constexpr iterator_type emplace_back(Args&&... args)
  222. {
  223. push_back(value_type(forward<Args>(args)...));
  224. return back();
  225. }
  226. constexpr void pop_back(void) noexcept
  227. {
  228. allocator_traits<allocator_type>::deconstruct(&*back());
  229. --m_size;
  230. }
  231. constexpr size_type size(void) const noexcept
  232. {
  233. return m_size;
  234. }
  235. constexpr size_type capacity(void) const noexcept
  236. {
  237. return m_capacity;
  238. }
  239. constexpr const_iterator_type cbegin() const noexcept
  240. {
  241. return const_iterator_type(m_arr);
  242. }
  243. constexpr const_iterator_type cend() const noexcept
  244. {
  245. return const_iterator_type(m_arr + m_size);
  246. }
  247. constexpr iterator_type begin() noexcept
  248. {
  249. return iterator_type(m_arr);
  250. }
  251. constexpr const_iterator_type begin() const noexcept
  252. {
  253. return cbegin();
  254. }
  255. constexpr iterator_type end() noexcept
  256. {
  257. return iterator_type(m_arr + m_size);
  258. }
  259. constexpr const_iterator_type end() const noexcept
  260. {
  261. return cend();
  262. }
  263. constexpr iterator_type back() noexcept
  264. {
  265. return iterator_type(m_arr + m_size - 1);
  266. }
  267. constexpr const_iterator_type back() const noexcept
  268. {
  269. return const_iterator_type(m_arr + m_size - 1);
  270. }
  271. constexpr bool empty(void) const noexcept
  272. {
  273. return size() == 0;
  274. }
  275. constexpr void clear(void)
  276. {
  277. for (size_t i = 0; i < size(); ++i)
  278. allocator_traits<allocator_type>::deconstruct(m_arr + i);
  279. m_size = 0;
  280. }
  281. // TODO
  282. // iterator_type r_start() noexcept;
  283. // iterator_type r_end() noexcept;
  284. // iterator_type cr_start() noexcept;
  285. // iterator_type cr_end() noexcept;
  286. protected:
  287. inline constexpr const value_type& _at(index_type i) const
  288. {
  289. return m_arr[i];
  290. }
  291. inline constexpr value_type& _at(index_type i)
  292. {
  293. return m_arr[i];
  294. }
  295. protected:
  296. T* m_arr;
  297. size_type m_capacity;
  298. size_type m_size;
  299. };
  300. } // namespace types