栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 软件开发 > 后端开发 > C/C++/C#

C++ 并发编程练习15 “最简单的线程池”

C/C++/C# 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

C++ 并发编程练习15 “最简单的线程池”

下面的代码展示了一个简单的线程池。

#include 
#include 
#include 
#include 
#include 
#include 
#include 

template
class thread_safe_queue
{
private:
	mutable std::mutex mut;
	std::queue data_queue;
	std::condition_variable data_cond;

public:
	thread_safe_queue() {};
	void push(T new_value)
	{
		std::lock_guard lk(mut);
		data_queue.push(std::move(new_value));
		data_cond.notify_one();
	}

	void wait_and_pop(T& value)
	{
		std::unique_lock lk(mut);
		data_cond.wait(lk, [this] {return !data_queue.empty(); });
		value = std::move(data_queue.front());
		data_queue.pop();

	}

	std::shared_ptr  wait_and_pop()
	{
		std::unique_lock lk(mut);
		data_cond.wait(lk, [this] {return !data_queue.empty(); });

		std::shared_ptr res(std::make_shared(std::move(data_queue.front())));
		data_queue.pop();
		return res;
	}

	bool try_pop(T& value)
	{
		std::lock_guard lk(mut);
		if (data_queue.empty())
			return false;

		value = std::move(data_queue.front());
		data_queue.pop();
		return true;
	}

	std::shared_ptr try_pop()
	{
		std::unique_lock lk(mut);
		if (data_queue.empty())
			return std::shared_ptr();

		std::shared_ptr res(std::make_shared(std::move(data_queue.front())));
		data_queue.pop();
		return res;
	}

	bool empty() const
	{
		std::lock_guard lk(mut);
		return data_queue.empty();
	}
};

class join_threads
{
	std::vector threads;
public:
	explicit join_threads(std::vector threads_)
		: threads(threads_)
	{};

	~join_threads()
	{
		for (unsigned long i = 0; i < threads.size(); ++i)
		{
			if (threads[i].joinable())
				threads[i].join();
		}
	};
};

class thread_pool
{
    std::atomic_bool done;
    thread_safe_queue > work_queue;
	std::vector threads;
	join_threads joiner;

	void woker_thread()
	{
		while (!done)
		{
			std::function task;
			if (work_queue.try_pop(task))
				task();
			else
				std::this_thread::yield();
		}
	}

public:
	thread_pool()
		:done(false)
		,joiner(threads)
	{
		unsigned const thread_count = std::thread::hardware_concurrency();
		try
		{
			for (unsigned i = 0; i < thread_count; ++i)
			{
				threads.push_back(std::thread(&thread_pool::woker_thread, this));
			}
		}
		catch (...)
		{
			done = true;
			throw;
		}
	}

	~thread_pool()
	{
		done = true;
	}

	template
	void submit(FunctionType f)
	{
		work_queue.push(std::function(f));
	}
};

int main()
{
    std::cout << "Hello World!n";
}

转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/849750.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号