std::deque<T,Allocator>::begin, std::deque<T,Allocator>::cbegin

iterator begin();
(until C++11)
iterator begin() noexcept;
(since C++11)
const_iterator begin() const;
(until C++11)
const_iterator begin() const noexcept;
(since C++11)
const_iterator cbegin() const noexcept;
(3) (since C++11)

Returns an iterator to the first element of the deque.

If the deque is empty, the returned iterator will be equal to end().




Return value

Iterator to the first element.




#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <deque>
int main()
    std::deque<int> nums {1, 2, 4, 8, 16};
    std::deque<std::string> fruits {"orange", "apple", "raspberry"};
    std::deque<char> empty;
    // Print deque.
    std::for_each(nums.begin(), nums.end(), [](const int n) { std::cout << n << ' '; });
    std::cout << '\n';
    // Sums all integers in the deque nums (if any), printing only the result.
    std::cout << "Sum of nums: "
              << std::accumulate(nums.begin(), nums.end(), 0) << '\n';
    // Prints the first fruit in the deque fruits, checking if there is any.
    if (!fruits.empty())
        std::cout << "First fruit: " << *fruits.begin() << '\n';
    if (empty.begin() == empty.end())
        std::cout << "deque 'empty' is indeed empty.\n";


1 2 4 8 16
Sum of nums: 31
First fruit: orange
deque 'empty' is indeed empty.

See also

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

© cppreference.com
Licensed under the Creative Commons Attribution-ShareAlike Unported License v3.0.