/* * Copyright (c) 2008, 2018, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. */ /* * @test * * @summary converted from VM Testbase jit/misctests/Pi. * VM Testbase keywords: [jit, quick] * * @library /vmTestbase * /test/lib * @run driver jdk.test.lib.FileInstaller . . * @build jit.misctests.Pi.Pi * @run driver ExecDriver --java jit.misctests.Pi.Pi */ package jit.misctests.Pi; import java.util.Random; import nsk.share.TestFailure; class Pi{ static double pi; static int imKreis=0, imQuadrat=0, i=0; public static void main(String args[]) { for(int i=0;i<=100;i++) { wurf(10000); pi=4.0*imKreis/imQuadrat; ausgabe(); } System.out.print("\n"); } static void wurf(int wieOft) { double x,y; Random zufall; zufall=new Random(); for(int i=0;i<=wieOft;i++) { x=zufall.nextDouble(); y=zufall.nextDouble(); imQuadrat++; if(x*x+y*y<1)imKreis++; } } static void ausgabe() { System.out.print(pi); if ((++i % 4) == 0){ System.out.print("\n"); } else { System.out.print(" "); } } }