侯捷STL学习(二)

第六节：容器之分类和各种测试（四）

stack不提供iterator操作，破坏了容器的独特性，先进先出。

使用容器multiset（允许元素重复）

内部是红黑树，insert操作就保证了排好了序。
标准库有个：：find()函数，大家都可以用。容器本身也有一个c.find()，通过键值对查找非常快！
测试

#include <set>

#include <stdexcept>

#include <string>

#include <cstdlib> //abort()

#include <cstdio>  //snprintf()

#include <iostream>

#include <ctime>

namespace jj06

{

void test_multiset(long& value)

{

	cout << "\ntest_multiset().......... \n";

multiset<string> c;

char buf[10];

clock_t timeStart = clock();

    for(long i=0; i< value; ++i)

    {

    	try {

    		snprintf(buf, 10, "%d", rand());

        	c.insert(string(buf));

		}

		catch(exception& p) {

			cout << "i=" << i << " " << p.what() << endl;

			abort();

		}

	}

	cout << "milli-seconds : " << (clock()-timeStart) << endl;

	cout << "multiset.size()= " << c.size() << endl;

	cout << "multiset.max_size()= " << c.max_size() << endl;	//214748364

string target = get_a_target_string();

	{

    timeStart = clock();

auto pItem = find(c.begin(), c.end(), target);	//比 c.find(...) 慢很多

	cout << "std::find(), milli-seconds : " << (clock()-timeStart) << endl;

	if (pItem != c.end())

    	cout << "found, " << *pItem << endl;

  	else

    	cout << "not found! " << endl;

 	}

 	{

    timeStart = clock();

auto pItem = c.find(target);		//比 std::find(...) 快很多

	cout << "c.find(), milli-seconds : " << (clock()-timeStart) << endl;

	if (pItem != c.end())

    	cout << "found, " << *pItem << endl;

  	else

    	cout << "not found! " << endl;

 	}	

	c.clear();

	test_moveable(multiset<MyString>(),multiset<MyStrNoMove>(), value);

}

}

使用容器multimap（允许元素重复）

内部是红黑树，key-value键值对。
multiset不可用[]做insertion
c.insert(pair<long,string>(i,buff))
(*pItem).second
测试

#include <map>

#include <stdexcept>

#include <string>

#include <cstdlib> //abort()

#include <cstdio>  //snprintf()

#include <iostream>

#include <ctime>

namespace jj07

{

void test_multimap(long& value)

{

	cout << "\ntest_multimap().......... \n";

multimap<long, string> c;

char buf[10];

clock_t timeStart = clock();

    for(long i=0; i< value; ++i)

    {

    	try {

    		snprintf(buf, 10, "%d", rand());

    		//multimap 不可使用 [] 做 insertion

        	c.insert(pair<long,string>(i,buf));

		}

		catch(exception& p) {

			cout << "i=" << i << " " << p.what() << endl;

			abort();

		}

	}

	cout << "milli-seconds : " << (clock()-timeStart) << endl;

	cout << "multimap.size()= " << c.size() << endl;

	cout << "multimap.max_size()= " << c.max_size() << endl;	//178956970	

long target = get_a_target_long();

    timeStart = clock();

auto pItem = c.find(target);

	cout << "c.find(), milli-seconds : " << (clock()-timeStart) << endl;

	if (pItem != c.end())

    	cout << "found, value=" << (*pItem).second << endl;

  	else

    	cout << "not found! " << endl;	  

	c.clear();

}

}

使用unordered_multiset容器

使用hashtable使用分离链地址方法实现
gnu C之前的名称hash_multiset
unorder_multiset.bucket_count篮子的个数
load_factor,max_load_factor,max_bucket_count方法
篮子后面的链表不能太长，元素的个数大于等于篮子的个数，就需要重新分配篮子的大小，重新进行插入元素
c.find()容器自身的find操作快很多
测试

#include <unordered_set>

#include <stdexcept>

#include <string>

#include <cstdlib> //abort()

#include <cstdio>  //snprintf()

#include <iostream>

#include <ctime>

namespace jj08

