📄 stack.htm
字号:
<html>
<head>
<title> The stack Class</title>
</head>
<body bgcolor="#FFFFFF">
<img src="stacban.gif">
<pre>
<font size=5>Class Name</font> stack
<font size=5>Header File</font> <stack>
<font size=5>Classification</font> Container
</pre>
<a href="stack.htm#desc">Class Description</a><br>
<h1>Member Classes</h1>
<i>None</i>
<h1>Methods</h1>
<pre>
<a href="common.htm#empty">bool empty() 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#popback">void pop()</a><br>
<a href="stack.htm#stack">explicit stack(const Container& = Container())</a><br>
<a href="vector.htm#back">value_type& top()</a><br>
<a href="vector.htm#back">const value_type& top() const</a><br>
</pre>
<h2><a href="operator.htm">Operators</h2></a><br>
<hr>
<a name="desc"><h3>Class Description</h3></a>
<p>
Stacks are containers that can hold a arbitrary number of objects.
Stacks are dynamic containers. When objects are inserted into a stack the stack's
size grows. When objects are removed from a stack the stack size shrinks. The stack
is a restricted access container. Objects may only be removed from a stack one at a time.
The stack is known as a LIFO (Last In First Out) structure. The first item inserted into
a stack is the last item removed, and the last item inserted is the first item removed.
</p>
<hr>
<pre>
<a name="stack">Method stack</a>
Access Public
Classification Constructor
Syntax explicit stack(const Container &X = Container())
Parameters X is a container that will be used to construct a new
stack object.
Return None
</pre>
<h3>Description</h3>
<p>
This stack() method constructs a stack that contains copies of elements in X.
</p>
<hr>
</body>
</html>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -