2
0

staticVector.h 2.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176
  1. #pragma once
  2. //////////////////////////////////////////
  3. //staticVector.h
  4. //Luta Vlad(c) 2022
  5. //https://github.com/meemknight/PikaEngine
  6. //////////////////////////////////////////
  7. #include <initializer_list>
  8. #include <utility>
  9. #include <cstddef>
  10. #include <assert.h>
  11. template<class T, size_t N>
  12. struct StaticVector
  13. {
  14. typedef T *iterator;
  15. typedef const T *constIterator;
  16. iterator begin() { return &((T *)beg_)[0]; }
  17. constIterator begin() const { return &((T *)beg_)[0]; }
  18. iterator end() { return &((T *)beg_)[size_]; }
  19. constIterator end() const { return &((T *)beg_)[size_]; }
  20. static constexpr unsigned int MAX_SIZE = N;
  21. static constexpr unsigned int capacity = N;
  22. StaticVector() {};
  23. StaticVector(std::initializer_list<T> &&l)
  24. {
  25. for (auto &i : l)
  26. {
  27. push_back(i);
  28. }
  29. };
  30. StaticVector(StaticVector &&other)
  31. {
  32. for (size_t i = 0; i < other.size_; i++)
  33. {
  34. beg_[i] = std::move(other.beg_[i]);
  35. }
  36. this->size_ = other.size_;
  37. other.size_ = 0;
  38. }
  39. StaticVector(const StaticVector &other)
  40. {
  41. for (size_t i = 0; i < other.size_; i++)
  42. {
  43. beg_[i] = other.beg_[i];
  44. }
  45. this->size_ = other.size_;
  46. }
  47. size_t size()const { return size_; }
  48. bool empty() const
  49. {
  50. return (size_ == 0);
  51. }
  52. T *data()
  53. {
  54. return beg_;
  55. }
  56. StaticVector &operator= (const StaticVector &other)
  57. {
  58. if (this == &other)
  59. {
  60. return *this;
  61. }
  62. for (size_t i = 0; i < other.size_; i++)
  63. {
  64. beg_[i] = other.beg_[i];
  65. }
  66. this->size_ = other.size_;
  67. return *this;
  68. }
  69. StaticVector &operator= (StaticVector &&other)
  70. {
  71. if (this == &other)
  72. {
  73. return *this;
  74. }
  75. for (size_t i = 0; i < other.size_; i++)
  76. {
  77. beg_[i] = std::move(other.beg_[i]);
  78. }
  79. this->size_ = other.size_;
  80. other.size_ = 0;
  81. return *this;
  82. }
  83. bool operator==(const StaticVector &other)
  84. {
  85. if (this == &other) { return true; }
  86. if (this->size_ != other.size_) { return false; }
  87. for (int i = 0; i < size_; i++)
  88. {
  89. if ( (*this)[i] != other[i])
  90. {
  91. return false;
  92. }
  93. }
  94. return true;
  95. }
  96. bool operator!=(const StaticVector &other)
  97. {
  98. return !(*this == other);
  99. }
  100. T &operator[] (size_t index)
  101. {
  102. //permaAssertComment(index < size_, "buffer overflow on acces");
  103. return (beg_)[index];
  104. }
  105. T operator[] (size_t index) const
  106. {
  107. //permaAssertComment(index < size_, "buffer overflow on acces");
  108. return (beg_)[index];
  109. }
  110. T &back()
  111. {
  112. return (*this)[size_ - 1];
  113. }
  114. const T &back() const
  115. {
  116. return (*this)[size_ - 1];
  117. }
  118. void clear() { size_ = 0; }
  119. void push_back(const T &el)
  120. {
  121. assert(size_ < MAX_SIZE && "exceded max size in push back");
  122. beg_[size_] = el;
  123. size_++;
  124. }
  125. void push_back(T &&el)
  126. {
  127. assert(size_ < MAX_SIZE && "exceded max size in push back");
  128. beg_[size_] = std::forward<T>(el);
  129. size_++;
  130. }
  131. void pop_back()
  132. {
  133. assert(size_ > 0 && "buffer underflow on pop back");
  134. size_--;
  135. }
  136. size_t size_ = 0;
  137. T beg_[N];
  138. };