{

void test_unordered_multiset(long& value)

{

	cout << "\ntest_unordered_multiset().......... \n";

unordered_multiset<string> c;

char buf[10];

clock_t timeStart = clock();

    for(long i=0; i< value; ++i)

    {

    	try {

    		snprintf(buf, 10, "%d", rand());

        	c.insert(string(buf));

		}

		catch(exception& p) {

			cout << "i=" << i << " " << p.what() << endl;

			abort();

		}

	}

	cout << "milli-seconds : " << (clock()-timeStart) << endl;

	cout << "unordered_multiset.size()= " << c.size() << endl;

	cout << "unordered_multiset.max_size()= " << c.max_size() << endl;	//357913941

	cout << "unordered_multiset.bucket_count()= " << c.bucket_count() << endl;

	cout << "unordered_multiset.load_factor()= " << c.load_factor() << endl;

	cout << "unordered_multiset.max_load_factor()= " << c.max_load_factor() << endl;

	cout << "unordered_multiset.max_bucket_count()= " << c.max_bucket_count() << endl;

  	for (unsigned i=0; i< 20; ++i) {

    	cout << "bucket #" << i << " has " << c.bucket_size(i) << " elements.\n";

  	}					

string target = get_a_target_string();

	{

    timeStart = clock();

auto pItem = find(c.begin(), c.end(), target);	//比 c.find(...) 慢很多

	cout << "std::find(), milli-seconds : " << (clock()-timeStart) << endl;

	if (pItem != c.end())

    	cout << "found, " << *pItem << endl;

  	else

    	cout << "not found! " << endl;

 	}

 	{

    timeStart = clock();

auto pItem = c.find(target);		//比 std::find(...) 快很多

	cout << "c.find(), milli-seconds : " << (clock()-timeStart) << endl;

	if (pItem != c.end())

    	cout << "found, " << *pItem << endl;

  	else

    	cout << "not found! " << endl;

 	}		

    c.clear();

	test_moveable(unordered_multiset<MyString>(),unordered_multiset<MyStrNoMove>(), value);

}

}

使用unordered_multimap容器

测试

#include <unordered_map>

#include <stdexcept>

#include <string>

#include <cstdlib> //abort()

#include <cstdio>  //snprintf()

#include <iostream>

#include <ctime>

namespace jj09

{

void test_unordered_multimap(long& value)

{

	cout << "\ntest_unordered_multimap().......... \n";

unordered_multimap<long, string> c;

char buf[10];

clock_t timeStart = clock();

    for(long i=0; i< value; ++i)

    {

    	try {

    		snprintf(buf, 10, "%d", rand());

			//multimap 不可使用 [] 進行 insertion

			c.insert(pair<long,string>(i,buf));

		}

		catch(exception& p) {

			cout << "i=" << i << " " << p.what() << endl;

			abort();

		}

	}

	cout << "milli-seconds : " << (clock()-timeStart) << endl;

	cout << "unordered_multimap.size()= " << c.size() << endl;

	cout << "unordered_multimap.max_size()= " << c.max_size() << endl;	//357913941	

long target = get_a_target_long();

    timeStart = clock();

auto pItem = c.find(target);

	cout << "c.find(), milli-seconds : " << (clock()-timeStart) << endl;

	if (pItem != c.end())

    	cout << "found, value=" << (*pItem).second << endl;

  	else

    	cout << "not found! " << endl;

}

}

使用set容器

不允许元素重复

#include <set>

#include <stdexcept>

#include <string>

#include <cstdlib> //abort()

#include <cstdio>  //snprintf()

#include <iostream>

#include <ctime>

namespace jj13

{

void test_set(long& value)

{

	cout << "\ntest_set().......... \n";

set<string> c;

char buf[10];

clock_t timeStart = clock();

    for(long i=0; i< value; ++i)

    {

    	try {

    		snprintf(buf, 10, "%d", rand());

        	c.insert(string(buf));

		}

		catch(exception& p) {

			cout << "i=" << i << " " << p.what() << endl;

			abort();

		}

	}

	cout << "milli-seconds : " << (clock()-timeStart) << endl;

	cout << "set.size()= " << c.size() << endl;

	cout << "set.max_size()= " << c.max_size() << endl;	   //214748364

string target = get_a_target_string();

	{

    timeStart = clock();

auto pItem = find(c.begin(), c.end(), target);	//比 c.find(...) 慢很多

	cout << "std::find(), milli-seconds : " << (clock()-timeStart) << endl;

	if (pItem != c.end())

    	cout << "found, " << *pItem << endl;

  	else

    	cout << "not found! " << endl;

 	}

 	{

    timeStart = clock();

auto pItem = c.find(target);		//比 std::find(...) 快很多

	cout << "c.find(), milli-seconds : " << (clock()-timeStart) << endl;

	if (pItem != c.end())

    	cout << "found, " << *pItem << endl;

  	else

    	cout << "not found! " << endl;

 	}

}

}

