- The C Standard Library
- The C Standard Library
- The C++ Standard Library
- C++ Library - Home
- C++ Library - <fstream>
- C++ Library - <iomanip>
- C++ Library - <ios>
- C++ Library - <iosfwd>
- C++ Library - <iostream>
- C++ Library - <istream>
- C++ Library - <ostream>
- C++ Library - <sstream>
- C++ Library - <streambuf>
- C++ Library - <atomic>
- C++ Library - <complex>
- C++ Library - <exception>
- C++ Library - <functional>
- C++ Library - <limits>
- C++ Library - <locale>
- C++ Library - <memory>
- C++ Library - <new>
- C++ Library - <numeric>
- C++ Library - <regex>
- C++ Library - <stdexcept>
- C++ Library - <string>
- C++ Library - <thread>
- C++ Library - <tuple>
- C++ Library - <typeinfo>
- C++ Library - <utility>
- C++ Library - <valarray>
- The C++ STL Library
- C++ Library - <array>
- C++ Library - <bitset>
- C++ Library - <deque>
- C++ Library - <forward_list>
- C++ Library - <list>
- C++ Library - <map>
- C++ Library - <queue>
- C++ Library - <set>
- C++ Library - <stack>
- C++ Library - <unordered_map>
- C++ Library - <unordered_set>
- C++ Library - <vector>
- C++ Library - <algorithm>
- C++ Library - <iterator>
- C++ Programming Resources
- C++ Programming Tutorial
- C++ Useful Resources
- C++ Discussion
C++ Queue Library - queue() Function
Description
The C++ copy constructor std::queue::queue() constructs a queue with copy of each elements present in existing queue other.
Declaration
Following is the declaration for copy constructor std::queue::queue() form std::queue header.
C++11
queue( queue& other );
Parameters
other − Another queue object of same type.
Return value
Constructor never returns value.
Exceptions
This member function never throws exception.
Time complexity
Linear i.e. O(n)
Example
The following example shows the usage of std::queue::queue() function.
#include <iostream> #include <queue> #include <list> using namespace std; int main(void) { auto it = {1, 2, 3, 4, 5}; queue<int> q1(it); queue<int>q2(q1); cout << "Contents of q1" << endl; while (!q1.empty()) { cout << q1.front() << endl; q1.pop(); } cout << endl; cout << "Contents of q2" << endl; while (!q2.empty()) { cout << q2.front() << endl; q2.pop(); } return 0; }
Let us compile and run the above program, this will produce the following result −
Contents of q1 1 2 3 4 5 Contents of q2 1 2 3 4 5
queue.htm
Advertisements