38 |
|
extends AbstractList<Integer> |
39 |
|
implements RandomAccess |
40 |
|
{ |
41 |
< |
private Map<Integer,Integer> m = new HashMap<Integer,Integer>(); |
41 |
> |
private Map<Integer,Integer> m = new HashMap<>(); |
42 |
|
|
43 |
|
public Integer get(int i) { |
44 |
|
if (i < 0) throw new IndexOutOfBoundsException(""+i); |
61 |
|
} |
62 |
|
} |
63 |
|
|
64 |
< |
/** Check that binarySearch finds an element where we got it */ |
64 |
> |
/** Checks that binarySearch finds an element where we got it. */ |
65 |
|
private static void checkBinarySearch(List<Integer> l, int i) { |
66 |
|
try { equal(i, Collections.binarySearch(l, l.get(i))); } |
67 |
|
catch (Throwable t) { unexpected(t); } |
68 |
|
} |
69 |
|
|
70 |
< |
/** Check that binarySearch finds an element where we got it */ |
70 |
> |
/** Checks that binarySearch finds an element where we got it. */ |
71 |
|
private static void checkBinarySearch(List<Integer> l, int i, |
72 |
|
Comparator<Integer> comparator) { |
73 |
|
try { equal(i, Collections.binarySearch(l, l.get(i), comparator)); } |