使用map容器

不允许元素键重复
c[i]=string(buf)组成pair，允许这样进行插入操作

#include <map>

#include <stdexcept>

#include <string>

#include <cstdlib> //abort()

#include <cstdio>  //snprintf()

#include <iostream>

#include <ctime>

namespace jj14

{

void test_map(long& value)

{

	cout << "\ntest_map().......... \n";

map<long, string> c;

char buf[10];

clock_t timeStart = clock();

    for(long i=0; i< value; ++i)

    {

    	try {

    		snprintf(buf, 10, "%d", rand());

			c[i] = string(buf);

		}

		catch(exception& p) {

			cout << "i=" << i << " " << p.what() << endl;

			abort();

		}

	}

	cout << "milli-seconds : " << (clock()-timeStart) << endl;

	cout << "map.size()= " << c.size() << endl;

	cout << "map.max_size()= " << c.max_size() << endl;		//178956970

long target = get_a_target_long();

    timeStart = clock();

auto pItem = c.find(target);

	cout << "c.find(), milli-seconds : " << (clock()-timeStart) << endl;

	if (pItem != c.end())

    	cout << "found, value=" << (*pItem).second << endl;

  	else

    	cout << "not found! " << endl;			

    c.clear();

}

}

使用unorder_set容器

#include <unordered_set>

#include <stdexcept>

#include <string>

#include <cstdlib> //abort()

#include <cstdio>  //snprintf()

#include <iostream>

#include <ctime>

namespace jj15

{

void test_unordered_set(long& value)

{

	cout << "\ntest_unordered_set().......... \n";

unordered_set<string> c;

char buf[10];

clock_t timeStart = clock();

    for(long i=0; i< value; ++i)

    {

    	try {

    		snprintf(buf, 10, "%d", rand());

        	c.insert(string(buf));

		}

		catch(exception& p) {

			cout << "i=" << i << " " << p.what() << endl;

			abort();

		}

	}

	cout << "milli-seconds : " << (clock()-timeStart) << endl;

	cout << "unordered_set.size()= " << c.size() << endl;

	cout << "unordered_set.max_size()= " << c.max_size() << endl;  //357913941

	cout << "unordered_set.bucket_count()= " << c.bucket_count() << endl;

	cout << "unordered_set.load_factor()= " << c.load_factor() << endl;

	cout << "unordered_set.max_load_factor()= " << c.max_load_factor() << endl;

	cout << "unordered_set.max_bucket_count()= " << c.max_bucket_count() << endl;

  	for (unsigned i=0; i< 20; ++i) {

    	cout << "bucket #" << i << " has " << c.bucket_size(i) << " elements.\n";

  	}			

string target = get_a_target_string();

	{

    timeStart = clock();

auto pItem = find(c.begin(), c.end(), target);	//比 c.find(...) 慢很多

	cout << "std::find(), milli-seconds : " << (clock()-timeStart) << endl;

	if (pItem != c.end())

    	cout << "found, " << *pItem << endl;

  	else

    	cout << "not found! " << endl;

 	}

 	{

    timeStart = clock();

auto pItem = c.find(target);		//比 std::find(...) 快很多

	cout << "c.find(), milli-seconds : " << (clock()-timeStart) << endl;

	if (pItem != c.end())

    	cout << "found, " << *pItem << endl;

  	else

    	cout << "not found! " << endl;

 	}

}

}

使用unorder_map容器

#include <unordered_map>

#include <stdexcept>

#include <string>

#include <cstdlib> //abort()

#include <cstdio>  //snprintf()

#include <iostream>

#include <ctime>

namespace jj16

{

void test_unordered_map(long& value)

{

	cout << "\ntest_unordered_map().......... \n";

unordered_map<long, string> c;

char buf[10];

clock_t timeStart = clock();

    for(long i=0; i< value; ++i)

    {

    	try {

    		snprintf(buf, 10, "%d", rand());

			c[i] = string(buf);

		}

		catch(exception& p) {

			cout << "i=" << i << " " << p.what() << endl;

			abort();

		}

	}

	cout << "milli-seconds : " << (clock()-timeStart) << endl;

	cout << "unordered_map.size()= " << c.size() << endl;	//357913941

	cout << "unordered_map.max_size()= " << c.max_size() << endl;	

long target = get_a_target_long();

    timeStart = clock();

//! auto pItem = find(c.begin(), c.end(), target);	//map 不適用 std::find()

auto pItem = c.find(target);

	cout << "c.find(), milli-seconds : " << (clock()-timeStart) << endl;

	if (pItem != c.end())

    	cout << "found, value=" << (*pItem).second << endl;

  	else

    	cout << "not found! " << endl;

}

}

