该文档举例说明了multimap的查找和删除元素的使用。

其中,在使用迭代器遍历元素的时候,如果使用了删除迭代器的操作,那么需要小心迭代器失效的情况。

/*
功能说明:
multimap的查找和删除元素的使用举例
代码说明:
使用multimap的equal_range()方法来查找符合指定key的元素。使用erase来删除指定key的元素。
实现方式:
限制条件或者存在的问题:

*/ #include <iostream>
#include <string>
#include <map> using namespace std; class CData
{
public:
CData()
{
sequence = ;
this->remark = "default string"; cout << "CData()\t" << toString() << "\t" << endl;
} CData(int i, string &s)
{
this->sequence = i;
this->remark = s; cout << "CData(int i,string &s)\t" << toString() << "\t" << endl;
} CData(const CData &data)
{
this->sequence = data.sequence;
this->remark = data.remark; cout << "CData(const CData &data)\t" << toString() << "\t" << endl;
} CData operator = (const CData &data)
{
this->sequence = data.sequence;
this->remark = data.remark; cout << "CData operator = (const CData &data)\t" << toString() << "\t" << endl; return *this;
} void setSequence(const int i)
{
this->sequence = i;
} void setRemark(const string &s)
{
this->remark = s;
} string toString() const
{
char tmp[] = { };
sprintf(tmp, "[sequence:%d | remark:%s @ %p]", this->sequence, this->remark.c_str(),this); //此处应该有内存复制操作,所以不用担心返回后tmp数组所指向的内存被修改或者不存在的情况。
return tmp;
} ~CData()
{
cout << "~CData()\t" << this << endl;
}
protected:
private:
int sequence;
string remark;
}; int main(int argc, char ** argv)
{
cout << "process begin @[" << (void*)&main << "]" << endl; multimap<string, CData *> multData;
string strClassName = "CData11";
CData *p11 = new CData(, strClassName);
strClassName = "CData12";
CData *p12 = new CData(, strClassName);
strClassName = "CData13";
CData *p13 = new CData(, strClassName);
strClassName = "CData23";
CData *p23 = new CData(, strClassName);
strClassName = "CData24";
CData *p24 = new CData(, strClassName);
strClassName = "CData26";
CData *p26 = new CData(, strClassName); multData.insert(make_pair("", p11));
multData.insert(make_pair("", p23));
multData.insert(make_pair("", p13));
multData.insert(make_pair("", p24));
multData.insert(make_pair("", p12));
multData.insert(make_pair("", p26)); cout << "multData.size()\t" << multData.size() << endl; cout << "show all msg" << endl;
// multimap在创建的时候,已经将元素根据key的顺序排好了(前提是key支持<比较)。
for (multimap<string, CData*>::iterator itr = multData.begin(); itr != multData.end(); itr++)
{
cout << itr->first << "\t" << (itr->second)->toString() << endl;
} cout << "find 2" << endl;
pair<multimap<string, CData*>::iterator, multimap<string, CData*>::iterator> pitr2 = multData.equal_range("");
for (multimap<string, CData*>::iterator itr = pitr2.first; itr != pitr2.second; itr++)
{
cout << itr->first << "\t" << (itr->second)->toString() << endl;
} multData.erase(""); pitr2 = multData.equal_range("");
if (pitr2.first == pitr2.second)
{
cout << "can not find key 2 after delete key 2" << endl;
} cout << "show all msg after delete 2" << endl;
for (multimap<string, CData*>::iterator itr = multData.begin(); itr != multData.end(); itr++)
{
cout << itr->first << "\t" << (itr->second)->toString() << endl;
} multData.insert(make_pair("", p11));
multData.insert(make_pair("", p23));
multData.insert(make_pair("", p13));
multData.insert(make_pair("", p24));
multData.insert(make_pair("", p12));
multData.insert(make_pair("", p26)); cout << "find element by key using another way" << endl;
for (multimap<string, CData*>::iterator itr_find = multData.lower_bound(""); itr_find != multData.upper_bound(""); itr_find++)
{
cout << itr_find->first << "\t" << (itr_find->second)->toString() << endl;
} cout << "delete key 1 by iterator" << endl;
// 这是一种错误的迭代器删除元素的方式。
/*
for (multimap<string, CData*>::iterator itr = multData.begin(); itr != multData.end(); itr++)
{
cout << itr->first << "\t" << (itr->second)->toString() << endl;
if (itr->first == "1")
{
multData.erase(itr);
}
}
*/ // 正确的使用迭代器删除元素的方式。
for (multimap<string, CData*>::iterator itr = multData.begin(); itr != multData.end(); )
{
if (itr->first == "")
{
cout <<"find key 1. "<< itr->first << "\t" << (itr->second)->toString() << endl;
itr = multData.erase(itr);
}
else
{
cout << "can not find key 1. " << itr->first << "\t" << (itr->second)->toString() << endl;
itr++;
}
} cout << "show all msg after erase key 1" << endl;
for (multimap<string, CData*>::iterator itr = multData.begin(); itr != multData.end(); itr++)
{
cout << itr->first << "\t" << (itr->second)->toString() << endl;
} delete p11;
delete p12;
delete p13;
delete p23;
delete p24;
delete p26; return ;
}

程序的输出结果:

process begin @[00B2188E]
CData(int i,string &s)  [sequence:11 | remark:CData11 @ 011FCFD0]
CData(int i,string &s)  [sequence:12 | remark:CData12 @ 011FD020]
CData(int i,string &s)  [sequence:13 | remark:CData13 @ 011FD8C0]
CData(int i,string &s)  [sequence:23 | remark:CData23 @ 011FE448]
CData(int i,string &s)  [sequence:24 | remark:CData24 @ 011FE6C8]
CData(int i,string &s)  [sequence:26 | remark:CData26 @ 011FE808]
multData.size() 6
show all msg
1       [sequence:11 | remark:CData11 @ 011FCFD0]
1       [sequence:13 | remark:CData13 @ 011FD8C0]
1       [sequence:12 | remark:CData12 @ 011FD020]
2       [sequence:23 | remark:CData23 @ 011FE448]
2       [sequence:24 | remark:CData24 @ 011FE6C8]
2       [sequence:26 | remark:CData26 @ 011FE808]
find 2
2       [sequence:23 | remark:CData23 @ 011FE448]
2       [sequence:24 | remark:CData24 @ 011FE6C8]
2       [sequence:26 | remark:CData26 @ 011FE808]
can not find key 2 after delete key 2
show all msg after delete 2
1       [sequence:11 | remark:CData11 @ 011FCFD0]
1       [sequence:13 | remark:CData13 @ 011FD8C0]
1       [sequence:12 | remark:CData12 @ 011FD020]
find element by key using another way
1       [sequence:11 | remark:CData11 @ 011FCFD0]
1       [sequence:13 | remark:CData13 @ 011FD8C0]
1       [sequence:12 | remark:CData12 @ 011FD020]
1       [sequence:11 | remark:CData11 @ 011FCFD0]
1       [sequence:13 | remark:CData13 @ 011FD8C0]
1       [sequence:12 | remark:CData12 @ 011FD020]
delete  key 1 by iterator
find key 1. 1   [sequence:11 | remark:CData11 @ 011FCFD0]
find key 1. 1   [sequence:13 | remark:CData13 @ 011FD8C0]
find key 1. 1   [sequence:12 | remark:CData12 @ 011FD020]
find key 1. 1   [sequence:11 | remark:CData11 @ 011FCFD0]
find key 1. 1   [sequence:13 | remark:CData13 @ 011FD8C0]
find key 1. 1   [sequence:12 | remark:CData12 @ 011FD020]
can not find key 1. 2   [sequence:23 | remark:CData23 @ 011FE448]
can not find key 1. 2   [sequence:24 | remark:CData24 @ 011FE6C8]
can not find key 1. 2   [sequence:26 | remark:CData26 @ 011FE808]
show all msg after erase key 1
2       [sequence:23 | remark:CData23 @ 011FE448]
2       [sequence:24 | remark:CData24 @ 011FE6C8]
2       [sequence:26 | remark:CData26 @ 011FE808]
~CData()        011FCFD0
~CData()        011FD020
~CData()        011FD8C0
~CData()        011FE448
~CData()        011FE6C8
~CData()        011FE808

