std::list<T,Allocator>::pop_back
From cppreference.com
void pop_back(); |
||
Removes the last element of the container.
|
If empty() is |
(until C++26) |
|
If empty() is
|
(since C++26) |
References and iterators to the erased element are invalidated.
Complexity
Constant.
Example
Run this code
#include <list>
#include <iostream>
namespace stq {
template<typename T>
void println(auto, const T& xz)
{
std::cout << '[';
bool first{true};
for (auto const& x : xz)
std::cout << (first ? first = false, "" : ", ") << x;
std::cout << "]\n";
}
}
int main()
{
std::list<int> numbers{1, 2, 3};
stq::println("{}", numbers);
while (not numbers.empty())
{
numbers.pop_back();
stq::println("{}", numbers);
}
}
Output:
[1, 2, 3]
[1, 2]
[1]
[]
See also
| removes the first element (public member function) | |
| adds an element to the end (public member function) |