//std::vector<int> vec; TinySTL::vector<int> vec; ProfilerInstance::start(); int i = 0; for (; i != 10000; ++i){	vec.push_back(i); } ProfilerInstance::finish(); ProfilerInstance::dumpDuringTime(); 

//std::vector<std::string> vec; TinySTL::vector<std::string> vec; ProfilerInstance::start(); int i = 0; for (; i != 100000; ++i){	vec.push_back(std::string("zouxiaohang")); } ProfilerInstance::finish(); ProfilerInstance::dumpDuringTime(); 

TinySTL::circular_buffer<int, 10000> cb(10000, 0); //boost::circular_buffer<int> cb(10000, 0); ProfilerInstance::start(); for (int i = 0; i != 10000000; ++i){	cb.push_back(i); } ProfilerInstance::finish(); ProfilerInstance::dumpDuringTime(); 

std::string str("abcdefghijklmnpqrstuvwxyz"); TinySTL::bitmap<26> bm; for (auto it = str.cbegin(); it != str.cend(); ++it){	bm.set(*it - 'a'); } cout << bm << endl; cout << bm.size() << endl; for (int i = 0; i != 26; ++i){	if (!bm.test(i))	cout << "字母" << (char)('a' + i) << "没出现！！！" << endl; } 

111111111111110111111111111000000 32 字母o没出现！！！ 

//std::string str; TinySTL::string str; ProfilerInstance::start(); int i = 0; for (; i != 1000000; ++i){	str.push_back('x'); } ProfilerInstance::finish(); ProfilerInstance::dumpDuringTime(); 

//std::priority_queue<int> pq; TinySTL::priority_queue<int> pq; ProfilerInstance::start(); int i = 0; for (; i != 100000; ++i){	pq.push(i); } ProfilerInstance::finish(); ProfilerInstance::dumpDuringTime(); 

TinySTL::vector<int> v; int i = 0; for (; i != 100000; ++i){	v.push_back(i); } //std::priority_queue<int> pq(v.begin(), v.end()); TinySTL::priority_queue<int> pq(v.begin(), v.end()); ProfilerInstance::start(); for (i = 0; i != 100000; ++i){	pq.pop(); } ProfilerInstance::finish(); ProfilerInstance::dumpDuringTime(); 

ifstream f; //char buff[256] = { 0 }; std::string word; f.open("C:\\Users\\zxh\\Desktop\\text.txt"); TinySTL::vector<TinySTL::string> v; while (f.good()){	f >> word;	//std::copy(word.begin(), word.end(), buff);	//v.push_back(TinySTL::string(buff, buff + word.size()));	v.push_back(word); } TinySTL::binary_search_tree<TinySTL::string> sbst; ProfilerInstance::start(); for (const auto& word : v){	sbst.insert(word); } ProfilerInstance::finish(); ProfilerInstance::dumpDuringTime(); f.close(); 

//std::deque<int> dq; TinySTL::deque<int> dq; ProfilerInstance::start(); const int max = 10000000; int i = 0; for (; i != max / 2; ++i){	dq.push_front(i); } for (; i != max; ++i){	dq.push_back(i); } ProfilerInstance::finish(); ProfilerInstance::dumpDuringTime(); 

binary_search_tree height = 10000 avl_tree height = 14 

TinySTL::list<int> list; //std::list<int> list; const size_t max = 100000; ProfilerInstance::start(); for (size_t i = 0; i != max; ++i)	list.push_back(i); ProfilerInstance::finish(); ProfilerInstance::dumpDuringTime(); 