hash_set/hash_map/hash_multiset/hash_multimap

包含gnu C的编译器就可以
包含的头文件可能需要修改#include<...>非标准容器，由于时间的原因，没有放在一起,在C++11大会之前就出现了！
测试

/*

以下測試 hash_multiset, hash_multimap 過程中遇到阻礙：

headers <hash_set> 和 <hash_map> 各有兩個，

分別在 ...\4.9.2\include\c++\backward 和 ...\4.9.2\include\c++\ext，

不知要用哪一組!

用 <ext\...> 那一組會有問題

   ...\4.9.2\include\c++\backward\hashtable.h

   [Error] no match for call to '(const hasher {aka const __gnu_cxx::hash<std::basic_string<char> >}) (const key_type&)'

用 <backward\...> 那一組有相同的問題.

so, 放棄測試 (no insertion or push_back or ...).

*/

#include <ext\hash_set>

    //...\4.9.2\include\c++\backward\backward_warning.h

	//[Warning] #warning This file includes at least one deprecated or antiquated header

	//which may be removed without further notice at a future date.

	//Please use a non-deprecated interface with equivalent functionality instead.

	//For a listing of replacement headers and interfaces, consult the file backward_warning.h.

	//To disable this warning use -Wno-deprecated. [-Wcpp]

#include <stdexcept>

#include <string>

#include <cstdlib> //abort()

#include <cstdio>  //snprintf()

#include <iostream>

#include <ctime>

namespace jj11

{

void test_hash_multiset(long& value)

{

	cout << "\ntest_hash_multiset().......... \n";

	__gnu_cxx::hash_multiset<string> c;

	char buf[10];

    clock_t timeStart = clock();

    for(long i=0; i< value; ++i)

    {

    	try {

    		snprintf(buf, 10, "%d", rand());

        	//! c.insert(string(buf));

		}

		catch(exception& p) {

			cout << "i=" << i << " " << p.what() << endl;

			abort();

		}

	}

	cout << "milli-seconds : " << (clock()-timeStart) << endl;

}

}

//---------------------------------------------------

#include <ext\hash_map>

    //...\4.9.2\include\c++\backward\backward_warning.h

	//[Warning] #warning This file ... (如上個函數所言)

#include <stdexcept>

#include <string>

#include <cstdlib> //abort()

#include <cstdio>  //snprintf()

#include <iostream>

#include <ctime>

namespace jj12

{

void test_hash_multimap(long& value)

{

	cout << "\ntest_hash_multimap().......... \n";

	__gnu_cxx::hash_multimap<long, string> c;

	char buf[10];

    clock_t timeStart = clock();

    for(long i=0; i< value; ++i)

    {

    	try {

    		snprintf(buf, 10, "%d", rand());

        	//c.insert(...

		}

		catch(exception& p) {

			cout << "i=" << i << " " << p.what() << endl;

			abort();

		}

	}

	cout << "milli-seconds : " << (clock()-timeStart) << endl;		

    timeStart = clock();

    //! auto ite = c.find(...

	cout << "milli-seconds : " << (clock()-timeStart) << endl;

}

}

侯捷STL学习(二)的更多相关文章

