Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://www.tutorialspoint.com/cpp_standard_library/cpp_deque_push_back_function.htm below:

C++ Deque Push Back Function

The C++ std::deque::push_back() function is used to insert the element to the end of the deque, increasing its size by one. This function ensures that the existing elements maintain their order, and any required memory reallocation is managed internally.

This function has 2 polymorphic variants: with using the default version and the move version (you can find the syntaxes of all the variants below).

Following is the syntax for std::deque::push_back() function.

void push_back (const value_type& val);
or
void push_back (value_type&& val);

• val − It indicates the value to be inserted to the deque.

It does not return anything.

This function never throws exception.

The time complexity of this function is constant i.e. O(1)

In the following example, we are going to consider the basic usage of the push_back() function.

#include <iostream>
#include <deque>
int main()
{
    std::deque<char> a;
    a.push_back('A');
    a.push_back('B');
    a.push_back('C');
    for (auto x = a.begin(); x != a.end(); ++x) {
        std::cout << *x << " ";
    }
    std::cout << std::endl;
    return 0;
}

Output of the above code is as follows −

A B C 

Consider the another scenario, where we are going to use the push_back() function with strings.

#include <iostream>
#include <deque>
#include <string>
int main()
{
    std::deque<std::string> a;
    a.push_back("TP");
    a.push_back("TutorialsPoint");
    for (const auto& str : a) {
        std::cout << str << " ";
    }
    std::cout << std::endl;
    return 0;
}

Following is the output of the above code −

TP TutorialsPoint

Let's look at the following example, where we are going to append the elements to the existing deque.

#include <iostream>
#include <deque>
int main()
{
    std::deque<int> a = {01,12,23};
    a.push_back(34);
    a.push_back(45);
    for (auto x = a.begin(); x != a.end(); ++x) {
        std::cout << *x << " ";
    }
    std::cout << std::endl;
    return 0;
}

If we run the above code it will generate the following output −

1 12 23 34 45

deque.htm

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4