C++ STL_list

stl中的list是双向链表，他的插入、移除、接合等操作并不会造成原有迭代器的实效（当然啦，指向被移除元素的那个得带器在移除操作发生之后肯定是会实效的）

使用参考代码如下

//双向链表
#include<list>
using std::list;
using std::find;
namespace stl_list
{
	void test_list(long& value)
	{
		list<string> c;
		char buf[10];
		clock_t timeStart = clock();
		for (long i = 0; i < value; ++i)
		{
			try {
				sprintf(buf, "%d", rand());
				c.push_back(string(buf));
			}
			catch (exception& p)
			{
				cout << "i=" << i << " " << p.what() << endl;
				abort();
			}
		}
		cout << "mill-seconds:" << clock() - timeStart << endl;
		cout << "list.size" << c.size() << 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();
		cout << "c.sort,mill-seconds:" << (clock() - timeStart) << endl;
	}
}