TinySTL::list<int> list1; std::list<int> list2; std::default_random_engine dre; std::uniform_int_distribution<int> id; const size_t max = 10000; for (int i = 0; i != max; ++i){	auto n = id(dre);	list1.push_back(n);	list2.push_back(n); } double cost1 = 0.0, cost2 = 0.0; for (int i = 0; i != 100; ++i){	ProfilerInstance::start();	list1.sort();//TinySTL::list<int>	ProfilerInstance::finish();	cost1 += ProfilerInstance::millisecond();	ProfilerInstance::start();	list2.sort();//std::list<int>	ProfilerInstance::finish();	cost2 += ProfilerInstance::millisecond(); } cout << "TinySTL time: " << cost1 / 100 << "ms" << endl; cout << "std time: " << cost2 / 100 << "ms" << endl; 

char arr[] = { 'a', 'a', 'b', 'a', 'a', 'a', 'a', 'b' }; TinySTL::suffix_array sa(arr, 8); auto suffixArray = sa.suffixArray(); auto rankArray = sa.rankArray(); auto heightArray = sa.heightArray(); TinySTL::Test::print_container(suffixArray, "suffixArray"); TinySTL::Test::print_container(rankArray, "rankArray"); TinySTL::Test::print_container(heightArray, "heightArray"); 

TinySTL::Unordered_set<int> ust(10); //std::unordered_set<int> ust(10); const size_t insert_count = 1000000; const uint64_t query_count = 100000000; //calculate total insert time ProfilerInstance::start(); for (size_t i = 0; i != insert_count; ++i){	ust.insert(i);//per insert time } ProfilerInstance::finish(); ProfilerInstance::dumpDuringTime(); //calculate total query time ProfilerInstance::start(); for (uint64_t i = 0; i != query_count; ++i){	ust.count(i);//per query time } ProfilerInstance::finish(); ProfilerInstance::dumpDuringTime(); 

std::random_device rd; const int len = 10000000; int arr[len]; std::generate(std::begin(arr), std::end(arr), [&rd](){return rd(); }); ProfilerInstance::start(); TinySTL::sort(std::begin(arr), std::end(arr)); //std::sort(std::begin(arr), std::end(arr)); ProfilerInstance::finish(); ProfilerInstance::dumpDuringTime(); 

template<class Index, class Value> using dGraph = TinySTL::directed_graph < Index, Value > ; dGraph<int, int> g; dGraph<int, int>::nodes_set_type set1, set2, set3; set1.push_back(g.make_node(1, 11)); set1.push_back(g.make_node(2, 22)); set1.push_back(g.make_node(3, 33)); g.add_node(g.make_node(0, 0), set1); set2.push_back(g.make_node(5, 55)); set2.push_back(g.make_node(6, 66)); set2.push_back(g.make_node(7, 77)); g.add_node(g.make_node(1, 11), set2); set3.push_back(g.make_node(12, 1212)); set3.push_back(g.make_node(13, 1313)); set3.push_back(g.make_node(14, 1414)); g.add_node(7, set3); g.make_edge(12, 2); g.make_edge(12, 3); g.make_edge(12, 0); std::cout << "graph after add nodes:" << std::endl; std::cout << g.to_string(); auto func = [](const dGraph<int, int>::node_type& node){	std::cout << "[" << node.first << "," << node.second << "]" << std::endl; }; std::cout << "graph DFS from node(1, 11):" << std::endl; g.DFS(1, func); std::cout << "graph BFS from node(1, 11):" << std::endl; g.BFS(1, func); std::cout << "graph after delete node(7, 77):" << std::endl; g.delete_node(dGraph<int, int>::node_type(7, 77)); std::cout << g.to_string(); 

TinySTL::trie_tree t; std::ifstream in; in.open("C:\\Users\\zxh\\Desktop\\trie_tree_test.txt"); std::vector<std::string> v; std::string s; while (in){	in >> s;	v.push_back(s); } ProfilerInstance::start(); for (const auto& str : v){	t.insert(TinySTL::string(str.data())); } ProfilerInstance::finish(); std::cout << "build trie tree costs " << ProfilerInstance::millisecond() << "ms" << std::endl; ProfilerInstance::start(); auto res = t.get_word_by_prefix("v"); ProfilerInstance::finish(); std::cout << "get word by prefix \"v\" costs " << ProfilerInstance::millisecond() << "ms" << std::endl; auto i = 0; for (const auto& str : res){	++i;	if (i % 10 == 0) std::cout << std::endl;	std::cout << str << " "; } std::cout << std::endl; 

shared_ptr<string> sp1(new string("hello")); assert(sp1.use_count() == 1); assert(*sp1 == "hello"); sp1->append(" world"); assert(*sp1 == "hello world"); {	auto sp2 = sp1;	assert(sp1.use_count() == 2); } assert(sp1.use_count() == 1); 

auto up = make_unique<string>(10, '0'); up->append("111"); assert(*up == "0000000000111"); up.release(); assert(up == nullptr); up.reset(new string("hello")); assert(*up == "hello"); 

cow_ptr<string> cp1 = make_cow<string>("zouxiaohang"); auto cp2 = cp1, cp3 = cp1; assert(cp1 == cp2 && cp2 == cp3); assert(*cp1 == *cp2 && *cp2 == *cp3 && *cp3 == "zouxiaohang"); string s = *cp2;//read assert(s == "zouxiaohang"); assert(cp1 == cp2 && cp2 == cp3); assert(*cp1 == *cp2 && *cp2 == *cp3 && *cp3 == "zouxiaohang"); *cp2 = ("C++");//write assert(*cp1 == *cp3 && *cp3 == "zouxiaohang"); assert(*cp2 == "C++"); 

uf_set<10> uf; uf.Union(0, 1); uf.Union(2, 3); uf.Union(3, 1); assert(uf.Find(0) == uf.Find(2));