What's the best way for setting an std::vector<int>
to a range, e.g. all numbers between 3 and 16?
Set std::vector<int> to a range
62.9k views Asked by Andreas At
6
There are 6 answers
3
On
See e.g. this question
#include <algorithm>
#include <iostream>
#include <iterator>
#include <vector>
template<class OutputIterator, class Size, class Assignable>
void iota_n(OutputIterator first, Size n, Assignable value)
{
std::generate_n(first, n, [&value]() {
return value++;
});
}
int main()
{
std::vector<int> v; // no default init
v.reserve(14); // allocate 14 ints
iota_n(std::back_inserter(v), 14, 3); // fill them with 3...16
std::for_each(v.begin(), v.end(), [](int const& elem) {
std::cout << elem << "\n";
});
return 0;
}
Output on Ideone
1
On
std::iota - is useful, but it requires iterator, before creation vector, .... so I take own solution.
#include <iostream>
#include <vector>
template<int ... > struct seq{ typedef seq type;};
template< typename I, typename J> struct add;
template< int...I, int ...J>
struct add< seq<I...>, seq<J...> > : seq<I..., (J+sizeof...(I)) ... >{};
template< int N>
struct make_seq : add< typename make_seq<N/2>::type,
typename make_seq<N-N/2>::type > {};
template<> struct make_seq<0>{ typedef seq<> type; };
template<> struct make_seq<1>{ typedef seq<0> type; };
template<int start, int step , int ... I>
std::initializer_list<int> range_impl(seq<I... > )
{
return { (start + I*step) ...};
}
template<int start, int finish, int step = 1>
std::initializer_list<int> range()
{
return range_impl<start, step>(typename make_seq< 1+ (finish - start )/step >::type {} );
}
int main()
{
std::vector<int> vrange { range<3, 16>( )} ;
for(auto x : vrange)std::cout << x << ' ';
}
Output:
3 4 5 6 7 8 9 10 11 12 13 14 15 16
1
On
Since C++ 23, ranges::iota
can be used.
#include <vector>
#include <numeric>
int main() {
int start = 3, end = 16;
std::vector<int> v(end - start + 1); // initialize with 14 zeros
std::ranges::iota(v, start); // fill with consecutive integers starting from 3
// v={3,4,5,...,3+14-1}
}
Alternatively, to add elements starting from an empty vector
, ranges::generate_n
can be used (since C++ 20) in conjunction with a back_inserter
.
The following example also can be easily modified to use a different step than 1.
#include <vector>
#include <algorithm>
#include <iterator>
#include <iostream> // only used for output in this example
int main() {
int start = 3, end = 16;
int len = end - start + 1;
std::vector<int> v;
v.reserve(len); // allocate enough space for elements
std::ranges::generate_n(std::back_inserter(v), len,
[i=start]() mutable {return i++;});
std::ranges::copy(v, std::ostream_iterator<int>(std::cout, " ")); // output
}
You could use
std::iota
if you have C++11 support or are using the STL:or implement your own if not.
If you can use
boost
, then a nice option isboost::irange
: