当前位置：网站首页>Chapter XI queue of STL

Chapter XI queue of STL

2022-07-19 09:32:00 【qq_ forty-three million two hundred and five thousand two hundr】

1 queue Basic concepts

Concept ：Queue It's a kind of fifo (First In First Out,FIFO) Data structure of , It has two exits

The queue container allows you to add elements from one end , Remove elements from the other end

Only the head and tail of the queue can be used by the outside world , So the queue does not allow traversal behavior

The data in the queue is called --- The team push

The data out of the queue is called --- Out of the team pop

2 queue Common interfaces

Function description ： Stack container common external interface

Constructors ：

queue<T> que; //queue Using template class to achieve ,queue Object's default construction form

queue(const queue &que); // copy constructor

Assignment operation ：

queue& operator=(const queue &que); // Overload the equal sign operator

Data access ：

push(elem); // Add elements to the end of the team

pop(); // Remove the first element from the team leader

back(); // Return to the last element

front(); // Returns the first element

Size operation ：

empty(); // Determine if the stack is empty

size(); // Return the stack size

Example ：

#include <queue> 
#include <string> 
class Person 
{
public: 
	Person(string name, int age) 
	{ 
		this->m_Name = name; 
		this->m_Age = age; 
	}
	string m_Name; int m_Age;
};

void test01() 
{ 
	// Create a queue  
	queue<Person> q; 
	// Prepare the data  
	Person p1(" Tang's monk ", 30);
	Person p2(" The Monkey King ", 1000); 
	Person p3(" Pig eight quit ", 900); 
	Person p4(" Monk sha ", 800);

	// Add elements to the queue   Joining operation  
	q.push(p1); 
	q.push(p2);
	q.push(p3);
	q.push(p4); 
	
	// The queue does not provide an iterator , Random access is not supported  
	while (!q.empty()) 
	{
		// Output team head element  
		cout << " Team leader element --  full name ： " << q.front().m_Name << "  Age ： "<< q.front().m_Age << endl;
		cout << " Team tail element --  full name ： " << q.back().m_Name << "  Age ： " << q.back().m_Age << endl;
		cout << endl;
		
		// Pop team leader element  
		q.pop(); 
	}
	
	cout << " The queue size is ：" << q.size() << endl; 
}

int main() 
{ 
	test01(); 
	return 0; 
}

Output results ：

 Team leader element --  full name ：  Tang's monk   Age ： 30
 Team tail element --  full name ：  Monk sha   Age ： 800

 Team leader element --  full name ：  The Monkey King   Age ： 1000
 Team tail element --  full name ：  Monk sha   Age ： 800

 Team leader element --  full name ：  Pig eight quit   Age ： 900
 Team tail element --  full name ：  Monk sha   Age ： 800

 Team leader element --  full name ：  Monk sha   Age ： 800
 Team tail element --  full name ：  Monk sha   Age ： 800

 The queue size is ：0

summary ：

The team --- push

Out of the team --- pop

Return to team leader element --- front

Return to the end of the team --- back

Determine whether the team is empty --- empty

Return queue size --- size

原网站

版权声明
本文为[qq_ forty-three million two hundred and five thousand two hundr]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/200/202207171023056883.html