Can std::begin work with array parameters and if so, how?

by

Yes, std::begin and std::end can work with parameters that are C style arrays.

The trick is in passing a parameter that’s a C style array. When you specify a 1D array as a normal parameter to a normal function, its type is silently adjusted from “array of T” to “pointer to T”. When you call that function, what gets passed isn’t the array (as an array), but a pointer to the first element of the array.

It is, however, possible to pass an array by reference to a function template:

template <class T, size_t N>
void function(T (&array)[N]) {
   // function body here
}

In this case, where you’re passing an actual array (albeit, by reference) rather than a pointer, you can use std::begin and std::end perfectly well. For example:

template <class T, size_t N>
T sum(T (&array)[N]) { 
    return std::accumulate(std::begin(array), std::end(array), T());
}

Now passing an array is trivial, such as:

int array[] = {1, 2, 3, 4};

auto total = sum(array);

std::begin and std::end themselves are (or at least can be) implemented similarly to sum–the array is passed by reference, so they can look something like this:

template <class T, size_t N>
T *begin(T (&array)[N]) { 
    return array; 
}

template <class T, size_t N>
T *end(T (&array)[N]) {
    return array + N;
}

Note that although these were added to the standard more recently, they don’t require any particularly tricky use of templates, so the implementation above should work fine with a plain old C++98 compiler (and, if memory serves, even with pre-standard compilers such as VC++ 6).

More Related Contents:

  1. C++ – Find numbers between first and last negative numbers in Array
  2. What’s the difference between “STL” and “C++ Standard Library”?
  3. Is std::vector so much slower than plain arrays?
  4. Why use iterators instead of array indices?
  5. What happens if you call erase() on a map element while iterating from begin to end?
  6. Deleting elements from std::set while iterating
  7. How to initialize std::vector from C-style array?
  8. Removing item from vector while iterating?
  9. comparing iterators from different containers
  10. Sorting a vector in descending order
  11. How are iterators and pointers related?
  12. What’s faster, iterating an STL vector with vector::iterator or with at()?
  13. What is the difference between const_iterator and non-const iterator in the C++ STL?
  14. What is an iterator’s default value?
  15. Custom Iterator in C++
  16. Why is “!=” used with iterators instead of “
  17. how portable is end iterator decrement?
  18. array vs vector vs list
  19. How do I store arrays in an STL list?
  20. How does std::copy work with stream iterators
  21. Why does a push_back on an std::list change a reverse iterator initialized with rbegin?
  22. Can raw pointers be used instead of iterators with STL algorithms for containers with linear storage?
  23. What happens if you increment an iterator that is equal to the end iterator of an STL container
  24. How do I erase elements from STL containers?
  25. Are const_iterators faster?
  26. Converting between C++ std::vector and C array without copying
  27. How to check that the passed Iterator is a random access iterator?
  28. Syntax for using std::greater when calling std::sort in C++
  29. what is the difference between const_iterator and iterator? [duplicate]
  30. What’s the time complexity of iterating through a std::set/std::map?

Leave a Comment