28 |
|
* @author Martin Buchholz |
29 |
|
*/ |
30 |
|
|
31 |
< |
import java.util.*; |
31 |
> |
import java.util.AbstractList; |
32 |
> |
import java.util.Collections; |
33 |
> |
import java.util.Comparator; |
34 |
> |
import java.util.HashMap; |
35 |
> |
import java.util.List; |
36 |
> |
import java.util.Map; |
37 |
> |
import java.util.RandomAccess; |
38 |
|
|
39 |
|
public class BigBinarySearch { |
40 |
|
|
44 |
|
extends AbstractList<Integer> |
45 |
|
implements RandomAccess |
46 |
|
{ |
47 |
< |
private Map<Integer,Integer> m = new HashMap<Integer,Integer>(); |
47 |
> |
private Map<Integer,Integer> m = new HashMap<>(); |
48 |
|
|
49 |
|
public Integer get(int i) { |
50 |
|
if (i < 0) throw new IndexOutOfBoundsException(""+i); |
67 |
|
} |
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 |
|
try { equal(i, Collections.binarySearch(l, l.get(i))); } |
73 |
|
catch (Throwable t) { unexpected(t); } |
74 |
|
} |
75 |
|
|
76 |
< |
/** Check that binarySearch finds an element where we got it */ |
76 |
> |
/** Checks that binarySearch finds an element where we got it. */ |
77 |
|
private static void checkBinarySearch(List<Integer> l, int i, |
78 |
|
Comparator<Integer> comparator) { |
79 |
|
try { equal(i, Collections.binarySearch(l, l.get(i), comparator)); } |