侯捷STL学习(二)--序列容器测试
第六节:容器之分类和各种测试(四) stack不提供iterator操作,破坏了容器的独特性,先进先出. 使用容器multiset(允许元素重复) 内部是红黑树,insert操作就保证了排好了序. 标 ...
侯捷STL学习(九)--关联式容器(Rb_tree,set,map)
layout: post title: 侯捷STL学习(九) date: 2017-07-21 tag: 侯捷STL --- 第十九节容器rb_tree Red-Black tree是自平衡二叉搜索 ...
侯捷STL学习(12)--STL相关内容hash+tuple
layout: post title: 侯捷STL学习(12) date: 2017-08-01 tag: 侯捷STL --- 第四讲 STL相关的内容 Hash Function 将hash函数封装 ...
侯捷STL学习(11)--算仿+仿函数+适配器
layout: post title: 侯捷STL学习(十一) date: 2017-07-24 tag: 侯捷STL --- 第三讲标准库内核分析-算法标准库算法形式 iterator分类不同 ...
侯捷STL学习(十)--容器hashtable探索(unordered set/map)
layout: post title: 侯捷STL学习(十) date: 2017-07-23 tag: 侯捷STL --- 第二十三节容器hashtable探索 hashtable冲突(碰撞)处理 ...
侯捷STL学习(八)-- 深度探索deque
layout: post title: 侯捷STL学习(八) date: 2017-07-19 tag: 侯捷STL --- 第十八节深度探索deque上 duque内存结构分段连续,用户看起来是 ...
侯捷STL学习(七)--深度探索vector&&array
layout: post title: 侯捷STL学习(七) date: 2017-06-13 tag: 侯捷STL --- 第十六节深度探索vector vector源码剖析 vector内存2倍 ...
侯捷STL学习(一)
开始跟着<STL源码剖析>的作者侯捷真人视频,学习STL,了解STL背后的真实故事! 视频链接:侯捷STL 还有很大其他视频需要的留言第一节:STL版本和重要资源 STL和标准库的区别 ...
侯捷STL学习(一)--顺序容器测试
开始跟着<STL源码剖析>的作者侯捷真人视频,学习STL,了解STL背后的真实故事! 视频链接:侯捷STL 还有很大其他视频需要的留言第一节:STL版本和重要资源 STL和标准库的区别 ...

随机推荐

Git命令行和Xcode结合使用
现在一直使用Git来管理代码,对于有强迫症的我来说,依旧选择了命令行,下面这段话可以更好的解释我为什么喜欢使用终端敲命令. There are a lot of different ways to u ...
使用Maven整合SSM总结
项目环境: spring-4.3.7 + mybatis-3.3.0 + maven-3.3.9 + oracle11g 1. 首先使用maven引入相关依赖: pom.xml: <projec ...
UEditor编辑器和php简单的实现socket通信
一.UEditor编辑器使用这个编辑器是需要先下载编辑器文件,记得下载的时候放入自己的网站中,既然是php中使用,自然我下载的就是php的UEditor编辑器了,然后是utf-8的其实使用很简单, ...
FreeSWITCH 安装配置的各种坑, 填坑
个人安装环境: OS:CentOS6.7 64位 FreeSWITCH Ver:1.6.17 一. 编译出错安装之前, 最好先安装这几个东西(如果有, 请忽略): yasm (有nasm的话 ...
AngularJS创建新指令 - 基本功能
指令(Directives)是所有AngularJS应用最重要的部分.尽管AngularJS已经提供了非常丰富的指令,但还是经常需要创建应用特定的指令. AngularJS原有的指令 ng-init ...
Python数据处理——numpy_3
通过前面两次的学习,基本上对numpy有了一定的认识,所以,接下来进一步对numpy学习.同时,最后以一个有趣的例子加深对numpy的理解. import numpy as np xarr = np. ...
java获得路径的多种方式
本文讲解java语言中获得运行时路径的多种方式,包括java项目.java web项目.jar.weblogic等多种场景. 一.this.getClass().getClassLoader().ge ...
FancyBox – 经典 Lightbox 效果插件
效果演示插件下载
[Day02] int, str功能学习
第二天任务: int的常用功能,参照该篇博客里面列举的常用功能 http://13683137989.blog.51cto.com/9636221/1911393 str的常用功能(重要) ,参照该篇 ...
BZOJ 1266: [AHOI2006]上学路线route
题目描述可可和卡卡家住合肥市的东郊,每天上学他们都要转车多次才能到达市区西端的学校.直到有一天他们两人参加了学校的信息学奥林匹克竞赛小组才发现每天上学的乘车路线不一定是最优的. 可可:"很 ...

侯捷STL学习(二)

第六节：容器之分类和各种测试（四）

使用容器multiset（允许元素重复）

使用容器multimap（允许元素重复）

使用unordered_multiset容器

使用unordered_multimap容器

使用set容器

使用map容器

使用unorder_set容器

使用unorder_map容器

hash_set/hash_map/hash_multiset/hash_multimap

侯捷STL学习(二)的更多相关文章

随机推荐

热门专题