深入学习c++--多线程编程
Posted douzujun
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了深入学习c++--多线程编程相关的知识,希望对你有一定的参考价值。
1. 简介
2. 线程使用
2.1 demo
#include <iostream> #include <thread> #include <future> using namespace std; void helloworld() { cout << "hello world \\n"; } int main() { //开启一个线程 std::thread t(helloworld); std::cout << "hello world main thread\\n"; //线程的终结 t.join(); return 0; }
2.2 一个简单的应用
- 查看当前线程id: this_thread::get_id()
- 比较单线程和多线程工作的效率(如果工作不太消耗时间,多线程反而比单线程更耗时间)
#include <iostream> #include <thread> #include <chrono> #include <future> #include <cmath> #include <vector> #include <cstdlib> using namespace std; double caculate(int v) { if (v <= 0) { return v; } //假设这个计算很慢 this_thread::sleep_for(chrono::milliseconds(10)); return sqrt((v * v + sqrt((v - 5) * (v + 2.5)) / 2.0) / v); } template<typename Iter, typename Fun> double visitRange(thread::id id, Iter iterBegin, Iter iterEnd, Fun func) { auto curId = this_thread::get_id(); if (id == this_thread::get_id()) { cout << curId << " hello main thread\\n"; } else { cout << curId << " hello work thread\\n"; } double v = 0; for (auto iter = iterBegin; iter != iterEnd; ++iter) { v += func(*iter); } return v; } int main() { auto mainThreadId = std::this_thread::get_id(); //开启一个线程 std::vector<double> v; for (int i = 0; i < 1000; i++) { v.push_back(rand()); } cout << v.size() << endl; double value = 0.0; auto st = clock(); for (auto & info : v) { value += caculate(info); } auto ed = clock(); cout << "single thread: " << value << " " << ed - st << "time" << endl; //下面用多线程来进行 auto iterMid = v.begin() + (v.size() / 2); // 指向整个vector一半部分 //计算后半部分 double anotherv = 0.0; auto iterEnd = v.end(); st = clock(); std::thread s([&anotherv, mainThreadId, iterMid, iterEnd]() { // lambda anotherv = visitRange(mainThreadId, iterMid, iterEnd, caculate); }); // 计算前半部分 auto halfv = visitRange(mainThreadId, v.begin(), iterMid, caculate); //关闭线程 s.join(); ed = clock(); cout << "multi thread: " << (halfv + anotherv) << " " << ed - st << "time" << endl; return 0; }
以上是关于深入学习c++--多线程编程的主要内容,如果未能解决你的问题,请参考以下文章