std::deque::pop_back(3)

🌸 NAME 🌸

okay so bestie, welcome to the C++ Standard Libary manual — yes, that spelling is literally in the header, we are leaving it — and today’s main character is std::deque::pop_back(3). 💖

std::deque::pop_back - std::deque::pop_back

---

✨ Synopsis ✨

void pop_back();

It removes the last element of the container. Like, the actual last one. No cap. 🎀

Calling pop_back on an empty container results in undefined behavior. do NOT do that, bestie — undefined behavior is not a vibe, it’s a whole glitch era. 💀

Iterators and references to the erased element are invalidated. The end() iterator is also invalidated. Other references and iterators are not affected. 🦋

---

🎀 Parameters 🎀

(none) — not a single parameter. Empty plate, clean hands. 🍽️

---

💖 Return value 💖

(none) — it doesn’t hand you anything back. It just does the thing and leaves. 💅

---

⭐ Complexity ⭐

Constant. That’s it. One little pop, constant energy. ✨

---

🦋 Exceptions 🦋

Throws nothing. Zero exceptions. Unbothered, moisturized, in its lane. 🧚

---

🌈 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)

---

xoxo, your Unix bestie 💖 — source: http://cppreference.com, version/date: 2024.06.10.