multimap案例

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <map>
#include <string>
#include <ctime>
#include <cstdlib>
using namespace std;

#define SALE_DEPARTMENT 1 //销售部门
#define DEVELOP_DEPARTMENT 2 //研发部门
#define FINACIAL_DEPARTMENT 3 //财务部门

//multimap 案例
//公司今天招聘了5个员工, 5名员工进入公司后,需要指派员工再哪个部门工作
//人员信息有:姓名 年龄 电话 工资等组成
//通过multimap进行信息的插入 保存 显示
//分部门显示员工信息 显示全部员工信息

class Worker
{
public:
	string mName;
	string mTele;
	int mAge;
	int mSalary;
};

//创建员工
void CreateWorker(vector<Worker>& vWorker)
{
	string seedName = "ABCDE";
	for (int i = 0; i < 5; i++)
	{
		Worker worker;
		worker.mName = "员工";
		worker.mName += seedName[i];
		worker.mAge = rand() % 10 + 20;
		worker.mTele = "010-888888";
		worker.mSalary = rand() % 10000 + 10000;
		//保存员工信息
		vWorker.push_back(worker);
	}
}

//员工分组
void WorkerByGroup(vector<Worker>& vWorker, multimap<int, Worker>& workerGroup)
{
	//把员工随机分配到不同部门
	srand(time(NULL));
	for (vector<Worker>::iterator it = vWorker.begin(); it != vWorker.end(); it++)
	{
		int departID = rand() % 3 + 1;
		switch (departID)
		{
		case SALE_DEPARTMENT:
			workerGroup.insert(make_pair(SALE_DEPARTMENT, *it));
			break;
		case DEVELOP_DEPARTMENT:
			workerGroup.insert(make_pair(DEVELOP_DEPARTMENT, *it));
			break;
		case FINACIAL_DEPARTMENT:
			workerGroup.insert(make_pair(FINACIAL_DEPARTMENT, *it));
			break;
		default:
			break;
		}
		
	}
}

void showWorkers(multimap<int, Worker>& workerGroup, int departID)
{
	multimap<int, Worker>::iterator it = workerGroup.find(departID);
	//找当前部门总人数
	int DepartCount = workerGroup.count(departID);
	int num = 0;
	for (multimap<int, Worker>::iterator pos = it; it != workerGroup.end() && num < DepartCount; pos++, num++)
	{
		cout << "姓名:" << pos->second.mName << " 年龄:" << pos->second.mAge << " 电话:" << pos->second.mTele << " 工资:" << pos->second.mSalary << endl;
	}
}

//打印每一部分员工信息
void PrintWorkerByGroup(multimap<int, Worker>& workerGroup)
{
	//打印销售部员工信息
	cout << "销售部门:" << endl;
	showWorkers(workerGroup, SALE_DEPARTMENT);
	
	//打印技术部员工信息
	cout << "技术部门:" << endl;
	showWorkers(workerGroup, DEVELOP_DEPARTMENT);

	//打印财务部员工信息
	cout << "财务部门:" << endl;
	showWorkers(workerGroup, FINACIAL_DEPARTMENT);

}

void test01()
{
	//存放新员工的信息
	vector<Worker> vWorker;
	//multimap保存分组信息
	multimap<int, Worker> workerGroup;
	//创建员工
	CreateWorker(vWorker);
	//员工分组
	WorkerByGroup(vWorker, workerGroup);
	//打印每一部分员工信息
	PrintWorkerByGroup(workerGroup);
}

class MyKey
{
public:
	MyKey(int index, int id)
	{
		this->mIndex = index;
		this->mID = id;
	}
	int mIndex;
	int mID;
};

struct mycompare
{
	bool operator()(MyKey key1, MyKey key2)
	{
		return key1.mIndex > key2.mIndex;
	}
};

void test02()
{
	map<MyKey, int, mycompare> mymap; //自动排序,自定义数据类型



	mymap.insert(make_pair(MyKey(1, 2), 10));
	mymap.insert(make_pair(MyKey(4, 5), 20));

	for (map<MyKey, int, mycompare>::iterator it = mymap.begin(); it != mymap.end(); it++)
	{
		cout << it->first.mIndex << ":" << it->first.mID << " = " << it->second << endl;
	}

}

void test03()
{
	map<int, int> mymap;
	mymap.insert(make_pair(1, 4));
	mymap.insert(make_pair(2, 5));
	mymap.insert(make_pair(3, 6));

	pair<map<int, int>::iterator, map<int, int>::iterator> ret = mymap.equal_range(2);
	if (ret.first->second)
	{
		cout << "找到lower_bound!" << endl;
	}
	else
	{
		cout << "没有找到!" << endl;
	}

	if (ret.second->second)
	{
		cout << "找到upper_bound!" << endl;
	}
	else
	{
		cout << "没有找到!" << endl;
	}


}


int main()
{
	//test01();
	//test02();
	test03();


	return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值