This software links to Mikko Tommila's Apfloat library and to Karsten Lentzsch's 26 | JGoodies.
27 |Copyright © 2009 Mikko Tommila
29 |This library is free software; you can redistribute it and/or modify it under 30 | the terms of the GNU Lesser General Public License as published by the Free Software 31 | Foundation; either version 2.1 of the License, or (at your option) any later version.
32 |This library is distributed in the hope that it will be useful, but WITHOUT ANY 33 | WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A 34 | PARTICULAR PURPOSE. See the 35 | GNU Lesser General Public License for more details.
36 |If you have any questions or need a different type of license, please contact 37 | Mikko at ApfloatOrg.
38 |Copyright © Karsten Lentzsch
40 |The libraries are provided under the terms of the 41 | BSD open source 42 | license.
43 |Here are the 44 | libraries 45 | from. If you want to contact the 46 | author Karsten Lentzsch.
47 |Copyright © Peter Luschny
49 |The MIT license 50 | applies. Visit the 51 | homepage 52 | of fast factorial functions. Comments mail to peter AT luschny POINT de.
53 | 54 | 55 | 56 | 57 | -------------------------------------------------------------------------------- /JavaFactorial/src/de/luschny/apps/StopWatch.java: -------------------------------------------------------------------------------- 1 | // Copyright (C) 2004-2009 Peter Luschny, MIT License applies. 2 | // See http://en.wikipedia.org/wiki/MIT_License 3 | // Visit http://www.luschny.de/math/factorial/FastFactorialFunctions.htm 4 | // Comments mail to: peter(at)luschny.de 5 | package de.luschny.apps; 6 | 7 | /** 8 | * StopWatch 9 | * 10 | * @author Peter Luschny 11 | * @version 2001-05-12 12 | */ 13 | public class StopWatch { 14 | 15 | private long elapsedCount; 16 | private long startCount; 17 | 18 | /** 19 | * Start the time-counter. 20 | */ 21 | public void start() { 22 | startCount = System.currentTimeMillis(); 23 | } 24 | 25 | /** 26 | * Stop the time-counter 27 | */ 28 | public void stop() { 29 | final long stopCount = System.currentTimeMillis(); 30 | elapsedCount += (stopCount - startCount); 31 | } 32 | 33 | /** 34 | * Clear the elapsed time-counter. 35 | */ 36 | public void clear() { 37 | elapsedCount = 0; 38 | } 39 | 40 | /** 41 | * Get the elapsed time converted to seconds. 42 | * 43 | * @return elapsed time converted to seconds 44 | */ 45 | public double getSeconds() { 46 | return elapsedCount / 1000.0; 47 | } 48 | 49 | /** 50 | * Get the elapsed time converted to milli seconds. 51 | * 52 | * @return elapsed time converted to milli seconds 53 | */ 54 | private long getMilliSeconds() { 55 | return elapsedCount; 56 | } 57 | 58 | /** 59 | * Get the elapsed time as a formatted string. 60 | * @return milli seconds as string 61 | */ 62 | @Override 63 | public String toString() { 64 | return getMilliSeconds() + " ms"; 65 | } 66 | } 67 | -------------------------------------------------------------------------------- /JavaFactorial/src/de/luschny/apps/factorial/FactorialTest.java: -------------------------------------------------------------------------------- 1 | // Copyright (C) 2004-2009 Peter Luschny, MIT License applies. 2 | // See http://en.wikipedia.org/wiki/MIT_License 3 | // Visit http://www.luschny.de/math/factorial/FastFactorialFunctions.htm 4 | // Comments mail to: peter(at)luschny.de 5 | package de.luschny.apps.factorial; 6 | 7 | import java.util.Iterator; 8 | 9 | public class FactorialTest { 10 | 11 | public static final int benchMax = 100000000; 12 | public boolean[] selectedAlgo; 13 | public int benchLength; 14 | public int benchStart; 15 | public double stepFactor; 16 | public boolean showFullValue; 17 | public boolean verbose; 18 | public double workLoad; 19 | public int[] benchValues; 20 | public int cardSelected; 21 | public boolean sanityTest; 22 | 23 | public void init() { 24 | Candidate.setSelected(selectedAlgo); 25 | 26 | benchValues = new int[benchLength]; 27 | double sum = 0; 28 | long value = benchStart; 29 | 30 | for (int m = 0; m < benchLength; m++) { 31 | if (value < benchMax) { 32 | benchValues[m] = (int) value; 33 | sum += value; 34 | } else { 35 | benchValues[m] = 1; 36 | } 37 | value = (long) (value * stepFactor); 38 | } 39 | 40 | cardSelected = 0; 41 | workLoad = 0; 42 | 43 | Iterator36 | /// 37 | /// version cs-2004-09-03 38 | /// author Peter Luschny 39 | /// 40 | ///20 | /// 21 | /// To understand the difference between "SieveRange" and "PrimeRange" 22 | /// better, let us consider the following example: 23 | /// 24 | /// If the SieveRange is 10..20, then the PrimeRange is 5..8, 25 | /// because of the following table 26 | /// 27 | /// <- SieveRange -> 28 | /// 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23 29 | /// x,1,2,x,3,x,4,x,x, x, 5, x, 6, x, x, x, 7, x, 8, x, x, x, 9 30 | /// <- PrimeRange -> 31 | /// 32 | /// Thus the smallest prime in the SieveRange is the 5-th prime and 33 | /// the largest prime in this SieveRange is the 8-th prime. 34 | /// 35 | ///