标准容器map的使用（创建优先级队列）

最新推荐文章于 2022-11-30 22:02:20 发布

逐影Linux

最新推荐文章于 2022-11-30 22:02:20 发布

阅读量2k

点赞数

分类专栏： C++ STL

本文链接：https://blog.csdn.net/citongke1/article/details/17542939

版权

C++ 同时被 2 个专栏收录

46 篇文章 1 订阅

订阅专栏

STL

3 篇文章 0 订阅

订阅专栏

#ifndef __STD_LIST_TEST__
#define __STD_LIST_TEST__
#include <list>
#include <map>
#include <stdio.h>
class TestData
{
public:
    TestData()
    {
        m_Num = 0;
    }
public:
    int m_Num;
};
#endif

#include "StdListTest.h"
#define TESTLIST list<TestData*>
#define TESTMAP  map< int, list<TestData*> >
#define  NUM 10
using namespace std;
int main(int argc, char* argv[])
{
    int size = 0;
	TESTLIST TestList;
    TESTMAP TestMap;
    printf("开始向map里压入10个队列...\n");
    TESTLIST::iterator iterList = TestList.begin();
    TESTMAP::iterator iterMap = TestMap.begin();
    for (int j = 0; j < NUM; j++)
    {
    	for (int i = j; i < NUM; i++)
        { 
        	TestData* test = new TestData;
        	test->m_Num = i;
        	TestList.push_back(test);
        }
        iterMap = TestMap.find(j);
        if (iterMap == TestMap.end())
        {
            TestMap[j] = TestList;
            
            while(iterList != TestList.end())
            {
            	TestData* m_Temp =  TestList.front();
            	delete m_Temp;
            	m_Temp = NULL;
            	iterList = TestList.erase(iterList);
            }
            TestList.clear();
        }
    }
    
    printf("开始访问map里的数据,然后删除[%d]\n", TestMap.size());
    iterMap = TestMap.begin();
    while (iterMap != TestMap.end())
    {
        iterList = iterMap->second.begin();
        printf("优先级[%d]: ", iterMap->first);
        while (iterList != iterMap->second.end())
        {
            printf("[%d] ", (*iterList)->m_Num);
            iterList = TestList.erase(iterList);
        }
        printf("\n");
        TestMap.erase(iterMap++);//此处与list不一样，删除后不能返回地址
    }
    
	printf("map删除后空间[%d]\n", TestMap.size());
	return 0;
}