◐ Shell
clean mode source ↗

std::list<T,Allocator>::end, std::list<T,Allocator>::cend - cppreference.com

From cppreference.com

iterator end();
(1) (noexcept since C++11) 
const_iterator end() const;
(2) (noexcept since C++11) 
const_iterator cend() const noexcept;
(3) (since C++11)

Returns an iterator to the element following the last element of the list.

This element acts as a placeholder; attempting to access it results in undefined behavior.

Return value

Iterator to the element following the last element.

Complexity

Constant.

Notes

libc++ backports cend() to C++98 mode.

Example

#include <algorithm>
#include <cassert>
#include <iostream>
#include <numeric>
#include <string>
#include <list>

int main()
{
    std::list<int> nums{1, 2, 4, 8, 16};
    std::list<std::string> fruits{"orange", "apple", "raspberry"};
    std::list<char> empty;

    // Print list nums.
    std::for_each(nums.cbegin(), nums.cend(),
                  [](const int n) { std::cout << n << ' '; });
    std::cout << '\n';

    // Sum all integers in the list nums, printing only the result.
    std::cout << "Sum of nums: "
              << std::accumulate(nums.cbegin(), nums.cend(), 0) << '\n';

    // Print the first fruit in the list fruits, checking if there is any.
    if (!fruits.empty())
        std::cout << "First fruit: " << *fruits.cbegin() << '\n';

    if (empty.cbegin() == empty.cend())
        std::cout << "list ‘empty’ is indeed empty.\n";

    // Modify the first element in nums.
    *nums.begin() = 32;
    assert(*nums.cbegin() == 32);
}

Output: 

1 2 4 8 16
Sum of nums: 31
First fruit: orange
list ‘empty’ is indeed empty.

See also

returns an iterator to the beginning
(public member function) [edit]
returns an iterator to the end of a container or array
(function template) [edit]