std::deque<T,Allocator>::back
From cppreference.com
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Containers library
(C++17)
(C++11)
(C++26)
(C++26)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++23)
(C++23)
(C++23)
(C++23)
(C++20)
(C++23)
Tables
std::deque
(C++23)
deque::back
(C++11)
(C++11)
(C++11)
(C++11)
(DR*)
(C++23)
(C++11)
(C++23)
(C++11)
(C++23)
(until C++20)(until C++20)(until C++20)(until C++20)(until C++20)
Deduction guides (C++17)
reference back();
(1)
(constexpr since C++26)
const_reference back() const;
(2)
(constexpr since C++26)
Returns a reference to the last element in the container.
If empty() is true, the behavior is undefined.
(until C++26)If empty() is true:
- If the implementation is hardened, a contract violation occurs. Moreover, if the contract-violation handler returns under "observe" evaluation semantic, the behavior is undefined.
- If the implementation is not hardened, the behavior is undefined.
Contents
[edit] Return value
Reference to the last element.
[edit] Complexity
Constant.
[edit] Notes
For a non-empty container c, the expression c.back() is equivalent to *std::prev (c.end()).
[edit] Example
Run this code
#include <cassert> #include <deque> int main() { std::deque <char> letters{'a', 'b', 'c', 'd'}; assert (letters.back() == 'd'); }