1 /* 2 * Copyright (c) 2019, 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. Oracle designates this 8 * particular file as subject to the "Classpath" exception as provided 9 * by Oracle in the LICENSE file that accompanied this code. 10 * 11 * This code is distributed in the hope that it will be useful, but WITHOUT 12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 14 * version 2 for more details (a copy is included in the LICENSE file that 15 * accompanied this code). 16 * 17 * You should have received a copy of the GNU General Public License version 18 * 2 along with this work; if not, write to the Free Software Foundation, 19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 20 * 21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 22 * or visit www.oracle.com if you need additional information or have any 23 * questions. 24 */ 25 26 import java.util.Random; 27 28 /* 29 * @test 30 * @bug 8226297 31 * @run main FailedFloat 32 */ 33 public class FailedFloat { 34 private static final int MAX_N = (1 << 13) /* Arrays.MIN_ARRAY_SORT_GRAN */ + 10; 35 36 public static void main(String[] args) { 37 float[] a = new float[MAX_N]; 38 random(a); 39 java.util.Arrays.parallelSort(a); 40 check(a); 41 System.out.println("PASSED"); 42 } 43 44 private static void random(float[] a) { 45 Random random = new Random(777); 46 for (int i = 0; i < MAX_N; i++) { 47 a[i] = random.nextBoolean() ? -0.0f : 0.0f; 48 } 49 } 50 51 private static void check(float[] a) { 52 for (int i = 0; i < a.length - 1; ++i) { 53 if (Float.floatToRawIntBits(a[i]) == 0 && Float.floatToRawIntBits(a[i + 1]) < 0) { 54 throw new RuntimeException(a[i] + " goes before "+ a[i + 1] + " at position " + i); 55 } 56 } 57 } 58 }