并发-新类库中的构件 PriorityBlockingQueue

PriorityBlockingQueue

  • 基础的优先级队列,具有可阻塞的读取操作。优先级队列 中的对象是按照优先级顺序从队列中出现的任务。
package com21concurrent;

import java.util.ArrayList;
import java.util.List;
import java.util.Queue;
import java.util.Random;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.PriorityBlockingQueue;
import java.util.concurrent.TimeUnit;

/**
 * Created by Panda on 2018/6/1.
 */
class PrioritizedTask implements Runnable,Comparable<PrioritizedTask>{
    private Random random = new Random(47);
    private static int counter=0;
    private final int id=counter++;
    private final int priority;
    protected static List<PrioritizedTask> sequence=new ArrayList<>();

    public PrioritizedTask(int priority) {
        this.priority = priority;
        sequence.add(this);
    }

    @Override
    public int compareTo(PrioritizedTask o) {
        return priority<o.priority?1:(priority>o.priority?-1:0);
    }

    @Override
    public void run() {
       try{
            TimeUnit.MILLISECONDS.sleep(random.nextInt(250));
        }catch (InterruptedException e){

       }
        System.out.println(this);
    }

    public String toString(){
        return String.format("[%1$-3d]",priority)+" Task "+id;
    }
    public String summary(){
        return "("+id+":"+priority+")";
    }

    public  static  class EndSentinel extends PrioritizedTask{
        private ExecutorService executorService;

        public EndSentinel( ExecutorService executorService) {
            super(-1);
            this.executorService = executorService;
        }

        public void run(){
            int count=0;
            for(PrioritizedTask prioritizedTask:sequence){
                System.out.print(prioritizedTask.summary());
                if(++count%5==0) System.out.println();
            }
            System.out.println();
            System.out.println(this+"calling shutdownNow()");
            executorService.shutdownNow();
        }
    }
}

class PrioritizedTaskProducer implements Runnable{
    private Random random = new Random(47);
    private Queue<Runnable> queue;
    private ExecutorService executorService ;

    public PrioritizedTaskProducer(Queue<Runnable> queue, ExecutorService executorService) {
        this.queue = queue;
        this.executorService = executorService;
    }

    @Override
    public void run() {
        for (int i = 0; i < 20; i++) {
            queue.add(new PrioritizedTask(random.nextInt(10)));
            Thread.yield();
        }

        try{
            for (int i = 0; i <10 ; i++) {
                TimeUnit.MILLISECONDS.sleep(250);
                queue.add(new PrioritizedTask(10));
            }

            for (int i = 0; i <10 ; i++) {
                queue.add(new PrioritizedTask(i));
            }
            queue.add(new PrioritizedTask.EndSentinel(executorService));
        }catch (InterruptedException e){

        }
        System.out.println("Finished PrioritizedTaskProducer");
    }
}

class PrioritizedTaskConsumer implements Runnable{
    private PriorityBlockingQueue<Runnable> runnables;

    public PrioritizedTaskConsumer(PriorityBlockingQueue<Runnable> runnables) {
        this.runnables = runnables;
    }


    @Override
    public void run() {
        try{
            while (!Thread.interrupted()){
                runnables.take().run();
            }
        }catch (InterruptedException e){

        }
        System.out.println("Finished PrioritizedTaskConsumer");
    }
}

public class PriorityBlockingQueueDemo {
    public static void main(String[] args) {
        Random random = new Random(47);
        ExecutorService executorService = Executors.newCachedThreadPool();
        PriorityBlockingQueue<Runnable> queue = new PriorityBlockingQueue<>();
        executorService.execute(new PrioritizedTaskProducer(queue,executorService));
        executorService.execute(new PrioritizedTaskConsumer(queue));
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值