I have a use case for creating an std::vector
with many elements, each of which is of a simple, but non-primitive, type (POD struct). The vector and type are sufficiently large/complex that in the following,
std::vector<U> v;
v.resize(1000000000);
for(size_t i=0;i<v.size();++i){/* initialize v[i] */}
the resize
call is noticeably slow. And it's wasteful because resize
is default-initializing all those entries, then I'm going through in a loop and setting them all to their correct/useful values.
What I would like to do is to allocate all the memory for the vector, but not initialize any of the entries, then go through in parallel and initialize all the entries, e.g. with OpenMP
std::vector<U> v;
v.reserve(1000000000);
#pragma omp parallel for
for(size_t i=0;i<v.size();++i){/* initialize v[i] */}
However, reserve
doesn't actually change the size of v
, so I'd have to keep doing push_back
in my loop, which won't maintain the proper ordering of the elements (which matters in my use case); I really want to write something like v[i] = ...
in my loop body.
Is there a way to allocate/"initialize" a vector without initializing any of its elements, and to then fill in / initialize all the elements in parallel?
Your options are:
std::vector
with an alternative (e.g. uvector)After you've performed the resize, you can use OpenMP in the usual ways.