zoukankan      html  css  js  c++  java
  • CountDownLatch测试

    /**
    * 调用方法 countDown(),会将初始化的值减少一次;
    * 调用方法 await(),线程会在此等待,直到计时器为0,即被唤醒
    */

    public static void main(String[] args) { final ThreadPoolExecutor countDownLatchExecutor = new ThreadPoolExecutor( 1, 10, 0, TimeUnit.SECONDS, new SynchronousQueue<Runnable>(), new ThreadFactoryBuilder() .setNameFormat("CountDownLatch-Executor-%d") .setDaemon(true) .build() ); CountDownLatch latch = new CountDownLatch(T_COUNT); for (int i = 0; i < T_COUNT; i++) { Runnable task = new Runnable() { @Override public void run() { System.out.println(Thread.currentThread().getName() + "执行完毕,等待其他线程执行"); latch.countDown(); } }; countDownLatchExecutor.submit(task); } try { latch.await(); } catch (InterruptedException e) { e.printStackTrace(); } System.out.println(Thread.currentThread().getName() + " 任务结束,主线程执行"); countDownLatchExecutor.shutdown(); }
  • 相关阅读:
    Expanding Rods(二分)
    Monthly Expense(二分)
    sdut1269 走迷宫(dfs)
    走迷宫(dfs)
    C Looooops(扩展欧几里得+模线性方程)
    41. First Missing Positive
    40. Combination Sum II
    39. Combination Sum
    37. Sudoku Solver
    36. Valid Sudoku
  • 原文地址:https://www.cnblogs.com/mmh760/p/14308165.html
Copyright © 2011-2022 走看看