DelayQueue

package concurrency;

import static java.util.concurrent.TimeUnit.MILLISECONDS;
import static java.util.concurrent.TimeUnit.NANOSECONDS;
import static util.Print.print;

import java.util.ArrayList;
import java.util.List;
import java.util.Random;
import java.util.concurrent.DelayQueue;
import java.util.concurrent.Delayed;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.TimeUnit;

class DelayedTask implements Runnable, Delayed
{

	private static int counter = 0;

	private final int id = counter++;

	private final int delta;

	private final long trigger;

	/**
	 * 为子类做统计而创建保存队列的集合
	 */
	protected static List<DelayedTask> sequence = new ArrayList<DelayedTask>();

	public DelayedTask(int delayInMillseconds)
	{
		delta = delayInMillseconds;
		trigger = System.nanoTime() + NANOSECONDS.convert(delta, MILLISECONDS);
		sequence.add(this);
	}

	public int compareTo(Delayed o)
	{
		DelayedTask that = (DelayedTask) o;
		if (this.trigger < that.trigger)
			return -1;
		if (this.trigger > that.trigger)
			return 1;
		return 0;
	}

	public long getDelay(TimeUnit unit)
	{
		return unit.convert(trigger - System.nanoTime(), NANOSECONDS);
	}

	public void run()
	{
		print(this + " ");
	}

	@Override
	public String toString()
	{
		// return String.format("%1$-4d", delta + " Task : " + id);
		return String.format("[%1$-4d]", delta) + " Task " + id;
	}

	public String summary()
	{
		return "(" + id + " : " + delta + " )";
	}

	
	/**
	 *	用于关闭线程池
	 *  以及打印输出所有DelayedTask任务参数的一个小兵
	 */
	public static class Endsentinel extends DelayedTask
	{
		private ExecutorService exec = null;

		public Endsentinel(int delayInMillseconds, ExecutorService e)
		{
			super(delayInMillseconds);
			exec = e;
		}

		public void run()
		{
			for (DelayedTask pt : sequence)
			{
				print(pt.summary() + " ");
			}
			print();
			print(this + "Calling shutdownNow()");
			exec.shutdownNow();
		}
	}
}

class DelayedTaskConsumer implements Runnable
{
	private DelayQueue<DelayedTask> q;

	public DelayedTaskConsumer(DelayQueue<DelayedTask> q)
	{
		this.q = q;
	}

	public void run()
	{
		try
		{
			while (!Thread.interrupted())
			{
				q.take().run();
			}
		} catch (InterruptedException e)
		{
			// Acceptable way to exit;
			print("DelayedTaskConsumer InterruptedException");
		}
		print("Finished DelayedTaskConsumer");
	}
}

public class DelayQueueDemo
{
	public static void main(String args[])
	{
		Random rand = new Random(47);
		
		ExecutorService exec = Executors.newCachedThreadPool();
		DelayQueue<DelayedTask> queue = new DelayQueue<DelayedTask>();
		// Fill with tasks that have random delays:

		//添加20个人物,任务的优先级随机
		for (int i = 0; i < 20; i++)
		{
			queue.put(new DelayedTask(rand.nextInt(5000)));
		}
		//添加一个最大的DelayedTask,最后执行,关闭线程池
		queue.add(new DelayedTask.Endsentinel(5000, exec));
		//执行DelayedTask,按照trigger排序进行人物,trigger越小,DelayedTask优先执行权越高
		exec.execute(new DelayedTaskConsumer(queue));
	}
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
DelayQueue是一个通过PriorityBlockingQueue实现延迟获取元素的无界阻塞队列。在DelayQueue中添加的元素必须实现Delayed接口,并且只有在延迟期满后才能从队列中提取元素。\[2\]DelayQueue常用于需要延迟处理任务的场景,比如在网上商城下单后,如果超时未支付,订单会被后台系统关闭,这种需要延时处理的场景可以使用DelayQueue来实现。\[3\]DelayQueue的实现原理是基于PriorityBlockingQueue,它是一个无界阻塞队列,可以按照元素的优先级进行排序。\[2\]DelayQueue的源码定义如下:public class DelayQueue<E extends Delayed> extends AbstractQueue<E> implements BlockingQueue<E> { // ... }\[3\] #### 引用[.reference_title] - *1* *2* [延迟队列DelayQueue原理](https://blog.csdn.net/c15158032319/article/details/118636233)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v91^control_2,239^v3^insert_chatgpt"}} ] [.reference_item] - *3* [Java 延迟队列 DelayQueue 的原理](https://blog.csdn.net/piaoranyuji/article/details/124042408)[target="_blank" data-report-click={"spm":"1018.2226.3001.9630","extra":{"utm_source":"vip_chatgpt_common_search_pc_result","utm_medium":"distribute.pc_search_result.none-task-cask-2~all~insert_cask~default-1-null.142^v91^control_2,239^v3^insert_chatgpt"}} ] [.reference_item] [ .reference_list ]
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值