阻塞队列(BlockingQueue)

阻塞队列(BlockingQueue)：ArrayBlockingQueue、LinkedBlockingQueue、PriorityBlockingQueue优先级队列

package queue;

import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.PriorityBlockingQueue;
import java.util.concurrent.TimeUnit;

import org.junit.Test;

/**
 * 阻塞队列是非常常见的数据结构，被广泛地应用到大数据和ee领域
 * 实现类：
 *  ArrayBlockingQueue 
 *  DelayQueue  
 *  LinkedBlockingQueue  
 *  PriorityBlockingQueue  
 *  SynchronousQueue 
 * @author zll
 *
 */
public class TestDemo {
	@SuppressWarnings("unchecked")
	@Test
	/* ArrayBlockingQueue 是一个有界的队列，要指定初始容量。但是理论上来说，可以达到无界，
	 * 比如分配大小是Integer.MAX_VALUE
	 * LinkedBlockingQueue 创建的默认的大小是Integer.MAX_VALUE
	 * 
	 * 此外，阻塞队列，是利用锁（重入锁，支持公平锁和非公平锁两种机制，锁的吞吐量要比Sychronized要高）来避免线程并发安全问题
	 * 
	 * 队列的特性：FIFO  
	 * 
	 * 如果队列满了之后：
	 * add（）会抛queue full异常
	 * offer()抛的特定值 是false
	 * put()会产生阻塞
	 * offer 阻塞超时，在指定的超时时间后，阻塞放开
	 */
	public void test01() throws Exception{
		@SuppressWarnings("rawtypes")
		ArrayBlockingQueue arrayBlockingQueue = new ArrayBlockingQueue(10);
		for (int i = 0; i < 10; i++) {
			arrayBlockingQueue.add(1);
		}
//		arrayBlockingQueue.add(1);
//		System.out.println(arrayBlockingQueue.offer(1));
//		arrayBlockingQueue.put(1);
		arrayBlockingQueue.offer(arrayBlockingQueue, 3000, TimeUnit.MILLISECONDS);
		System.out.println("阻塞放开");
	}
	@Test
	/*
	 * remove()返回是队里的对象，如果没有任何对象可取的，抛异常
	 * poll()抛的的特定值是null，这个有用，比如根据null来做条件判断
	 * take()会产生阻塞
	 * poll()超时阻塞
	 */
	public void test02() throws Exception{
		ArrayBlockingQueue arrayBlockingQueue = new ArrayBlockingQueue(10);
		arrayBlockingQueue.add(1);
		Object remove = arrayBlockingQueue.remove();
		System.out.println(remove.toString());
//		arrayBlockingQueue.remove();
//		System.out.println(arrayBlockingQueue.poll());
//		arrayBlockingQueue.take();
		arrayBlockingQueue.poll(3000, TimeUnit.MILLISECONDS);
		System.out.println("阻塞放开");
	}
	@Test
	/*
	 * 优先级队列具有排序的效果
	 */
	public void test03(){
		PriorityBlockingQueue priorityBlockingQueue = new PriorityBlockingQueue();
		Student student = new Student("doug cutting", 33);
		Student student2 = new Student("rod johson", 56);
		Student student3 = new Student("gaving king", 5);
		priorityBlockingQueue.add(student);
		priorityBlockingQueue.add(student2);
		priorityBlockingQueue.add(student3);
		System.out.println(priorityBlockingQueue.poll());
		System.out.println(priorityBlockingQueue.poll());
		System.out.println(priorityBlockingQueue.poll());
	}
}

package queue;

public class Student implements Comparable<Student>{
	String name;
	int socer;
	public Student(String name,int socer) {
		this.name = name;
		this.socer = socer;
	}
	public String getName() {
		return name;
	}
	public void setName(String name) {
		this.name = name;
	}
	public int getSocer() {
		return socer;
	}
	public void setSocer(int socer) {
		this.socer = socer;
	}
	@Override
	public String toString() {
		return "Student [name=" + name + ", socer=" + socer + "]";
	}
	@Override
	public int compareTo(Student o) {
		return o.getSocer()-this.getSocer();
	}
	
}