该文档举例说明了multimap的查找和删除元素的使用的更多相关文章

  1. ELK学习总结(2-4)bulk 批量操作-实现多个文档的创建、索引、更新和删除

    bulk 批量操作-实现多个文档的创建.索引.更新和删除 ----------------------------------------------------------------------- ...

  2. 慧自文档:代替 Everything 来快速查找文件的,实现文件显示在文件夹的层次结构中

    1. 搜索功能和Everything一样快和强大 具有 Everything 搜索快.搜索功能强等优点, 解决了不能方便选择搜索哪个文件夹, 解决了不能同一个画面进行预览等问题 2.文件直接显示到文件 ...

  3. 用Java对xml文档进行遍历,更新,创建,删除

    import java.io.File;import java.io.FileInputStream; import javax.imageio.stream.FileImageInputStream ...

  4. jquery 追加元素/jquery文档处理,插入、修改、移动、删除指定的DOM元素.

    jquery 追加元素 $("#content").append("..."); // 添加到元素内部最后面 $("#content").p ...

  5. pytest文档40-pytest.ini配置用例查找规则(面试题)

    前言 面试题:pytest如何执行不是test开头的用例?如执行 xxx_*.py这种文件的用例. pytest.ini 配置文件可以修改用例的匹配规则. pytest命令行参数 cmd打开输入pyt ...

  6. HTML DOCTYPE文档类型举例说明

    HTML DOCTYPE文档类型举例说明 HTML4.01文档过渡定义类型,此类型定义的文档可以使用HTML中的标签与元素包括一些不被W3C推荐的标签(例如:font.b等),不可以使用框架 < ...

  7. DOM (Document Object Model)文档对象模型

    [理解下DOM] DOM——Document Object Mode.DOM是网页上XHTML中文档正文标题啊.段落.列表.样式.以及ID/class等所有其他数据的一个内部表示.我自己的理解是将网页 ...

  8. css3学习文档

    什么是CSS3? CSS3是CSS2的升级版本,3只是版本号,它在CSS2.1的基础上增加了很多强大的新功能. 目前主流浏览器chrome.safari.firefox.opera.甚至360都已经支 ...

  9. HTML5的文档结构

    HTML5的文档结构 HTML5简化了许多,它的设计遵循了3个原则:1.兼容性.2.实用性.3.通用访问性     1. header 元素     <header> 标签定义文档或者文档 ...

随机推荐

  1. Django学习笔记之Django中间件

    准备 我们在前面的课程中已经学会了给视图函数加装饰器来判断是用户是否登录,把没有登录的用户请求跳转到登录页面.我们通过给几个特定视图函数加装饰器实现了这个需求.但是以后添加的视图函数可能也需要加上装饰 ...

  2. 移植madplay到jz2440【学习笔记】

    平台:jz2440 作者:庄泽彬(欢迎转载,请注明作者) 说明:韦东山一期视频学习笔记 交叉编译工具:arm-linux-gcc (GCC) 3.4.5 PC环境:ubuntu16.04 一.移植ma ...

  3. 解析JDK动态代理实现原理

    JDK动态代理使用实例 代理模式的类图如上.关于静态代理的示例网上有很多,在这里就不讲了. 因为本篇讲述要点是JDK动态代理的实现原理,直接从JDK动态代理实例开始. 首先是Subject接口类. p ...

  4. springboot--配置文件加载顺序

    -file:./config(内部配置) -file:./ (内部配置) -classpath:/config (外部配置) -classpath:/ (外部配置) 运维: spring -jar s ...

  5. LeetCode——single-number系列

    LeetCode--single-number系列 Question 1 Given an array of integers, every element appears twice except ...

  6. DATASTAGE中ODBC连接的配置

    修改2个配置文件: cat /mistel/IBM/InformationServer/Server/DSEngine/.odbc.ini cat /mistel/IBM/InformationSer ...

  7. mysql 一些属性

    1)定义id,设置int,涉及的属性有: BINARY二进制 UNSIGNED无符号数 UNSIGNED ZEROFILL 在列字段中使用UNSIGNED ZEROFILL属性,如: 插入int(4) ...

  8. Permutations,全排列

    问题描述:给定一个数组,数字中数字不重复,求所有全排列. 算法分析:可以用交换递归法,也可以用插入法. 递归法:例如,123,先把1和1交换,然后递归全排列2和3,然后再把1和1换回来.1和2交换,全 ...

  9. php和java优势对比

    PHP很专一,用于创建动态网页的服务器端的脚本语言.作为一种为Web而特别设计的语言,PHP带来了许多商业机构渴望的特性.   ·学习周期短,比较简单 ·快速的开发时间 ·非常高的性能       这 ...

  10. ALS算法 (面试准备)

    ALS算法描述: 1.ALS算法用来补全用户评分矩阵.由于用户评分矩阵比较稀疏,将用户评分矩阵进行分解,变成V和U的乘积.通过求得V和U两个小的矩阵来补全用户评分矩阵. 2.ALS算法使用交替最小二乘 ...