栈:只有一个出口,stack允许新增元素,移除元素,取最顶端元素,但除了最顶端元素外,没有任何其他方法可以存取stack的其他元素。换言之stack不允许有遍历行为.
将元素放入栈中成为push,将元素推出stack的操作称为pop;
因为栈底层是通过deque实现的,所以他称之为适配器.
栈的使用方法如下所示;
//stack
/*
内部的实现方式是通过deque;
栈:先进后出
只有函数push\pop;没有push_front或者push_back
*/
#include<stack>
using std::stack;
namespace stl_stack
{
void test_deque(long& value)
{
stack<string> c;
char buf[10];
clock_t timeStart = clock();
for (long i = 0; i < value; ++i)
{
try {
sprintf(buf, "%d", rand());
c.push(string(buf));
}
catch (exception& p)
{
cout << "i=" << i << " " << p.what() << endl;
abort();
}
}
cout << "mill-seconds:" << clock() - timeStart << endl;
cout << "stack.size" << c.size() << endl;
cout << "stack.top" << c.top().c_str() << endl;//取栈顶元素
// cout << "list.max_size()" << c.max_size() << endl;
// cout << "list.fron" << c.front().c_str() << endl;
// cout << "list.back" << c.back().c_str() << endl;
// string target = get_a_target_string();
// timeStart = clock();
auto pItem = std::find(c.begin(), c.end(), target);
// cout << "find(),mill-seconds:" << clock() - timeStart << endl;
// if (pItem != c.end())
// cout << "found," << (*pItem).c_str() << endl;
// else
// cout << "not found" << endl;
// timeStart = clock();
// // c.sort();
// sort(c.begin(), c.end(), compareStrings);
// cout << "c.sort,mill-seconds:" << (clock() - timeStart) << endl;
c.pop();
cout << "stack.size" << c.size() << endl;
cout << "stack.top" << c.top().c_str() << endl;//取栈顶元素
}
}