1.编写一个程序,开启3个线程,这3个线程的ID分别为A、B、C,每个线程将自己的ID在屏幕上打印10遍,要求输出结果必须按ABC的顺序显示;如:ABCABC….依次递推。
代码
#include <iostream>
#include <thread>
#include <mutex>
#include <condition_variable>
#include <string>
std::mutex mtx;
std::condition_variable cv;
int count = 0;
void printID(const std::string& threadID, char id)
{
for (int i = 0; i < 10; ++i)
{
std::unique_lock<std::mutex> lock(mtx);
/*
这里为啥是while,是因为notify_all的时候会把所有阻塞唤醒,
但是能不能执行还是需要进行判断
while (id != count + 'A')
{
cv.wait(lock);
}
*/
cv.wait(lock, [=] {return !(id != count + 'A'); });
std::cout << threadID << ": " << id << std::endl;
++count;
if (count == 3)count = 0;
cv.notify_all(); // 唤醒其他线程
}
}
int main() {
std::thread threadA(printID, "Thread A", 'A');
std::thread threadB(printID, "Thread B", 'B');
std::thread threadC(printID, "Thread C", 'C');
threadA.join();
threadB.join();
threadC.join();
return 0;
}
2.生产者消费者问题:有一个生产者在生产产品,这些产品将提供给若干个消费者去消费,为了使生产者和消费者能并发执行,在两者之间设置一个有多个缓冲区的缓冲池,生产者将它生产的产品放入一个缓冲区中,消费者可以从缓冲区中取走产品进行消费,所有生产者和消费者都是异步方式运行的,但它们必须保持同步,即不允许消费者到一个空的缓冲区中取产品,也不允许生产者向一个已经装满产品且尚未被取走的缓冲区中投放产品。
代码
#include <iostream>
#include <mutex>
#include <condition_variable>
#include <string>
using namespace std;
mutex mtx;
condition_variable cv;
vector<int> vProduct;
void produce()
{
for (int i=1; i<= 10;i++)
{
unique_lock<mutex> lock(mtx);
cv.wait(lock, [] {return vProduct.empty(); });
vProduct.emplace_back(i);
cout << "product" <<":"<<i<<endl;
cv.notify_all();
}
}
void consumer(string threadName)
{
for (int i=0;i<10;i++)
{
unique_lock<mutex> lock(mtx);
cv.wait(lock, [] {return !vProduct.empty(); });
int num = vProduct.front();
vProduct.pop_back();
cout << threadName << ":" << "consumed " << num << endl;
cv.notify_all();
}
}
int main()
{
thread t1(produce);
thread t2(consumer,"consumer1");
thread t3(consumer,"consumer2");
t1.join();
t2.join();
t3.join();
return 0;
}
结果
product:1
consumer1:consumed 1
product:2
consumer1:consumed 2
product:3
consumer1:consumed 3
product:4
consumer1:consumed 4
product:5
consumer1:consumed 5
product:6
consumer1:consumed 6
product:7
consumer1:consumed 7
product:8
consumer1:consumed 8
product:9
consumer1:consumed 9
product:10
consumer1:consumed 10