1 /*
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
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
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 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 /*
25 * @test
26 * @bug 5045582
27 * @summary binarySearch of Collections larger than 1<<30
28 * @author Martin Buchholz
29 */
30
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
41 // Allows creation of very "big" collections without using too
42 // many real resources
43 static class SparseIntegerList
44 extends AbstractList<Integer>
45 implements RandomAccess
46 {
47 private Map<Integer,Integer> m = new HashMap<>();
48
49 public Integer get(int i) {
50 if (i < 0) throw new IndexOutOfBoundsException(""+i);
51 Integer v = m.get(i);
52 return (v == null) ? Integer.valueOf(0) : v;
53 }
54
55 public int size() {
56 return Collections.max(m.keySet()) + 1;
57 }
58
59 public Integer set(int i, Integer v) {
60 if (i < 0) throw new IndexOutOfBoundsException(""+i);
61 Integer ret = get(i);
62 if (v == 0)
63 m.remove(i);
64 else
65 m.put(i, v);
66 return ret;
67 }
68 }
69
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 /** 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)); }
80 catch (Throwable t) { unexpected(t); }
81 }
82
83 private static void realMain(String[] args) throws Throwable {
84 final int n = (1<<30) + 47;
85
86 System.out.println("binarySearch(List<Integer>, Integer)");
87 List<Integer> big = new SparseIntegerList();
88 big.set( 0, -44);
89 big.set( 1, -43);
90 big.set(n-2, 43);
91 big.set(n-1, 44);
92 int[] ints = { 0, 1, n-2, n-1 };
93 Comparator<Integer> reverse = Collections.reverseOrder();
94 Comparator<Integer> natural = Collections.reverseOrder(reverse);
95
96 for (int i : ints) {
97 checkBinarySearch(big, i);
98 checkBinarySearch(big, i, null);
99 checkBinarySearch(big, i, natural);
100 }
101 for (int i : ints)
102 big.set(i, - big.get(i));
103 for (int i : ints)
104 checkBinarySearch(big, i, reverse);
105 }
106
107 //--------------------- Infrastructure ---------------------------
108 static volatile int passed = 0, failed = 0;
109 static void pass() {passed++;}
110 static void fail() {failed++; Thread.dumpStack();}
111 static void fail(String msg) {System.out.println(msg); fail();}
112 static void unexpected(Throwable t) {failed++; t.printStackTrace();}
113 static void check(boolean cond) {if (cond) pass(); else fail();}
114 static void equal(Object x, Object y) {
115 if (x == null ? y == null : x.equals(y)) pass();
116 else fail(x + " not equal to " + y);}
117 public static void main(String[] args) throws Throwable {
118 try {realMain(args);} catch (Throwable t) {unexpected(t);}
119 System.out.printf("%nPassed = %d, failed = %d%n%n", passed, failed);
120 if (failed > 0) throw new AssertionError("Some tests failed");}
121 }