ChunkedVector.h 2.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149
  1. #pragma once
  2. #include "../Common.h"
  3. NS_BF_BEGIN
  4. template <typename T, size_t NumChunkElements = 0x2000 / sizeof(T)>
  5. class ChunkedVector
  6. {
  7. public:
  8. Array<T*> mChunks;
  9. T* mCurChunkPtr;
  10. T* mCurChunkEnd;
  11. public:
  12. class Iterator
  13. {
  14. public:
  15. ChunkedVector* mVec;
  16. int mChunkIdx;
  17. T* mCurChunkPtr;
  18. T* mCurChunkEnd;
  19. public:
  20. Iterator(ChunkedVector& vec) : mVec(&vec)
  21. {
  22. }
  23. Iterator& operator++()
  24. {
  25. mCurChunkPtr++;
  26. if (mCurChunkPtr == mCurChunkEnd)
  27. {
  28. if (mChunkIdx < (int)mVec->mChunks.size() - 1)
  29. {
  30. mChunkIdx++;
  31. mCurChunkPtr = mVec->mChunks[mChunkIdx];
  32. mCurChunkEnd = mCurChunkPtr + NumChunkElements;
  33. }
  34. }
  35. return *this;
  36. }
  37. bool operator!=(const Iterator& itr) const
  38. {
  39. return (mCurChunkPtr != itr.mCurChunkPtr);
  40. }
  41. T& operator*()
  42. {
  43. return *mCurChunkPtr;
  44. }
  45. };
  46. public:
  47. ChunkedVector()
  48. {
  49. mCurChunkPtr = NULL;
  50. mCurChunkEnd = NULL;
  51. }
  52. ~ChunkedVector()
  53. {
  54. for (auto chunk : mChunks)
  55. delete [] chunk;
  56. }
  57. T& operator[](int idx)
  58. {
  59. return mChunks[idx / NumChunkElements][idx % NumChunkElements];
  60. }
  61. T& AllocBack()
  62. {
  63. if (mCurChunkPtr == mCurChunkEnd)
  64. {
  65. mCurChunkPtr = new T[NumChunkElements];
  66. mCurChunkEnd = mCurChunkPtr + NumChunkElements;
  67. mChunks.push_back(mCurChunkPtr);
  68. }
  69. return *(mCurChunkPtr++);
  70. }
  71. void push_back(T val)
  72. {
  73. AllocBack() = val;
  74. }
  75. size_t size()
  76. {
  77. if (mChunks.size() == 0)
  78. return 0;
  79. return (mChunks.size() - 1)*NumChunkElements + (NumChunkElements - (mCurChunkEnd - mCurChunkPtr));
  80. }
  81. T& front()
  82. {
  83. return mChunks[0][0];
  84. }
  85. T& back()
  86. {
  87. return mCurChunkPtr[-1];
  88. }
  89. Iterator begin()
  90. {
  91. Iterator itr(*this);
  92. if (mChunks.size() == 0)
  93. {
  94. itr.mChunkIdx = -1;
  95. itr.mCurChunkPtr = NULL;
  96. itr.mCurChunkEnd = NULL;
  97. }
  98. else
  99. {
  100. itr.mChunkIdx = 0;
  101. itr.mCurChunkPtr = mChunks[0];
  102. itr.mCurChunkEnd = itr.mCurChunkPtr + NumChunkElements;
  103. }
  104. return itr;
  105. }
  106. Iterator end()
  107. {
  108. Iterator itr(*this);
  109. itr.mChunkIdx = -1;
  110. itr.mCurChunkPtr = mCurChunkPtr;
  111. itr.mCurChunkEnd = NULL;
  112. return itr;
  113. }
  114. Iterator GetIterator(size_t idx)
  115. {
  116. Iterator itr(*this);
  117. itr.mChunkIdx = (int)(idx / NumChunkElements);
  118. if (itr.mChunkIdx == mChunks.size())
  119. {
  120. BF_ASSERT(idx == size());
  121. return end();
  122. }
  123. itr.mCurChunkPtr = mChunks[itr.mChunkIdx] + (idx % NumChunkElements);
  124. itr.mCurChunkEnd = mChunks[itr.mChunkIdx] + NumChunkElements;
  125. return itr;
  126. }
  127. };
  128. NS_BF_END