Lines Matching defs:size
31 * A RingBuffer class that maintains an array of objects that can grow up to a certain size.
49 iterator(T* ptr, size_t size, size_t pos, size_t ctr);
75 const_iterator(const T* ptr, size_t size, size_t pos, size_t ctr);
146 * this ringbuffer, [0, size), the behavior for this is undefined.
152 * for this ringbuffer, [0, size), the behavior for this is undefined.
157 * Return the current size of this RingBuffer.
159 size_t size() const;
162 * Remove all elements from this RingBuffer and set the size to 0.
177 RingBuffer<T>::iterator::iterator(T* ptr, size_t size, size_t pos, size_t ctr) :
178 mPtr{ptr}, mSize{size}, mPos{pos}, mCtr{ctr} {}
221 RingBuffer<T>::const_iterator::const_iterator(const T* ptr, size_t size, size_t pos, size_t ctr) :
222 mPtr{ptr}, mSize{size}, mPos{pos}, mCtr{ctr} {}
266 if (mBuffer.size() < mMaxBufferSize) {
278 if (mBuffer.size() != mMaxBufferSize) {
292 if (mBuffer.size() != mMaxBufferSize) {
305 size_t tmp = (mBuffer.size() == 0) ? 0 : mBuffer.size() - 1;
306 return iterator(mBuffer.data(), mBuffer.size(), (mFrontIdx == 0) ? tmp : mFrontIdx - 1, 0);
311 size_t s = mBuffer.size();
317 size_t tmp = (mBuffer.size() == 0) ? 0 : mBuffer.size() - 1;
318 return const_iterator(mBuffer.data(), mBuffer.size(),
324 size_t s = mBuffer.size();
330 LOG_ALWAYS_FATAL_IF(index >= mBuffer.size(), "Index %zu out of bounds, size is %zu.",
331 index, mBuffer.size());
333 mBuffer.size() - 1 - (index - mFrontIdx) : mFrontIdx - 1 - index;
339 LOG_ALWAYS_FATAL_IF(index >= mBuffer.size(), "Index %zu out of bounds, size is %zu.",
340 index, mBuffer.size());
342 mBuffer.size() - 1 - (index - mFrontIdx) : mFrontIdx - 1 - index;
347 size_t RingBuffer<T>::size() const {
348 return mBuffer.size();
