Queue小研究

有关java队列(Queue)小总结
队列是先进先出(FIFO)
1.入队列 offer(obj);
2.出队列 poll();
3.增加一元素 add(obj);
4.增加一集合 add(c);
5.读头元素 peek() or element()
6.取队列长度 size();
7.清队列 clear()
参考代码如下:

package com.queue;

import java.util.ArrayList;
import java.util.Collection;
import java.util.LinkedList;
import java.util.Queue;

public class QueueTest {
	private static Queue<String> q =  new LinkedList<String>();
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		String a[] = new String[]{"a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"};
		Collection<String> c = new ArrayList<String>();
		c.add("1");
		c.add("2");
		c.add("3");

		//Putting the element into queue
		for(int i=0;i<a.length;i++) {
			q.offer(a[i]);
		}
		//Getting the head element of queue
		System.out.println(q.peek());
		System.out.println(q.element());
		q.add("0");
		q.addAll(c);
		//Getting the size of queue
		System.out.println(q.size());
		//Pop the element
		while (q.size() > 0){
		   System.out.print(q.poll() + ",");
		}
		//Remove all element of queue
		q.clear();
	}
}