2021-05-14

deque容器测试

#include <iostream>
#include <algorithm>
#include <deque>
#include <random>
#include <ctime>

namespace jj04{

using std::cout;
using std::sort;
using std::lower_bound;
using std::deque;
using std::default_random_engine;
using std::uniform_int_distribution;

void test_array(){
    cout << "...... TEST vector ......\n";
    
    deque<long> c(500000,0);
    default_random_engine e;
    uniform_int_distribution<long> u(0,999999);
    
    clock_t timeStart=clock();
    for(auto &i:c) { i=u(e); }
    cout << "vector拷贝50万long int花费时间:" << (clock()-timeStart) << "\n";
    std::cout << "vector.size():" << c.size() << '\n';

    timeStart=clock();
    sort(c.begin(),c.end());
    cout << "排序50万数据的vector花费时间:" << clock()-timeStart << "\n";

    timeStart=clock();
    auto it = lower_bound(c.begin(),c.end(),452l);
    size_t times = clock() - timeStart;
    if(it!=c.end()){
        cout << "二分查找452(long)花费时间:" << times << "\n";
    }
    else {cout << "二分查找未找到452(long)花费时间:" << times << "\n";}

    cout << "1s=" << CLOCKS_PER_SEC << " clock\n";
}
}

int main()
{
    jj04::test_array();
    return 0;
}

总结：deque<long>拷贝50w long数据花费23ms，排序这50w数据花费时间267ms，二分查找花费0.004ms。