vector.hpp 8.4 KB

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