vector.hpp 8.3 KB

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