C++代碼測(cè)試壓力測(cè)試卷_第1頁(yè)
C++代碼測(cè)試壓力測(cè)試卷_第2頁(yè)
C++代碼測(cè)試壓力測(cè)試卷_第3頁(yè)
C++代碼測(cè)試壓力測(cè)試卷_第4頁(yè)
C++代碼測(cè)試壓力測(cè)試卷_第5頁(yè)
已閱讀5頁(yè),還剩10頁(yè)未讀, 繼續(xù)免費(fèi)閱讀

下載本文檔

版權(quán)說(shuō)明:本文檔由用戶提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請(qǐng)進(jìn)行舉報(bào)或認(rèn)領(lǐng)

文檔簡(jiǎn)介

C++代碼測(cè)試壓力測(cè)試卷

```cpp

include<iostream>

include<vector>

include<list>

include<deque>

include<forward_list>

include<string>

include<algorithm>

include<set>

include<map>

include<unordered_set>

include<unordered_map>

include<stack>

include<queue>

include<functional>

include<thread>

include<mutex>

include<condition_variable>

include<future>

include<chrono>

include<random>

include<atomic>

include<memory>

//Functiontoperformstresstestonvectoroperations

voidstressTestVector(){

constsize_tTEST_SIZE=1000000;

std::vector<int>vec;

//Testpush_backandreserve

vec.reserve(TEST_SIZE);

for(size_ti=0;i<TEST_SIZE;++i){

vec.push_back(rand());

}

//Testclearandresize

vec.clear();

vec.resize(TEST_SIZE2);

//Testeraseandinsert

vec.erase(vec.begin(),vec.begin()+TEST_SIZE/2);

for(size_ti=0;i<TEST_SIZE/2;++i){

vec.insert(vec.begin(),rand());

}

//Testsortandreverse

std::sort(vec.begin(),vec.end());

std::reverse(vec.begin(),vec.end());

}

//Functiontoperformstresstestonlistoperations

voidstressTestList(){

constsize_tTEST_SIZE=1000000;

std::list<int>lst;

//Testpush_backandpush_front

for(size_ti=0;i<TEST_SIZE;++i){

lst.push_back(rand());

lst.push_front(rand());

}

//Testclearandresize

lst.clear();

lst.resize(TEST_SIZE);

//Testremoveandremove_if

for(size_ti=0;i<TEST_SIZE;++i){

lst.remove(rand());

}

lst.remove_if([](intx){returnx%2==0;});

//Testsortandreverse

lst.sort();

lst.reverse();

}

//Functiontoperformstresstestondequeoperations

voidstressTestDeque(){

constsize_tTEST_SIZE=1000000;

std::deque<int>dq;

//Testpush_backandpush_front

for(size_ti=0;i<TEST_SIZE;++i){

dq.push_back(rand());

dq.push_front(rand());

}

//Testclearandresize

dq.clear();

dq.resize(TEST_SIZE);

//Testeraseandinsert

dq.erase(dq.begin(),dq.begin()+TEST_SIZE/2);

for(size_ti=0;i<TEST_SIZE/2;++i){

dq.insert(dq.begin(),rand());

}

//Testsortandreverse

std::sort(dq.begin(),dq.end());

std::reverse(dq.begin(),dq.end());

}

//Functiontoperformstresstestonforward_listoperations

voidstressTestForwardList(){

constsize_tTEST_SIZE=1000000;

std::forward_list<int>flst;

//Testpush_front

for(size_ti=0;i<TEST_SIZE;++i){

flst.push_front(rand());

}

//Testclearandresize

flst.clear();

flst.resize(TEST_SIZE);

//Testremoveandremove_if

for(size_ti=0;i<TEST_SIZE;++i){

flst.remove(rand());

}

flst.remove_if([](intx){returnx%2==0;});

}

//Functiontoperformstresstestonstringoperations

voidstressTestString(){

constsize_tTEST_SIZE=1000000;

std::stringstr;

//Testappend

for(size_ti=0;i<TEST_SIZE;++i){

str.append(std::to_string(rand()));

}

//Testclearandresize

str.clear();

str.resize(TEST_SIZE);

//Testeraseandinsert

str.erase(str.begin(),str.begin()+TEST_SIZE/2);

for(size_ti=0;i<TEST_SIZE/2;++i){

str.insert(str.begin(),std::to_string(rand()));

}

//Testsortandreverse

std::sort(str.begin(),str.end());

std::reverse(str.begin(),str.end());

}

//Functiontoperformstresstestonsetoperations

voidstressTestSet(){

constsize_tTEST_SIZE=1000000;

std::set<int>st;

//Testinsert

for(size_ti=0;i<TEST_SIZE;++i){

st.insert(rand());

}

//Testclearandresize

st.clear();

st.resize(TEST_SIZE);

//Testeraseandfind

for(size_ti=0;i<TEST_SIZE;++i){

st.erase(rand());

}

for(size_ti=0;i<TEST_SIZE;++i){

st.find(rand());

}

}

//Functiontoperformstresstestonmapoperations

voidstressTestMap(){

constsize_tTEST_SIZE=1000000;

std::map<int,int>mp;

//Testinsert

for(size_ti=0;i<TEST_SIZE;++i){

mp.insert(std::make_pair(rand(),rand()));

}

//Testclearandresize

mp.clear();

mp.resize(TEST_SIZE);

//Testeraseandfind

for(size_ti=0;i<TEST_SIZE;++i){

mp.erase(rand());

}

for(size_ti=0;i<TEST_SIZE;++i){

mp.find(rand());

}

}

//Functiontoperformstresstestonunordered_setoperations

voidstressTestUnorderedSet(){

constsize_tTEST_SIZE=1000000;

std::unordered_set<int>ust;

//Testinsert

for(size_ti=0;i<TEST_SIZE;++i){

ust.insert(rand());

}

//Testclearandresize

ust.clear();

ust.resize(TEST_SIZE);

//Testeraseandfind

for(size_ti=0;i<TEST_SIZE;++i){

ust.erase(rand());

}

for(size_ti=0;i<TEST_SIZE;++i){

ust.find(rand());

}

}

//Functiontoperformstresstestonunordered_mapoperations

voidstressTestUnorderedMap(){

constsize_tTEST_SIZE=1000000;

std::unordered_map<int,int>ump;

//Testinsert

for(size_ti=0;i<TEST_SIZE;++i){

ump.insert(std::make_pair(rand(),rand()));

}

//Testclearandresize

ump.clear();

ump.resize(TEST_SIZE);

//Testeraseandfind

for(size_ti=0;i<TEST_SIZE;++i){

ump.erase(rand());

}

for(size_ti=0;i<TEST_SIZE;++i){

ump.find(rand());

}

}

//Functiontoperformstresstestonstackoperations

voidstressTestStack(){

constsize_tTEST_SIZE=1000000;

std::stack<int>stk;

//Testpushandpop

for(size_ti=0;i<TEST_SIZE;++i){

stk.push(rand());

}

for(size_ti=0;i<TEST_SIZE;++i){

stk.pop();

}

}

//Functiontoperformstresstestonqueueoperations

voidstressTestQueue(){

constsize_tTEST_SIZE=1000000;

std::queue<int>q;

//Testpushandpop

for(size_ti=0;i<TEST_SIZE;++i){

q.push(rand());

}

for(size_ti=0;i<TEST_SIZE;++i){

q.pop();

}

}

//Functiontoperformstresstestonpriority_queueoperations

voidstressTestPriorityQueue(){

constsize_tTEST_SIZE=1000000;

std::priority_queue<int>pq;

//Testpushandpop

for(size_ti=0;i<TEST_SIZE;++i){

pq.push(rand());

}

for(size_ti=0;i<TEST_SIZE;++i){

pq.pop();

}

}

//Functiontoperformstresstestonfunctionobjects

voidstressTestFunctionObjects(){

constsize_tTEST_SIZE=1000000;

std::function<void()>func=[](){

std::this_thread::sleep_for(std::chrono::milliseconds(1));

};

for(size_ti=0;i<TEST_SIZE;++i){

func();

}

}

//Functiontoperformstresstestonthreadsandmutexes

voidstressTestThreadsAndMutexes(){

constsize_tNUM_THREADS=10;

std::mutexmtx;

std::atomic<int>counter(0);

std::vector<std::thread>threads;

for(size_ti=0;i<NUM_THREADS;++i){

threads.emplace_back([&](){

for(size_tj=0;j<100000;++j){

mtx.lock();

++counter;

mtx.unlock();

}

});

}

for(auto&th:threads){

th.join();

}

std::cout<<"Countervalue:"<<counter<<std::endl;

}

//Functiontoperformstresstestonconditionvariables

voidstressTestConditionVariables(){

std::mutexmtx;

std::condition_variablecv;

boolready=false;

std::threadproducer([&](){

std::unique_lock<std::mutex>lock(mtx);

ready=true;

cv.notify_one();

});

std::threadconsumer([&](){

std::unique_lock<std::mutex>lock(mtx);

cv.wait(lock,[&]{returnready;});

std::cout<<"Conditionvariabletestpassed"<<std::endl;

});

producer.join();

consumer.join();

}

//Functiontoperformstresstestonfutures

voidstressTestFutures(){

constsize_tNUM_FUTURES=1000;

std::vector<std::future<void>>futures;

for(size_ti=0;i<NUM_FUTURES;++i){

futures.emplace_back(std::async(std::launch::async,[](){

std::this_thread::sleep_for(std::chrono::milliseconds(1));

}));

}

for(auto&fut:futures){

fut.get();

}

}

//Functiontoperformstresstestonatomics

voidstressTestAtomics(){

constsize_tNUM_THREADS=10;

std::vector<std::thread>threads;

std::atomic<int>counter(0);

for(size_ti=0;i<NUM_THREADS;++i){

threads.emplace_back([&](){

for(size_tj=0;j<100000;++j){

++counter;

}

});

}

for(auto&th:threads){

th.join();

}

std::cout<<"Atomiccountervalue:"<<counter<<std::endl;

}

/

溫馨提示

  • 1. 本站所有資源如無(wú)特殊說(shuō)明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請(qǐng)下載最新的WinRAR軟件解壓。
  • 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請(qǐng)聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
  • 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁(yè)內(nèi)容里面會(huì)有圖紙預(yù)覽,若沒(méi)有圖紙預(yù)覽就沒(méi)有圖紙。
  • 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
  • 5. 人人文庫(kù)網(wǎng)僅提供信息存儲(chǔ)空間,僅對(duì)用戶上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對(duì)用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對(duì)任何下載內(nèi)容負(fù)責(zé)。
  • 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請(qǐng)與我們聯(lián)系,我們立即糾正。
  • 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時(shí)也不承擔(dān)用戶因使用這些下載資源對(duì)自己和他人造成任何形式的傷害或損失。

最新文檔

評(píng)論

0/150

提交評(píng)論