28 #define TRACEN(nam, lvl, ...)
29 #define UNDEF_TRACE_AT_END
32 #define QV_ALIGN 512 // 512 byte align to support _possible_ direct I/O - see artdaq/artdaq/ArtModules/BinaryFileOutput_module.cc and artdaq issue #24437
40 static inline void* QV_MEMALIGN(
size_t boundary,
size_t size)
42 void* retadr =
nullptr;
43 posix_memalign(&retadr, boundary, size);
47 #ifndef QUICKVEC_DO_TEMPLATE
48 #define QUICKVEC_DO_TEMPLATE 1
52 #if !defined(__GCCXML__) && defined(__GXX_EXPERIMENTAL_CXX0X__)
53 #define NOT_OLD_CXXSTD 1
56 #if QUICKVEC_DO_TEMPLATE == 0
58 #define QUICKVEC_TT unsigned long long
60 #define TT_ QUICKVEC_TT
61 #define QUICKVEC_TEMPLATE
62 #define QUICKVEC QuickVec
63 #define QUICKVEC_TN QuickVec
64 #define QUICKVEC_VERSION
66 #define QUICKVEC_TEMPLATE template<typename TT_>
67 #define QUICKVEC QuickVec<TT_>
68 #define QUICKVEC_TN typename QuickVec<TT_>
69 #define QUICKVEC_VERSION \
76 static short Class_Version() \
79 } // proper version for templates
123 : size_(other.
size())
124 , data_(reinterpret_cast<TT_*>(QV_MEMALIGN(QV_ALIGN, other.
capacity() * sizeof(TT_))))
127 TRACEN(
"QuickVec", 40,
"QuickVec std::vector ctor b4 memcpy this=%p data_=%p &other[0]=%p size_=%d other.size()=%d", (
void*)
this, (
void*)data_, (
void*)&other[0], size_, other.size());
128 memcpy(data_, (
void*)&other[0], size_ *
sizeof(TT_));
143 , data_(reinterpret_cast<TT_*>(QV_MEMALIGN(QV_ALIGN, other.
capacity() * sizeof(TT_))))
144 , capacity_(other.capacity_)
146 TRACEN(
"QuickVec", 40,
"QuickVec copy ctor b4 memcpy this=%p data_=%p other.data_=%p size_=%d other.size_=%d", (
void*)
this, (
void*)data_, (
void*)other.data_, size_, other.size_);
147 memcpy(data_, other.data_, size_ *
sizeof(TT_));
157 TRACEN(
"QuickVec", 40,
"QuickVec copy assign b4 resize/memcpy this=%p data_=%p other.data_=%p size_=%d other.size_=%d", (
void*)
this, (
void*)data_, (
void*)other.data_, size_, other.size_);
159 memcpy(data_, other.data_, size_ *
sizeof(TT_));
169 , data_(std::move(other.data_))
170 , capacity_(other.capacity_)
172 TRACEN(
"QuickVec", 40,
"QuickVec move ctor this=%p data_=%p other.data_=%p", (
void*)
this, (
void*)data_, (
void*)other.data_);
173 other.data_ =
nullptr;
183 TRACEN(
"QuickVec", 40,
"QuickVec move assign this=%p data_=%p other.data_=%p", (
void*)
this, (
void*)data_, (
void*)other.data_);
187 data_ = std::move(other.data_);
188 capacity_ = other.capacity_;
189 other.data_ =
nullptr;
348 inline QUICKVEC::QuickVec(
size_t sz)
350 , data_(reinterpret_cast<TT_*>(QV_MEMALIGN(QV_ALIGN, sz * sizeof(TT_))))
353 TRACEN(
"QuickVec", 45,
"QuickVec %p ctor sz=%d data_=%p", (
void*)
this, size_, (
void*)data_);
357 inline QUICKVEC::QuickVec(
size_t sz, TT_ val)
359 , data_(reinterpret_cast<TT_*>(QV_MEMALIGN(QV_ALIGN, sz * sizeof(TT_))))
362 TRACEN(
"QuickVec", 45,
"QuickVec %p ctor sz=%d/v data_=%p", (
void*)
this, size_, (
void*)data_);
368 inline QUICKVEC::~QuickVec() noexcept
370 TRACEN(
"QuickVec", 45,
"QuickVec %p dtor start data_=%p size_=%d", (
void*)
this, (
void*)data_, size_);
374 TRACEN(
"QuickVec", 45,
"QuickVec %p dtor return", (
void*)
this);
378 inline TT_& QUICKVEC::operator[](
int idx)
380 assert(idx < (
int)size_);
385 inline const TT_& QUICKVEC::operator[](
int idx)
const
387 assert(idx < (
int)size_);
392 inline size_t QUICKVEC::size()
const {
return size_; }
395 inline size_t QUICKVEC::capacity()
const {
return capacity_; }
398 inline QUICKVEC_TN::iterator QUICKVEC::begin() {
return iterator(data_); }
401 inline QUICKVEC_TN::const_iterator QUICKVEC::begin()
const {
return iterator(data_); }
404 inline QUICKVEC_TN::iterator QUICKVEC::end()
410 inline QUICKVEC_TN::const_iterator QUICKVEC::end()
const
416 inline void QUICKVEC::reserve(
size_t size)
418 if (size > capacity_)
422 data_ =
reinterpret_cast<TT_*
>(QV_MEMALIGN(QV_ALIGN, size *
sizeof(TT_)));
423 memcpy(data_, old, size_ *
sizeof(TT_));
424 TRACEN(
"QuickVec", 43,
"QUICKVEC::reserve after memcpy this=%p old=%p data_=%p capacity=%d", (
void*)
this, (
void*)old, (
void*)data_, (
int)size);
432 inline void QUICKVEC::resize(
size_t size)
436 else if (size <= capacity_)
441 data_ =
reinterpret_cast<TT_*
>(QV_MEMALIGN(QV_ALIGN, size *
sizeof(TT_)));
442 memcpy(data_, old, size_ *
sizeof(TT_));
443 TRACEN(
"QuickVec", 43,
"QUICKVEC::resize after memcpy this=%p old=%p data_=%p size=%d", (
void*)
this, (
void*)old, (
void*)data_, (
int)size);
446 size_ = capacity_ = size;
451 inline void QUICKVEC::resizeWithCushion(
size_t size,
double growthFactor)
453 if (size > capacity_)
455 size_t new_size = std::round(capacity_ * growthFactor);
456 if (new_size < size) { new_size = size; }
457 if (new_size < 512) { new_size = 512; }
458 else if (new_size < 2048)
462 else if (new_size < 4096)
466 else if (new_size < 8192)
482 TRACEN(
"QuickVec", 43,
"QUICKVEC::resize initializing %zu elements", size - old_size);
483 for (
iterator ii = begin() + old_size; ii != end(); ++ii) *ii = val;
488 inline QUICKVEC_TN::iterator QUICKVEC::insert(
const_iterator position,
size_t nn,
const TT_& val)
490 assert(position <= end());
491 size_t offset = position - begin();
496 size_t cnt = end() - (begin() + offset);
497 while (cnt--) *--dst = *--src;
499 dst = begin() + offset;
501 while (nn--) *dst++ = val;
502 return begin() + offset;
508 assert(position <= end());
509 size_t nn = (last - first);
510 size_t offset = position - begin();
515 size_t cnt = end() - (begin() + offset);
516 while (cnt--) *--dst = *--src;
518 dst = begin() + offset;
520 while (nn--) *dst++ = *first++;
521 return begin() + offset;
527 assert(last <= end());
528 size_t nn = (last - first);
529 size_t offset = first - begin();
533 size_t cnt = end() - src;
534 while (cnt--) *dst++ = *src++;
537 return begin() + offset;
541 inline void QUICKVEC::swap(
QuickVec& other) noexcept
543 TRACEN(
"QuickVec", 42,
"QUICKVEC::swap this=%p enter data_=%p other.data_=%p", (
void*)
this, (
void*)data_, (
void*)other.data_);
544 std::swap(data_, other.data_);
545 std::swap(size_, other.size_);
546 std::swap(capacity_, other.capacity_);
547 TRACEN(
"QuickVec", 42,
"QUICKVEC::swap return data_=%p other.data_=%p", (
void*)data_, (
void*)other.data_);
553 if (size_ == capacity_)
555 reserve(size_ + size_ / 10 + 1);
563 #ifdef UNDEF_TRACE_AT_END
565 #undef UNDEF_TRACE_AT_END
iterator erase(const_iterator first, const_iterator last)
Erases elements in given range from the QuickVec.
iterator end()
Gets an iterator to the end of the QuickVec.
void clear()
Sets the size to 0. QuickVec does not reinitialize memory, so no further action will be taken...
void reserve(size_t size)
Allocates memory for the QuickVec so that its capacity is at least size.
void resize(size_t size)
Resizes the QuickVec.
TT_ & operator[](int idx)
Returns a reference to a given element.
size_t size_type
size_type is size_t
TT_ value_type
value_type is member type
size_t size() const
Accesses the current size of the QuickVec.
TT_ * iterator
Iterator is pointer-to-member type.
ptrdiff_t difference_type
difference_type is ptrdiff_t
size_t capacity() const
Accesses the current capacity of the QuickVec.
void swap(QuickVec &other) noexcept
Exchanges references to two QuickVec objects.
void resizeWithCushion(size_t size, double growthFactor=1.3)
Resizes the QuickVec and requests additional capacity.
iterator insert(const_iterator position, size_t nn, const TT_ &val)
Inserts an element into the QuickVec.
void push_back(const value_type &val)
Adds a value to the QuickVec, resizing if necessary (adds 10% capacity)
A QuickVec behaves like a std::vector, but does no initialization of its data, making it faster at th...
QuickVec(size_t sz)
Allocates a QuickVec object, doing no initialization of allocated memory.
const TT_ * const_iterator
const_iterator is const-pointer-to-member type
const TT_ & const_reference
const_reference is const-reference-to-member type
iterator begin()
Gets an iterator to the beginning of the QuickVec.
QuickVec< TT_ > & operator=(const QuickVec &other)
Copy assignment operator.
virtual ~QuickVec() noexcept
Destructor calls free on data.
TT_ & reference
reference is reference-to-member tpye
QuickVec(const QuickVec &other)
Copy Constructor.