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

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

C++ Deque: begin() Function

The C++ std::deque::begin() function is used to return an iterator pointing to the first element of the deque. This iterator can be used to traverse the deque from the beginning. It is commonly used in conjuction with other iterator functions like end().

For const deque, begin() function returns an const_iterator, ensuring the elements pointed by the iterator can't be modified.

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

iterator begin() noexcept;
const_iterator begin() const noexcept;

It does not accept any parameters.

This function returns an iterator to the beginning of the sequenece container.

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 begin() function.

#include <iostream>
#include <deque>
int main()
{
    std::deque<char> x = {'A', 'B', 'C', 'D'};
    std::deque<char>::iterator a = x.begin();
    std::cout << "First Element : " << *a << std::endl;
    return 0;
}

Output of the above code is as follows −

First Element : A

Consider the following example, where we are going to modify the first element.

#include <iostream>
#include <deque>
int main()
{
    std::deque<char> x = {'Y', 'B', 'C', 'D'};
    std::deque<char>::iterator y = x.begin();
    *y = 'A';
    for (char elem : x) {
        std::cout << elem << " ";
    }
    return 0;
}

Following is the output of the above code −

A B C D

Let's look at the following example, where we are going to insert elements at the beginning.

#include <iostream>
#include <deque>
int main()
{
    std::deque<int> a = {333,4444};
    a.insert(a.begin(), 22);
    a.insert(a.begin(), 1);
    for (int elem : a) {
        std::cout << elem << " ";
    }
    return 0;
}

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

1 22 333 4444 

Following is the example, where we are going to erase the firt element.

#include <iostream>
#include <deque>
int main()
{
    std::deque<char> a = {'A', 'B', 'C', 'D'};
    a.erase(a.begin());
    for (char elem : a) {
        std::cout << elem << " ";
    }
    return 0;
}

Let us compile and run the above program, this will produce the following result −

B C D 

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