| 18 | |
| 19 | public class SimpleDeques { |
| 20 | static void test(Deque<String> deque) { |
| 21 | CountString s1 = new CountString(), |
| 22 | s2 = new CountString(20); |
| 23 | for(int n = 0; n < 8; n++) { |
| 24 | deque.offerFirst(s1.get()); |
| 25 | deque.offerLast(s2.get()); // Same as offer() |
| 26 | } |
| 27 | System.out.println(deque); |
| 28 | String result = ""; |
| 29 | while(deque.size() > 0) { |
| 30 | System.out.print(deque.peekFirst() + " "); |
| 31 | result += deque.pollFirst() + " "; |
| 32 | System.out.print(deque.peekLast() + " "); |
| 33 | result += deque.pollLast() + " "; |
| 34 | } |
| 35 | System.out.println("\n" + result); |
| 36 | } |
| 37 | public static void main(String[] args) { |
| 38 | int count = 10; |
| 39 | System.out.println("LinkedList"); |