0N/A/*
2362N/A * Copyright (c) 2006, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
0N/A * published by the Free Software Foundation.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
2362N/A * or visit www.oracle.com if you need additional information or have any
2362N/A * questions.
0N/A */
0N/A
0N/A/*
0N/A * @test
0N/A * @bug 5045582
0N/A * @summary binarySearch of Collections larger than 1<<30
0N/A * @author Martin Buchholz
0N/A */
0N/A
0N/Aimport java.util.*;
0N/A
0N/Apublic class BigBinarySearch {
0N/A
0N/A // Allows creation of very "big" collections without using too
0N/A // many real resources
0N/A static class SparseIntegerList
0N/A extends AbstractList<Integer>
0N/A implements RandomAccess
0N/A {
0N/A private Map<Integer,Integer> m = new HashMap<Integer,Integer>();
0N/A
0N/A public Integer get(int i) {
0N/A if (i < 0) throw new IndexOutOfBoundsException(""+i);
0N/A Integer v = m.get(i);
0N/A return (v == null) ? Integer.valueOf(0) : v;
0N/A }
0N/A
0N/A public int size() {
0N/A return Collections.max(m.keySet()) + 1;
0N/A }
0N/A
0N/A public Integer set(int i, Integer v) {
0N/A if (i < 0) throw new IndexOutOfBoundsException(""+i);
0N/A Integer ret = get(i);
0N/A if (v == 0)
0N/A m.remove(i);
0N/A else
0N/A m.put(i, v);
0N/A return ret;
0N/A }
0N/A }
0N/A
0N/A /** Check that binarySearch finds an element where we got it */
0N/A private static void checkBinarySearch(List<Integer> l, int i) {
0N/A try { equal(i, Collections.binarySearch(l, l.get(i))); }
0N/A catch (Throwable t) { unexpected(t); }
0N/A }
0N/A
0N/A /** Check that binarySearch finds an element where we got it */
0N/A private static void checkBinarySearch(List<Integer> l, int i,
0N/A Comparator<Integer> comparator) {
0N/A try { equal(i, Collections.binarySearch(l, l.get(i), comparator)); }
0N/A catch (Throwable t) { unexpected(t); }
0N/A }
0N/A
0N/A private static void realMain(String[] args) throws Throwable {
0N/A final int n = (1<<30) + 47;
0N/A
0N/A System.out.println("binarySearch(List<Integer>, Integer)");
0N/A List<Integer> big = new SparseIntegerList();
0N/A big.set( 0, -44);
0N/A big.set( 1, -43);
0N/A big.set(n-2, 43);
0N/A big.set(n-1, 44);
0N/A int[] ints = { 0, 1, n-2, n-1 };
0N/A Comparator<Integer> reverse = Collections.reverseOrder();
0N/A Comparator<Integer> natural = Collections.reverseOrder(reverse);
0N/A
0N/A for (int i : ints) {
0N/A checkBinarySearch(big, i);
0N/A checkBinarySearch(big, i, null);
0N/A checkBinarySearch(big, i, natural);
0N/A }
0N/A for (int i : ints)
0N/A big.set(i, - big.get(i));
0N/A for (int i : ints)
0N/A checkBinarySearch(big, i, reverse);
0N/A }
0N/A
0N/A //--------------------- Infrastructure ---------------------------
0N/A static volatile int passed = 0, failed = 0;
0N/A static void pass() {passed++;}
0N/A static void fail() {failed++; Thread.dumpStack();}
0N/A static void fail(String msg) {System.out.println(msg); fail();}
0N/A static void unexpected(Throwable t) {failed++; t.printStackTrace();}
0N/A static void check(boolean cond) {if (cond) pass(); else fail();}
0N/A static void equal(Object x, Object y) {
0N/A if (x == null ? y == null : x.equals(y)) pass();
0N/A else fail(x + " not equal to " + y);}
0N/A public static void main(String[] args) throws Throwable {
0N/A try {realMain(args);} catch (Throwable t) {unexpected(t);}
0N/A System.out.printf("%nPassed = %d, failed = %d%n%n", passed, failed);
0N/A if (failed > 0) throw new AssertionError("Some tests failed");}
0N/A}