table of contents
std::deque::pop_back(3) | C++ Standard Libary | std::deque::pop_back(3) |
NAME¶
std::deque::pop_back - std::deque::pop_back
Synopsis¶
void pop_back();
Removes the last element of the container.
Calling pop_back on an empty container results in undefined behavior.
Iterators and references to the erased element are invalidated. It is
unspecified whether the past-the-end iterator is invalidated. Other (until
C++11)
references and iterators are not affected.
Iterators and references to the erased element are invalidated. The
past-the-end iterator is also invalidated. Other references and (since
C++11)
iterators are not affected.
Parameters¶
(none)
Return value¶
(none)
Complexity¶
Constant.
Exceptions¶
Throws nothing.
Example¶
// Run this code
#include <deque>
#include <iostream>
template<typename T>
void print(T const & xs)
{
std::cout << "[ ";
for(auto const & x : xs) {
std::cout << x << ' ';
}
std::cout << "]\n";
}
int main()
{
std::deque<int> numbers;
print(numbers);
numbers.push_back(5);
numbers.push_back(3);
numbers.push_back(4);
print(numbers);
numbers.pop_back();
print(numbers);
}
Output:¶
[ ]
[ 5 3 4 ]
[ 5 3 ]
See also¶
pop_front removes the first element
(public member function)
push_back adds an element to the end
(public member function)
2022.07.31 | http://cppreference.com |