- 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 - operator= Function
Description
The C++ function std::priority_queue::operator= assign new contents to the priority_queue by replacing old ones and modifies size if necessary.
Declaration
Following is the declaration for std::priority_queue::operator= function form std::queue header.
C++98
priority_queue<T, Container>& operator=( const priority_queue<T,Container>& other );
Parameters
other − Another priority_queue object of same type.
Return value
Returns this pointer.
Exceptions
This member function never throws exception.
Time complexity
Linear i.e. O(n)
Example
The following example shows the usage of std::priority_queue::operator= function.
#include <iostream> #include <queue> using namespace std; int main(void) { auto it1 = {3, 1, 5, 2, 4}; auto it2 = {3, 1, 5}; priority_queue<int> q1(less<int>(), it1); priority_queue<int> q2(less<int>(), it2); q1 = q2; cout << "Contents of q1" << endl; while (!q1.empty()) { cout << q1.top() << endl; q1.pop(); } cout << "Contents of q2" << endl; while (!q2.empty()) { cout << q2.top() << endl; q2.pop(); } return 0; }
Let us compile and run the above program, this will produce the following result −
Contents of q1 5 3 1 Contents of q2 5 3 1
queue.htm
Advertisements