0N/A/*
2362N/A * Copyright (c) 2007, 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 6410729 6586631
0N/A * @summary Test previousClearBit, previousSetBit
0N/A */
0N/A
0N/Aimport java.util.*;
0N/A
0N/Apublic class PreviousBits {
0N/A
0N/A void testHashCode(final BitSet s) {
0N/A long h = 1234;
0N/A long[] words = s.toLongArray();
0N/A for (int i = words.length; --i >= 0; )
0N/A h ^= words[i] * (i + 1);
0N/A equal((int)((h >> 32) ^ h), s.hashCode());
0N/A }
0N/A
0N/A void testOutOfBounds(final BitSet s) {
0N/A THROWS(IndexOutOfBoundsException.class,
0N/A new F(){void f(){ s.previousSetBit(-2);}},
0N/A new F(){void f(){ s.previousClearBit(-2);}},
0N/A new F(){void f(){ s.previousSetBit(Integer.MIN_VALUE);}},
0N/A new F(){void f(){ s.previousClearBit(Integer.MIN_VALUE);}},
0N/A new F(){void f(){ s.nextSetBit(-1);}},
0N/A new F(){void f(){ s.nextClearBit(-1);}},
0N/A new F(){void f(){ s.nextSetBit(Integer.MIN_VALUE);}},
0N/A new F(){void f(){ s.nextClearBit(Integer.MIN_VALUE);}});
0N/A }
0N/A
0N/A void test(String[] args) throws Throwable {
0N/A final BitSet s = new BitSet();
0N/A
0N/A // Test empty bitset
0N/A testOutOfBounds(s);
0N/A testHashCode(s);
0N/A
0N/A for (int i = -1; i < 93;) {
0N/A equal(-1, s.previousSetBit(i));
0N/A equal( i, s.previousClearBit(i));
0N/A i++;
0N/A equal(-1, s.nextSetBit(i));
0N/A equal( i, s.nextClearBit(i));
0N/A }
0N/A
0N/A // Test "singleton" bitsets
0N/A for (int j = 0; j < 161; j++) {
0N/A s.clear();
0N/A s.set(j);
0N/A testOutOfBounds(s);
0N/A testHashCode(s);
0N/A
0N/A for (int i = -1; i < j; i++) {
0N/A equal(-1, s.previousSetBit(i));
0N/A equal( i, s.previousClearBit(i));
0N/A if (i >= 0) {
0N/A equal(j, s.nextSetBit(i));
0N/A equal(i, s.nextClearBit(i));
0N/A }
0N/A }
0N/A
0N/A equal(j, s.previousSetBit(j));
0N/A equal(j-1, s.previousClearBit(j));
0N/A equal(j, s.nextSetBit(j));
0N/A equal(j+1, s.nextClearBit(j));
0N/A
0N/A for (int i = j+1; i < j+100; i++) {
0N/A equal(j, s.previousSetBit(i));
0N/A equal(i, s.previousClearBit(i));
0N/A equal(-1, s.nextSetBit(i));
0N/A equal(i, s.nextClearBit(i));
0N/A }
0N/A }
0N/A
0N/A // set even bits
0N/A s.clear();
0N/A for (int i = 0; i <= 128; i+=2)
0N/A s.set(i);
0N/A testHashCode(s);
0N/A for (int i = 1; i <= 128; i++) {
0N/A equal(s.previousSetBit(i),
0N/A ((i & 1) == 0) ? i : i - 1);
0N/A equal(s.previousClearBit(i),
0N/A ((i & 1) == 0) ? i - 1 : i);
0N/A }
0N/A
0N/A // set odd bits as well
0N/A for (int i = 1; i <= 128; i+=2)
0N/A s.set(i);
0N/A testHashCode(s);
0N/A for (int i = 1; i <= 128; i++) {
0N/A equal(s.previousSetBit(i), i);
0N/A equal(s.previousClearBit(i), -1);
0N/A }
0N/A
0N/A // Test loops documented in javadoc
0N/A Random rnd = new Random();
0N/A s.clear();
0N/A for (int i = 0; i < 10; i++)
0N/A s.set(rnd.nextInt(1066));
0N/A List<Integer> down = new ArrayList<Integer>();
0N/A for (int i = s.length(); (i = s.previousSetBit(i-1)) >= 0; )
0N/A down.add(i);
0N/A List<Integer> up = new ArrayList<Integer>();
0N/A for (int i = s.nextSetBit(0); i >= 0; i = s.nextSetBit(i+1))
0N/A up.add(i);
0N/A Collections.reverse(up);
0N/A equal(up, down);
0N/A }
0N/A
0N/A //--------------------- Infrastructure ---------------------------
0N/A volatile int passed = 0, failed = 0;
0N/A void pass() {passed++;}
0N/A void fail() {failed++; Thread.dumpStack();}
0N/A void fail(String msg) {System.err.println(msg); fail();}
0N/A void unexpected(Throwable t) {failed++; t.printStackTrace();}
0N/A void check(boolean cond) {if (cond) pass(); else fail();}
0N/A 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 new PreviousBits().instanceMain(args);}
0N/A void instanceMain(String[] args) throws Throwable {
0N/A try {test(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 abstract class F {abstract void f() throws Throwable;}
0N/A void THROWS(Class<? extends Throwable> k, F... fs) {
0N/A for (F f : fs)
0N/A try {f.f(); fail("Expected " + k.getName() + " not thrown");}
0N/A catch (Throwable t) {
0N/A if (k.isAssignableFrom(t.getClass())) pass();
0N/A else unexpected(t);}}
0N/A}