queue.htm
来自「这是关于VC++中的STL容器的资料,包括了STL容器各个类之间关系以及类的说明」· HTM 代码 · 共 75 行
HTM
75 行
<html>
<head>
<title> The queue Class</title>
</head>
<body bgcolor="#FFFFFF">
<img src="queban.gif">
<pre>
<font size=5>Class Name</font> queue
<font size=5>Header File</font> <queue>
<font size=5>Classification</font> Container
</pre>
<a href="queue.htm#desc">Class Description</a><br>
<h1>Member Classes</h1>
<i>None</i>
<h1>Methods</h1>
<pre>
<a href="vector.htm#back">reference back()</a><br>
<a href="vector.htm#back">const_reference back() const</a><br>
<a href="common.htm#empty"><bool empty() const</a><br>
<a href="vector.htm#front">reference front()</a><br>
<a href="vector.htm#front">const_reference front() const</a><br>
<a href="common.htm#size">size_type size() const</a><br>
<a href="vector.htm#pushback">void push(const value_type& x)</a><br>
<a href="vector.htm#popfront">void pop()</a><br>
<a href="queue.htm#queue">explicit queue(const Container& = Container())</a><br>
</pre>
<h2><a href="operator.htm">Operators</h2></a><br>
<a name="desc"><h3>Class Description</h3></a>
<p>
A queue is a front to back ordering whose logical structure looks like a line.
In a queue the items are deleted from the front and inserted into the rear of the queue.
The queue is known as a FIFO (First In First Out) structure. This means that the first item
hat has been inserted will be the first item that will be removed.
</p>
<hr>
<pre>
<a name="queue">Method queue()</a>
Access Public
Classification Constructor
Syntax explicit queue(const Container &X = Container())
Parameters X is the container that will be used to construct the queue.
Return None
</pre>
<h3>Description</h3>
<p>
This queue() method constructs a queue that contains copies of elements in X.
</p>
<hr>
</body>
</html>
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?