单例模式的线程池

package com.gxhc.pool;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
/**
 * @author: zzl
 * @date: 2020-12-15 15:32
 * @desciption: 自定义单例模式线程池
 */
public class MyThreadPool {
    // volatile 关键字作用是保证该线程池对象的可见性,即被所有的  线程可见,修改统一修改,结束统一结束,保证唯一性
    private static volatile ExecutorService threadPool;
    private static boolean flag = false;
    private MyThreadPool(){
    }

    public static ExecutorService getInstance(){
        if(!flag){
            if(threadPool != null){
                return threadPool;
            }else {
                synchronized (ExecutorService.class){
                    if(threadPool == null){
                        // 设置线程池线程数量
                        threadPool = Executors.newFixedThreadPool(100);
                        flag = true;
                    }
                }
            }
        }
        return threadPool;
    }
}
/**
 * @author: zzl
 * @date: 2020-12-15 15:32
 * @desciption: 调用例子
 */
 public class Test{
 public static void main(String[]args){
    // 循环主体
    for(int i=0;i<1000;i++){
                 ExecutorService pool = MyThreadPool.getInstance();
                 pool.summit(new Thread(()->{
				 System.out.printlIn("66666")
				}));
        }
    }
 }

以上pool.summit(new Thread(()->{}));方法是调用了线程的summit方法,其方法是没有返回值的情况。当需要线程池返回值时可以参考另一篇转载文章(https://blog.csdn.net/qq_24448899/article/details/79066717
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
以下是一个使用单例模式实现的线程池的C++示例: ```cpp #include <iostream> #include <vector> #include <queue> #include <thread> #include <mutex> #include <condition_variable> class ThreadPool { public: static ThreadPool& getInstance() { static ThreadPool instance; return instance; } void addTask(std::function<void()> task) { std::unique_lock<std::mutex> lock(mutex_); tasks_.push(task); condition_.notify_one(); } private: ThreadPool() { int numThreads = std::thread::hardware_concurrency(); for (int i = 0; i < numThreads; ++i) { threads_.emplace_back([this]() { while (true) { std::function<void()> task; { std::unique_lock<std::mutex> lock(mutex_); condition_.wait(lock, [this]() { return !tasks_.empty(); }); task = tasks_.front(); tasks_.pop(); } task(); } }); } } ~ThreadPool() { { std::unique_lock<std::mutex> lock(mutex_); stop_ = true; } condition_.notify_all(); for (std::thread& thread : threads_) { thread.join(); } } ThreadPool(const ThreadPool&) = delete; ThreadPool& operator=(const ThreadPool&) = delete; private: std::vector<std::thread> threads_; std::queue<std::function<void()>> tasks_; std::mutex mutex_; std::condition_variable condition_; bool stop_ = false; }; // 使用示例 void task1() { std::cout << "Task 1 executed" << std::endl; } void task2() { std::cout << "Task 2 executed" << std::endl; } int main() { ThreadPool& threadPool = ThreadPool::getInstance(); threadPool.addTask(task1); threadPool.addTask(task2); // 等待任务执行完成 std::this_thread::sleep_for(std::chrono::seconds(1)); return 0; } ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值