2015-12-15 11:47:04 -08:00
|
|
|
// collections/QueueDemo.java
|
|
|
|
// (c)2016 MindView LLC: see Copyright.txt
|
2015-11-15 15:51:35 -08:00
|
|
|
// We make no guarantees that this code is fit for any purpose.
|
|
|
|
// Visit http://mindviewinc.com/Books/OnJava/ for more book information.
|
2016-01-25 18:05:55 -08:00
|
|
|
// Upcasting to a Queue from a LinkedList
|
2015-06-15 17:47:35 -07:00
|
|
|
import java.util.*;
|
|
|
|
|
|
|
|
public class QueueDemo {
|
|
|
|
public static void printQ(Queue queue) {
|
|
|
|
while(queue.peek() != null)
|
|
|
|
System.out.print(queue.remove() + " ");
|
|
|
|
System.out.println();
|
|
|
|
}
|
|
|
|
public static void main(String[] args) {
|
|
|
|
Queue<Integer> queue = new LinkedList<>();
|
|
|
|
Random rand = new Random(47);
|
|
|
|
for(int i = 0; i < 10; i++)
|
|
|
|
queue.offer(rand.nextInt(i + 10));
|
|
|
|
printQ(queue);
|
|
|
|
Queue<Character> qc = new LinkedList<>();
|
|
|
|
for(char c : "Brontosaurus".toCharArray())
|
|
|
|
qc.offer(c);
|
|
|
|
printQ(qc);
|
|
|
|
}
|
2015-09-07 11:44:36 -06:00
|
|
|
}
|
|
|
|
/* Output:
|
2015-06-15 17:47:35 -07:00
|
|
|
8 1 1 1 5 14 3 1 0 1
|
|
|
|
B r o n t o s a u r u s
|
2015-09-07 11:44:36 -06:00
|
|
|
*/
|