(boolean desc)
| 40 | } |
| 41 | |
| 42 | private static void iterateTest(boolean desc) { |
| 43 | int testQty = 10; |
| 44 | LinkedList<Object> compareList = new LinkedList<Object>(); |
| 45 | ArrayDeque<Object> ad = new ArrayDeque<Object>(); |
| 46 | |
| 47 | for (int i = 0; i < testQty; i++) { |
| 48 | Object o = new Object(); |
| 49 | compareList.add(o); |
| 50 | ad.add(o); |
| 51 | } |
| 52 | |
| 53 | Iterator<Object> compIt; |
| 54 | Iterator<Object> testIt; |
| 55 | if (desc) { |
| 56 | compIt = compareList.descendingIterator(); |
| 57 | testIt = ad.descendingIterator(); |
| 58 | } else { |
| 59 | compIt = compareList.iterator(); |
| 60 | testIt = ad.iterator(); |
| 61 | } |
| 62 | while (testIt.hasNext()) { |
| 63 | verify(testIt.next() == compIt.next()); |
| 64 | } |
| 65 | |
| 66 | // remove from the front |
| 67 | compareList.removeFirst(); |
| 68 | ad.removeFirst(); |
| 69 | |
| 70 | if (desc) { |
| 71 | compIt = compareList.descendingIterator(); |
| 72 | testIt = ad.descendingIterator(); |
| 73 | } else { |
| 74 | compIt = compareList.iterator(); |
| 75 | testIt = ad.iterator(); |
| 76 | } |
| 77 | while (testIt.hasNext()) { |
| 78 | verify(testIt.next() == compIt.next()); |
| 79 | } |
| 80 | |
| 81 | // remove from the end |
| 82 | compareList.removeLast(); |
| 83 | ad.removeLast(); |
| 84 | |
| 85 | if (desc) { |
| 86 | compIt = compareList.descendingIterator(); |
| 87 | testIt = ad.descendingIterator(); |
| 88 | } else { |
| 89 | compIt = compareList.iterator(); |
| 90 | testIt = ad.iterator(); |
| 91 | } |
| 92 | while (testIt.hasNext()) { |
| 93 | verify(testIt.next() == compIt.next()); |
| 94 | } |
| 95 | } |
| 96 | |
| 97 | private static void iteratorRemoveTest(boolean desc) { |
| 98 | int testQty = 20; |
no test coverage detected