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); |