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

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

C++ Deque Library - deque() Function

The C++ range constructor std::deque::deque() Constructs a deque with as many elements as in range of first to last. Storage requirement for this container is fulfilled by internal allocator.

Following is the declaration for std::deque::deque() constructor form std::deque header.

template <class InputIterator>
deque (InputIterator first, InputIterator last,
       const allocator_type& alloc = allocator_type());

template <class InputIterator>
deque (InputIterator first, InputIterator last,
       const allocator_type& alloc = allocator_type());

• alloc − The storage allocator.

• first − Input iterator to the initial position in range.

• last − Input iterator to the final position in range.

Constructor never returns value.

If range specified by first and last is not valid then result is undefined.

Linear i.e. O(n)

The following example shows the usage of std::deque::deque() constructor.

#include <iostream>
#include <deque>

using namespace std;

int main(void) {

   deque<int> d1 = {1, 2, 3, 4, 5};
   deque<int> d2(d1.begin(), d1.begin() + 3);

   cout << "Contents of deque are" << endl;

   for (int i = 0; i < d2.size(); ++i)
      cout << d2[i] << endl;

   return 0;
}

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

Contents of deque are
1
2
3

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