1 /* 2 * Copyright (c) 1999, 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 4187412 27 * @summary The FCS release of 1.2 did not special case the Random.nextInt 28 * calculation for a power of two modulus, as mandated by the spec. 29 */ 30 31 package test.java.util.Random; 32 33 import java.util.Random; 34 35 public class NextIntPowerOfTwoMod { main(String[] args)36 public static void main(String[] args) throws Exception { 37 Random r = new Random(69); 38 int total = 0; 39 for (int i=0; i<1000; i++) 40 total += r.nextInt(16); 41 if (total != 7639) 42 throw new RuntimeException("Not using correct algorithm."); 43 } 44 } 45