vector.hpp 8.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370
  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. assert(!n || (n && new_ptr));
  146. m_capacity = n;
  147. size_t orig_size = m_size;
  148. if (m_size > m_capacity)
  149. m_size = m_capacity;
  150. for (size_t i = 0; i < m_size; ++i)
  151. allocator_traits<allocator_type>::construct(new_ptr + i, _at(i));
  152. for (size_t i = 0; i < orig_size; ++i)
  153. allocator_traits<allocator_type>::deconstruct(m_arr + i);
  154. if (m_arr)
  155. allocator_traits<allocator_type>::deallocate(m_arr);
  156. m_arr = new_ptr;
  157. }
  158. // TODO: find
  159. // erase the node which iter points to
  160. // void erase(const iterator_type& iter) noexcept
  161. // {
  162. // allocator_traits<allocator_type>::deconstruct(iter.p);
  163. // --m_size;
  164. // }
  165. // insert the value v in front of the given iterator
  166. // void insert(const iterator_type& iter, const value_type& v) noexcept
  167. // {
  168. // node_base_type* new_node = allocator_traits<allocator_type>::allocate(v);
  169. // iter._node()->prev->connect(new_node);
  170. // new_node->connect(iter._node());
  171. // ++_size();
  172. // }
  173. // insert the value v in front of the given iterator
  174. // void insert(const iterator_type& iter, value_type&& v) noexcept
  175. // {
  176. // node_base_type* new_node = allocator_traits<allocator_type>::allocate(v);
  177. // iter._node().prev->connect(new_node);
  178. // new_node->connect(iter._node());
  179. // ++_size();
  180. // }
  181. constexpr value_type* data(void) noexcept
  182. {
  183. return m_arr;
  184. }
  185. constexpr const value_type* data(void) const noexcept
  186. {
  187. return m_arr;
  188. }
  189. constexpr value_type& at(index_type i) noexcept
  190. {
  191. assert(i + 1 <= this->size());
  192. return _at(i);
  193. }
  194. constexpr const value_type& at(index_type i) const noexcept
  195. {
  196. assert(i + 1 <= this->size());
  197. return _at(i);
  198. }
  199. constexpr value_type& operator[](index_type i) noexcept
  200. {
  201. return at(i);
  202. }
  203. constexpr const value_type& operator[](index_type i) const noexcept
  204. {
  205. return at(i);
  206. }
  207. constexpr void push_back(const value_type& v) noexcept
  208. {
  209. if (m_size == m_capacity)
  210. resize(m_capacity * 2);
  211. allocator_traits<allocator_type>::construct(m_arr + m_size, v);
  212. ++m_size;
  213. }
  214. constexpr void push_back(value_type&& v) noexcept
  215. {
  216. if (m_size == m_capacity)
  217. resize(m_capacity * 2);
  218. allocator_traits<allocator_type>::construct(m_arr + m_size, move(v));
  219. ++m_size;
  220. }
  221. template <typename... Args>
  222. constexpr iterator_type emplace_back(Args&&... args)
  223. {
  224. push_back(value_type(forward<Args>(args)...));
  225. return back();
  226. }
  227. constexpr void pop_back(void) noexcept
  228. {
  229. allocator_traits<allocator_type>::deconstruct(&*back());
  230. --m_size;
  231. }
  232. constexpr size_type size(void) const noexcept
  233. {
  234. return m_size;
  235. }
  236. constexpr size_type capacity(void) const noexcept
  237. {
  238. return m_capacity;
  239. }
  240. constexpr const_iterator_type cbegin() const noexcept
  241. {
  242. return const_iterator_type(m_arr);
  243. }
  244. constexpr const_iterator_type cend() const noexcept
  245. {
  246. return const_iterator_type(m_arr + m_size);
  247. }
  248. constexpr iterator_type begin() noexcept
  249. {
  250. return iterator_type(m_arr);
  251. }
  252. constexpr const_iterator_type begin() const noexcept
  253. {
  254. return cbegin();
  255. }
  256. constexpr iterator_type end() noexcept
  257. {
  258. return iterator_type(m_arr + m_size);
  259. }
  260. constexpr const_iterator_type end() const noexcept
  261. {
  262. return cend();
  263. }
  264. constexpr iterator_type back() noexcept
  265. {
  266. return iterator_type(m_arr + m_size - 1);
  267. }
  268. constexpr const_iterator_type back() const noexcept
  269. {
  270. return const_iterator_type(m_arr + m_size - 1);
  271. }
  272. constexpr bool empty(void) const noexcept
  273. {
  274. return size() == 0;
  275. }
  276. constexpr void clear(void)
  277. {
  278. for (size_t i = 0; i < size(); ++i)
  279. allocator_traits<allocator_type>::deconstruct(m_arr + i);
  280. m_size = 0;
  281. }
  282. // TODO
  283. // iterator_type r_start() noexcept;
  284. // iterator_type r_end() noexcept;
  285. // iterator_type cr_start() noexcept;
  286. // iterator_type cr_end() noexcept;
  287. protected:
  288. inline constexpr const value_type& _at(index_type i) const
  289. {
  290. return m_arr[i];
  291. }
  292. inline constexpr value_type& _at(index_type i)
  293. {
  294. return m_arr[i];
  295. }
  296. protected:
  297. T* m_arr;
  298. size_type m_capacity;
  299. size_type m_size;
  300. };
  301. } // namespace types