1 |
|
/* |
2 |
< |
* Copyright 2006 Sun Microsystems, Inc. All Rights Reserved. |
2 |
> |
* Copyright (c) 2006, Oracle and/or its affiliates. All rights reserved. |
3 |
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 |
|
* |
5 |
|
* This code is free software; you can redistribute it and/or modify it |
16 |
|
* 2 along with this work; if not, write to the Free Software Foundation, |
17 |
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
18 |
|
* |
19 |
< |
* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
20 |
< |
* CA 95054 USA or visit www.sun.com if you need additional information or |
21 |
< |
* have any questions. |
19 |
> |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
20 |
> |
* or visit www.oracle.com if you need additional information or have any |
21 |
> |
* questions. |
22 |
|
*/ |
23 |
|
|
24 |
|
/* |
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)); } |