()
| 45 | } |
| 46 | |
| 47 | private static final void testArray() { |
| 48 | traceFunc("testArray()"); |
| 49 | Item[] items = new Item[1750]; |
| 50 | |
| 51 | for (int iter=0; iter < ITERATION_COUNT; iter++) { |
| 52 | for (int i=0; i < 1000; i++) { |
| 53 | items[i] = new Item(1); |
| 54 | } |
| 55 | for (int i=0; i < 500; i++) { |
| 56 | items[i+1000] = new Item(4); |
| 57 | } |
| 58 | for (int i=0; i < 250; i++) { |
| 59 | items[i+1500] = new Item(9); |
| 60 | } |
| 61 | expect(runningSum(items) == (1000*1 + 500*4 + 250*9)); |
| 62 | Item[] zeroItems = new Item[300]; |
| 63 | for (int i=0; i < 300; i++) { |
| 64 | zeroItems[i] = new Item(0); |
| 65 | } |
| 66 | System.arraycopy(zeroItems, 0, items, 900, zeroItems.length); |
| 67 | for (int i=0; i < 10000; i++) { |
| 68 | items[0] = new Item(1); |
| 69 | } |
| 70 | expect(runningSum(items) == (900*1 + 300*4 + 250*9)); |
| 71 | for (int i=0; i < 300; i++) { |
| 72 | zeroItems[i] = new Item((i+900) < 1000 ? 1 : 4); |
| 73 | } |
| 74 | for (int i=0; i < 10000; i++) { |
| 75 | items[0] = new Item(1); |
| 76 | } |
| 77 | expect(runningSum(items) == (900*1 + 300*4 + 250*9)); |
| 78 | System.arraycopy(zeroItems, 0, items, 900, zeroItems.length); |
| 79 | expect(runningSum(items) == (1000*1 + 500*4 + 250*9)); |
| 80 | for (int i=0; i < 1750; i++) { |
| 81 | items[i] = null; |
| 82 | } |
| 83 | } |
| 84 | } |
| 85 | |
| 86 | private static final void testHashMap() { |
| 87 | traceFunc("testHashMap()"); |
no test coverage detected