ConcurrentLinkedQueue Demo

ConcurrentLinkedQueue是一种线程安全的队列。他是使用非阻塞算法（CAS）来实现线程安全的。ConcurrentLinkedQueue是一个基于链接节点的无界线程安全队列，它采用先进先出的规则对节点进行排序，当我们添加一个元素的时候，它会添加到队列的尾部；当我们获取一个元素时，它会返回队列头部的元素。
思考：下面的demo在单线程情况下甚至比多线程更快！

import java.util.concurrent.ConcurrentLinkedQueue;
import java.util.concurrent.CountDownLatch;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;

public class ConcurrentLinkedQueueTest {
    private static ConcurrentLinkedQueue<Integer> queue = new ConcurrentLinkedQueue<Integer>();
    private static int count = 100000;
    private static int count2 = 3;
    private static CountDownLatch cd = new CountDownLatch(count2);
    public static void dothis() 
    {
        for(int i = 0; i < count; i++) {
            queue.offer(i);//提供
        }
    }
    public static void main(String[] args) throws InterruptedException {
        long timeStart = System.currentTimeMillis();
        ExecutorService es = Executors.newFixedThreadPool(count2);
        ConcurrentLinkedQueueTest.dothis();
//      Thread.sleep(1000);
        for(int i = 0; i < count2; i++) 
        {
            es.submit(new Poll());
        }
        cd.await();
        System.out.println("cost time " + (System.currentTimeMillis()-timeStart) + " ms");
        es.shutdown();
    }
    static class Poll implements Runnable {
        public void run() {
            ////size() 是要遍历一遍集合，O(n)时间复杂度，所以尽量要避免用size()而改用isEmpty().
            //while(queue.size() > 0) {
            while(!queue.isEmpty()){
                System.out.println(queue.poll()); //剪短
            }
            cd.countDown();
        }
    }

}

参考链接：http://blog.csdn.net/fuyuwei2015/article/details/72667593