Open-Harbor/osrm-backend
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 3 Wiki Activity

backport of resize implementation

Browse Source
This commit is contained in:
DennisOSRM 2012-08-27 16:16:59 +02:00
parent 827b9e4be2
commit a127c705f2
1 changed files with 25 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
DataStructures/DeallocatingVector.h
View File

@ -49,6 +49,7 @@ protected:
ElementT * mData; ElementT * mData;
size_t mIndex; size_t mIndex;
std::vector<ElementT *> & mBucketList; std::vector<ElementT *> & mBucketList;
inline void setPointerForIndex() { inline void setPointerForIndex() {
if(bucketSizeC*mBucketList.size() <= mIndex) { if(bucketSizeC*mBucketList.size() <= mIndex) {
mData = DEALLOCATION_VECTOR_NULL_PTR; mData = DEALLOCATION_VECTOR_NULL_PTR;
@ -102,7 +103,9 @@ public:
template<typename T2> template<typename T2>
DeallocatingVectorIterator(const DeallocatingVectorIterator<T2> & r) : mState(r.mState) {} DeallocatingVectorIterator(const DeallocatingVectorIterator<T2> & r) : mState(r.mState) {}
DeallocatingVectorIterator(size_t idx, std::vector<ElementT *> & input_list) : mState(idx, input_list) {} DeallocatingVectorIterator(size_t idx, std::vector<ElementT *> & input_list) : mState(idx, input_list) {}
//DeallocatingVectorIterator(size_t idx, const std::vector<ElementT *> & input_list) : mState(idx, input_list) {}
DeallocatingVectorIterator(const DeallocatingVectorIteratorState & r) : mState(r) {} DeallocatingVectorIterator(const DeallocatingVectorIteratorState & r) : mState(r) {}
template<typename T2> template<typename T2>
@ -231,6 +234,28 @@ public:
++mCurrentSize; ++mCurrentSize;
} }
inline void reserve(const size_t new_size) const {
//don't do anything
}
inline void resize(const size_t new_size) {
if(new_size > mCurrentSize) {
while(capacity() < new_size) {
mBucketList.push_back(new ElementT[bucketSizeC]);
}
mCurrentSize = new_size;
}
if(new_size < mCurrentSize) {
size_t number_of_necessary_buckets = 1+(new_size / bucketSizeC);
for(unsigned i = number_of_necessary_buckets; i < mBucketList.size(); ++i) {
delete[] mBucketList[i];
}
mBucketList.resize(number_of_necessary_buckets);
mCurrentSize = new_size;
}
}
inline size_t size() const { inline size_t size() const {
return mCurrentSize; return mCurrentSize;
} }
@ -276,6 +301,4 @@ public:
} }
}; };
#endif /* DEALLOCATINGVECTOR_H_ */ #endif /* DEALLOCATINGVECTOR_H_ */