std::list与std::map的排序比较

排序：

std::list用其自身的sort方法

std::map用插入排序

// stl_test.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <Windows.h>
#include <list>
#include <string>
#include <map>

struct _NpcDis
{
    DWORD    dwNpcId;
    INT        nDistance;

    bool operator <(const _NpcDis& _data)
    {
        return nDistance < _data.nDistance;
    }
};


struct    _MapSortLess
{
    bool operator()(const _NpcDis& _left, const _NpcDis& _right)
    {
        return _left.nDistance < _right.nDistance;
    }
};

INT N = 1000;

int _tmain(int argc, _TCHAR* argv[])
{
    _NpcDis _one;

    DWORD dwStart = GetTickCount();
    printf("---------List sort test----------\n");
    std::list<_NpcDis>    _ListTest;
    for (INT i = 0; i < N; i++)
    {
        _one.dwNpcId = i;
        _one.nDistance = rand();
        _ListTest.push_back(_one);
    }
    _ListTest.sort();
    printf("elapsed time:%d(ms)\n", GetTickCount() - dwStart);

//     std::list<_NpcDis>::iterator _LstItor = _ListTest.begin();
//     for (; _LstItor != _ListTest.end(); _LstItor++)
//     {
//         printf("%d-%d\n", _LstItor->dwNpcId, _LstItor->nDistance);
//     }

    printf("---------Map sort test----------\n");
    dwStart = GetTickCount();
    std::map<_NpcDis, int, _MapSortLess>    _MapT;
    for (INT i = 0; i < N; i++)
    {
        _one.dwNpcId = i;
        _one.nDistance = rand();
        _MapT[_one] = 1;
    }
    printf("elapsed time:%d(ms)\n", GetTickCount() - dwStart);

//     std::map<_NpcDis, int, _MapSortLess>::iterator _MapItor=_MapT.begin();
//     for (; _MapItor != _MapT.end(); _MapItor++)
//     {
//         printf("%d-%d\n", _MapItor->first.dwNpcId, _MapItor->first.nDistance);
//     }
    return 0;
}

N=1000时：

---------List sort test----------

elapsed time:109(ms)

---------Map sort test----------

elapsed time:16(ms)

N=10000时：

---------List sort test----------

elapsed time:1188(ms)

---------Map sort test----------

elapsed time:140(ms)

结论：std::map的插入排序比std::list自身的排序快了好几倍。