Is there a way to iterate over at most N elements using range-based for loop?

by

As I personally would use either this or this answer (+1 for both), just for increasing your knowledge – there are boost adapters you can use. For your case – the sliced seems the most appropriate:

#include <boost/range/adaptor/sliced.hpp>
#include <vector>
#include <iostream>

int main(int argc, const char* argv[])
{
    std::vector<int> input={1,2,3,4,5,6,7,8,9};
    const int N = 4;
    using boost::adaptors::sliced;
    for (auto&& e: input | sliced(0, N))
        std::cout << e << std::endl;
}

One important note: N is required by sliced to be not greater than distance(range) – so safer(and slower) version is as follows:

    for (auto&& e: input | sliced(0, std::min(N, input.size())))

So – once again – I would use simpler, old C/C++ approach (this you wanted to avoid in your question 😉

Related Contents:

  1. Why no emplacement iterators in C++11 or C++14?
  2. push_back vs emplace_back
  3. Is std::unique_ptr required to know the full definition of T?
  4. Why can I not push_back a unique_ptr into a vector?
  5. Why use non-member begin and end functions in C++11?
  6. Lambda capture as const reference?
  7. Does C++11, 14, 17 or 20 introduce a standard constant for pi?
  8. Differences between std::make_unique and std::unique_ptr with new
  9. Modern way to filter STL container?
  10. What exception classes are in the standard C++ library
  11. error::make_unique is not a member of ‘std’
  12. Is C++14 adding new keywords to C++?
  13. Is gcc std::unordered_map implementation slow? If so – why?
  14. When is a private constructor not a private constructor?
  15. What is const void?
  16. Default, value and zero initialization mess
  17. Why is the C++ initializer_list behavior for std::vector and std::array different?
  18. Does the range-based ‘for’ loop deprecate many simple algorithms?
  19. C++11 std::set lambda comparison function
  20. What is the default hash function used in C++ std::unordered_map?
  21. C++11 std::to_string(double) – No trailing zeros
  22. C++ priority_queue with lambda comparator error
  23. Constant-sized vector
  24. Why do I get the same sequence for every run with std::random_device with mingw gcc4.8.1?
  25. Parallel Loops in C++
  26. Capturing perfectly-forwarded variable in lambda
  27. How can I use Standard Library (STL) classes in my dll interface or ABI?
  28. std::map emplace without copying value
  29. Has C++ standard changed with respect to the use of indeterminate values and undefined behavior in C++14?
  30. Is x = std::move(x) undefined?
  31. Why can’t simple initialize (with braces) 2D std::array? [duplicate]
  32. What is the rationale behind decltype behavior?
  33. How does Eric Niebler’s implementation of std::is_function work?
  34. Implementation C++14 make_integer_sequence
  35. Can the ‘type’ of a lambda expression be expressed?
  36. Using std::make_unique with a custom deleter
  37. Why vector access operators are not specified as noexcept?
  38. error: anachronistic old-style base class initializer
  39. Set std::vector to a range
  40. How to correctly use std::reference_wrappers
  41. Use the auto keyword in C++ STL
  42. Raw pointer lookup for sets of unique_ptrs
  43. How to iterate over a C++ STL map data structure using the ‘auto’ keyword?
  44. Is there a reason for zero sized std::array in C++11?
  45. Converting std::unique_ptr to std::unique_ptr
  46. std::ignore for ignoring unused variable
  47. Why can const members be modified in a constructor?
  48. The std::transform-like function that returns transformed container
  49. Is the specification of `bsearch` in C++11 & C++14 defective?
  50. What is the easiest way to print a variadic parameter pack using std::ostream?

Leave a Comment