C++ Programming Code Examples
C++ > Visual C++ 5.0 Standard C++ Library Code Examples
Queue operatoreq - Equality operation on queues
Queue operatoreq - Equality operation on queues
operator==
Header
<queue>
template<class T, class Cont>
bool operator==(const queue<T, Cont>&q1, const queue<T, Cont>&q2) ;
Equality operation on queues. Returns true if the elements in q1 and q2 are elementwise equal.
The function returns the result of:
q1.c == q2.c
Sample
#include <iostream>
#include <queue>
int main()
{
std::queue<int> q1, q2, q3, q4 ;
int i ;
for (i = 0; i < 10; i++)
{
q1.push(i) ;
q2.push(i*i) ;
q3.push(i*i*i) ;
q4.push(i) ;
}
if (q1 == q4)
std::cout << "q1 == q4" << std::endl ;
if (q2 != q3)
std::cout << "q2 != q3" << std::endl ;
if(q2 < q3)
std::cout << "q2 < q3" << std::endl ;
if(q3 > q2)
std::cout << "q3 > q2" << std::endl ;
q4.push(29) ;
if (q1 <= q4)
std::cout << "after q4.push(29), q1 <= q4" << std::endl ;
if (q3 >= q2)
std::cout << "q3 >= q2" << std::endl ;
return 0 ;
}
Program Output
q1 == q4
q2 != q3
q2 < q3
q3 > q2
after q4.push(29), q1 <= q4
q3 >= q2
Inserts a new element at the end of the queue, after its current last element. The content of this new element is initialized to val. This member function effectively calls the member function push_back of the underlying container object. In C++ STL, Queue is a type of container that follows FIFO (First-in-First-Out) elements arrangement i.e. the elements which insert first will be removed first. In queue, elements are inserted at one end known as "back" and are deleted from another end known as "front". In the Data Structure, "push" is an operation to insert an element in any container, "pop" is an operation to remove an element from the container.
The C++ function std::queue::operator== tests whether two queues are equal or not. Comparison is done by applying corresponding operator to the underlying container. The C++ queue operator== function is used to check whether two queues are equal or not. It returns true if two queues are equal, else returns false. Function returns true if both queues are identical otherwise false. This member function never throws exception.
#include is a way of including a standard or user-defined file in the program and is mostly written at the beginning of any C/C++ program. This directive is read by the preprocessor and orders it to insert the content of a user-defined or system header file into the following program. These files are mainly imported from an outside source into the current program. The process of importing such files that might be system-defined or user-defined is known as File Inclusion. This type of preprocessor directive tells the compiler to include a file in the source code program.
FIFO queue. queues are a type of container adaptor, specifically designed to operate in a FIFO context (first-in first-out), where elements are inserted into one end of the container and extracted from the other. queues are implemented as containers adaptors, which are classes that use an encapsulated object of a specific container class as its underlying container, providing a specific set of member functions to access its elements. Elements are pushed into the "back" of the specific container and popped from its "front". The underlying container may be one of the standard container class template or some other specifically designed container class. This underlying container shall support at least the following operations:
A program shall contain a global function named main, which is the designated start of the program in hosted environment. main() function is the entry point of any C++ program. It is the point at which execution of program is started. When a C++ program is executed, the execution control goes directly to the main() function. Every C++ program have a main() function.
In computer programming, we use the if statement to run a block code only when a certain condition is met. An if statement can be followed by an optional else statement, which executes when the boolean expression is false. There are three forms of if...else statements in C++: • if statement, • if...else statement, • if...else if...else statement, The if statement evaluates the condition inside the parentheses ( ). If the condition evaluates to true, the code inside the body of if is executed. If the condition evaluates to false, the code inside the body of if is skipped.
In computer programming, loops are used to repeat a block of code. For example, when you are displaying number from 1 to 100 you may want set the value of a variable to 1 and display it 100 times, increasing its value by 1 on each loop iteration. When you know exactly how many times you want to loop through a block of code, use the for loop instead of a while loop. A for loop is a repetition control structure that allows you to efficiently write a loop that needs to execute a specific number of times.
Relational operators for queue. Performs the appropriate comparison operation between lhs and rhs. Relational Operators used with queue c++ STL are overloaded operators which are used to perform appropriate comparisons between two queue objects. The queues are compared element by element. Each of these operator overloads calls the same operator on the underlying container objects. Function returns true if the condition holds, and false otherwise.
A 'stack' is a basic "data structure" and can be defined in an 'Abstract', implementation-free manner, or it can be "Generally Defined" as a Linear List of items in which all additions and
This C++ example uses a class that contains a constructor used to 'initialize the object'. The class is called ShoeBox. When supplied with a Length, a Height, a Width, the object should
In C++, "Constructor" is automatically called when object ("instance of class") create. It is 'special member function' of the class. It has same name of class, must be public member
